Pub Date : 2013-12-01DOI: 10.1109/icist.2013.6747630
Xiaobin Wang, Malu Zhang, Yuanjing Yang
{"title":"Session 20: Ubi/cloud computing","authors":"Xiaobin Wang, Malu Zhang, Yuanjing Yang","doi":"10.1109/icist.2013.6747630","DOIUrl":"https://doi.org/10.1109/icist.2013.6747630","url":null,"abstract":"","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125845587","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747839
Tong Lin, Kai-zhi Huang, W. Luo
Traditional physical layer security methods, such as artificial noise, commonly require that the sender has more antennas than that of the receivers, which is not practical in the multicasting system. To solve this problem, a multicarrier-based physical layer security scheme for the multicast systems is proposed, which takes the advantage of both space and frequency domain to form a relatively virtual multi-antenna system. Through subcarrier allocation the existence of null space in every subcarrier channel matrix is guaranteed, so that the artificial noise can be added to ensure a secure communication. Based on the Kuhn-Tucher condition, an optimal power allocation method is also proposed to maximize the security rates under the restriction of total power. Simulation results indicate that this scheme is unlimited by the amount of the sender antennas, and it improves the security rates by 2 bit/s/Hz than the average power allocation method.
{"title":"A multicarrier-based physical layer security scheme for the multicast systems","authors":"Tong Lin, Kai-zhi Huang, W. Luo","doi":"10.1109/ICIST.2013.6747839","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747839","url":null,"abstract":"Traditional physical layer security methods, such as artificial noise, commonly require that the sender has more antennas than that of the receivers, which is not practical in the multicasting system. To solve this problem, a multicarrier-based physical layer security scheme for the multicast systems is proposed, which takes the advantage of both space and frequency domain to form a relatively virtual multi-antenna system. Through subcarrier allocation the existence of null space in every subcarrier channel matrix is guaranteed, so that the artificial noise can be added to ensure a secure communication. Based on the Kuhn-Tucher condition, an optimal power allocation method is also proposed to maximize the security rates under the restriction of total power. Simulation results indicate that this scheme is unlimited by the amount of the sender antennas, and it improves the security rates by 2 bit/s/Hz than the average power allocation method.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115684371","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747672
D. Niu, Hongchang Chen, Lixiong Liu
For global community detection algorithm having high computation complexity and local community detection algorithm working bad in community quality, in this paper we propose an algorithm by finding the core nodes in different communities first, then use an algorithm based on transferring the similarity we propose in this paper to measure the similarity between core nodes with other nodes. Finally we divide the network by the similarity calculation results.The proposed algorithm is tested on both our network and common networks, and is compared with the typical algorithms in community detection. Experimental results verify and confirm the feasibility and validity of the proposed algorithm.
{"title":"The community detection algorithm based on transferring the similarity","authors":"D. Niu, Hongchang Chen, Lixiong Liu","doi":"10.1109/ICIST.2013.6747672","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747672","url":null,"abstract":"For global community detection algorithm having high computation complexity and local community detection algorithm working bad in community quality, in this paper we propose an algorithm by finding the core nodes in different communities first, then use an algorithm based on transferring the similarity we propose in this paper to measure the similarity between core nodes with other nodes. Finally we divide the network by the similarity calculation results.The proposed algorithm is tested on both our network and common networks, and is compared with the typical algorithms in community detection. Experimental results verify and confirm the feasibility and validity of the proposed algorithm.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123398729","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747489
Xiaowen Zhang, Zhaomin Liu, Yuming Xuan
Objects were better recognized in consistent scenes (where objects appeared frequently) than inconsistent scenes (where objects appeared rarely). This consistency effect also was found in the facial expressional recognition in scenes. However, the underlying mechanisms of expressional recognition in scenes were not clear. In the present study, we addressed the question of whether emotional scenes influenced recognition of facial expression through top-down priming effect. In two experiments, emotional scenes and facial expressions were presented sequentially or simultaneously and participants were instructed to categorize facial expressions, ignoring scenes. Similar consistency effects and happy face advantage were observed which suggested emotional scenes automatically influenced expressional recognition through priming effect.
{"title":"The role of emotional scenes in facial expressional recognition: Priming versus contextual effect","authors":"Xiaowen Zhang, Zhaomin Liu, Yuming Xuan","doi":"10.1109/ICIST.2013.6747489","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747489","url":null,"abstract":"Objects were better recognized in consistent scenes (where objects appeared frequently) than inconsistent scenes (where objects appeared rarely). This consistency effect also was found in the facial expressional recognition in scenes. However, the underlying mechanisms of expressional recognition in scenes were not clear. In the present study, we addressed the question of whether emotional scenes influenced recognition of facial expression through top-down priming effect. In two experiments, emotional scenes and facial expressions were presented sequentially or simultaneously and participants were instructed to categorize facial expressions, ignoring scenes. Similar consistency effects and happy face advantage were observed which suggested emotional scenes automatically influenced expressional recognition through priming effect.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126734766","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747545
Lizhi Wang, Jun Zhou
Swing equations of individual synchronous generators in multi-machine systems have strong power-swing nonlinearities. In this paper and for the first time, we introduce sliding mode control (SMC) laws to deal with power swing reduction problem in individual generators directly without linearizing their swing equations. The suggested control laws are implemented by static VAR compensators (or simply, the so-called SVC) attached to the output terminal of a generator. To improve steady-state and/or transient performances in power generation and operation of generators, we further consider adjusting the coefficients of switching function and the control gains. Numeric stimulation clearly shows that the suggested sliding mode control stabilization works well.
{"title":"Power swing reduction in synchronous generators via SVC designed with sliding mode control","authors":"Lizhi Wang, Jun Zhou","doi":"10.1109/ICIST.2013.6747545","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747545","url":null,"abstract":"Swing equations of individual synchronous generators in multi-machine systems have strong power-swing nonlinearities. In this paper and for the first time, we introduce sliding mode control (SMC) laws to deal with power swing reduction problem in individual generators directly without linearizing their swing equations. The suggested control laws are implemented by static VAR compensators (or simply, the so-called SVC) attached to the output terminal of a generator. To improve steady-state and/or transient performances in power generation and operation of generators, we further consider adjusting the coefficients of switching function and the control gains. Numeric stimulation clearly shows that the suggested sliding mode control stabilization works well.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122613586","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747668
Yuan Huang, Wei Hou, Xiaowei Li, Shaomei Li
The traditional social network community detection algorithms generally lack of consideration of link attributes, and full expression using link attribute information model and mechanism. Aiming at this issue, this paper puts forward the community detection algorithm of social network through fusion the link and node attributes. We combine similarity of node attributes between adjacent nodes and link information, and define the similar weights. On this basis, the algorithm realizes community detection of the social network by combining condensation algorithm. Experiments show that effect of this algorithm about social network attribute is remarkable, obviously in attribute-distinct community.
{"title":"An effective community detection algorithm of the social networks","authors":"Yuan Huang, Wei Hou, Xiaowei Li, Shaomei Li","doi":"10.1109/ICIST.2013.6747668","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747668","url":null,"abstract":"The traditional social network community detection algorithms generally lack of consideration of link attributes, and full expression using link attribute information model and mechanism. Aiming at this issue, this paper puts forward the community detection algorithm of social network through fusion the link and node attributes. We combine similarity of node attributes between adjacent nodes and link information, and define the similar weights. On this basis, the algorithm realizes community detection of the social network by combining condensation algorithm. Experiments show that effect of this algorithm about social network attribute is remarkable, obviously in attribute-distinct community.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418923","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747543
Liyi Li, Guangjun Tan, Jiaxi Liu, B. Kou
This paper proposes an optimal pulse width modulation (PWM) method for high-speed permanent magnet synchronous motor (PMSM), which combines the proposed fundamental voltage component invariance (FVCI) PWM method ensuring the same voltage and current fundamental components as the command waveforms, with the minimum current harmonic PWM method. First, the paper regards the third harmonic injection PWM (THIPWM) with 25% third harmonic as the minimum current harmonic PWM method, and proposes a simple algorithm to generate the third harmonic based on the three-phase fundamental voltage waves. Then the paper proposes a FVCI-PWM method, which ensures that the PWM waveform has the same fundamental component as the command sinusoidal voltage waveform without current closed-loop control. The simulation and experimental results upon the 60000rpm PMSM are carried out finally to verify the effectiveness of the proposed PWM method.
{"title":"An optimal pulse width modulation method for high-speed permanent magnet synchronous motor","authors":"Liyi Li, Guangjun Tan, Jiaxi Liu, B. Kou","doi":"10.1109/ICIST.2013.6747543","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747543","url":null,"abstract":"This paper proposes an optimal pulse width modulation (PWM) method for high-speed permanent magnet synchronous motor (PMSM), which combines the proposed fundamental voltage component invariance (FVCI) PWM method ensuring the same voltage and current fundamental components as the command waveforms, with the minimum current harmonic PWM method. First, the paper regards the third harmonic injection PWM (THIPWM) with 25% third harmonic as the minimum current harmonic PWM method, and proposes a simple algorithm to generate the third harmonic based on the three-phase fundamental voltage waves. Then the paper proposes a FVCI-PWM method, which ensures that the PWM waveform has the same fundamental component as the command sinusoidal voltage waveform without current closed-loop control. The simulation and experimental results upon the 60000rpm PMSM are carried out finally to verify the effectiveness of the proposed PWM method.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122103653","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747795
Tianming Jiang, Yuanyuan Gao, W. Fang, Baofeng Yang, Y. Long
In wireless networks, physical-layer network coding (PNC) is a practical technique to utilize the addition of two simultaneous arriving electromagnetic (EM) waves and realize exchanging messages in two time slots. When several nodes (more than two) need to exchange messages through one relay node, traditional PNC scheme can't deal with the addition of more than two EM waves. The paper proposes an enhanced physical-layer network coding scheme (EPNC) to solve this problem. Through this proposition more than two nodes can exchange messages in two time slots. A four node wireless network model is analyzed and compared with traditional data transmission (TDT) and PNC schemes in the paper. It is concluded that the proposed scheme achieves progress in throughput compared with PNC.
{"title":"An enhanced approach to physical-layer network coding","authors":"Tianming Jiang, Yuanyuan Gao, W. Fang, Baofeng Yang, Y. Long","doi":"10.1109/ICIST.2013.6747795","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747795","url":null,"abstract":"In wireless networks, physical-layer network coding (PNC) is a practical technique to utilize the addition of two simultaneous arriving electromagnetic (EM) waves and realize exchanging messages in two time slots. When several nodes (more than two) need to exchange messages through one relay node, traditional PNC scheme can't deal with the addition of more than two EM waves. The paper proposes an enhanced physical-layer network coding scheme (EPNC) to solve this problem. Through this proposition more than two nodes can exchange messages in two time slots. A four node wireless network model is analyzed and compared with traditional data transmission (TDT) and PNC schemes in the paper. It is concluded that the proposed scheme achieves progress in throughput compared with PNC.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117272727","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747571
Aditya Yulianto, S. Kom, Maria Irmina Prasetiyowati
Dropbox, a popular cloud storage provider, pose several threats especially in terms of file security and unauthorized access. An Android and a web application which implemented Serpent cryptographic algorithm and One-Time Password (OTP) mechanism to secure files on Dropbox and a web application was built as a solution by utilizing Dropbox Application Programming Interface (API) and Bouncy Castle library. The aim of this research is to make an application for encrypting Dropbox files and therefore, to ensure uploaded files from being accessed by unauthorized parties. In this research, Serpent algorithm was implemented because of its hardware efficiency and an additional feature, OTP mechanism, was used as additional user authentication process. The research shown that encryption and decryption processes each took three seconds for processing a two megabytes file, and the file was not accessible in encrypted form.
{"title":"BoxLock: Mobile-based Serpent cryptographic algorithm and One-Time Password mechanism implementation for Dropbox files security","authors":"Aditya Yulianto, S. Kom, Maria Irmina Prasetiyowati","doi":"10.1109/ICIST.2013.6747571","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747571","url":null,"abstract":"Dropbox, a popular cloud storage provider, pose several threats especially in terms of file security and unauthorized access. An Android and a web application which implemented Serpent cryptographic algorithm and One-Time Password (OTP) mechanism to secure files on Dropbox and a web application was built as a solution by utilizing Dropbox Application Programming Interface (API) and Bouncy Castle library. The aim of this research is to make an application for encrypting Dropbox files and therefore, to ensure uploaded files from being accessed by unauthorized parties. In this research, Serpent algorithm was implemented because of its hardware efficiency and an additional feature, OTP mechanism, was used as additional user authentication process. The research shown that encryption and decryption processes each took three seconds for processing a two megabytes file, and the file was not accessible in encrypted form.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129523888","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747790
Jiajia Wu, Y. Wan, Zhenming Su
Point set registration is a key problem in many computer vision tasks. The goal of point set registration is to match two sets of points and estimate the transformation parameter that maps one point set to the other. Among the many published registration methods, the recently proposed Coherent Point Drift (CPD) algorithm stands out for its accuracy. In this paper we show that by casting CPD in the Bayesian framework we can obtain even better results. In particular, in case of large translation amount, our proposed mathod has much less number of iterations than CPD without any loss of accuracy. Experimental results confirms the advantages of the proposed method and shows an overall speedup when compared with the CPD method.
{"title":"Bayesian rigid point set registration using logarithmic double exponential prior","authors":"Jiajia Wu, Y. Wan, Zhenming Su","doi":"10.1109/ICIST.2013.6747790","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747790","url":null,"abstract":"Point set registration is a key problem in many computer vision tasks. The goal of point set registration is to match two sets of points and estimate the transformation parameter that maps one point set to the other. Among the many published registration methods, the recently proposed Coherent Point Drift (CPD) algorithm stands out for its accuracy. In this paper we show that by casting CPD in the Bayesian framework we can obtain even better results. In particular, in case of large translation amount, our proposed mathod has much less number of iterations than CPD without any loss of accuracy. Experimental results confirms the advantages of the proposed method and shows an overall speedup when compared with the CPD method.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455033","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
扫码关注我们
求助内容：
应助结果提醒方式：