Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920605
Shouwei Sun, Yizhang Jiang, Pengjiang Qian
The classical maximum entropy clustering (MEC) algorithm can only work on a single dataset, which might result in poor effectiveness in the condition that the capacity of the dataset is insufficient. To resolve this problem, using the strategy of transfer learning, this paper proposed the novel transfer learning based maximum entropy clustering (TL_MEC) algorithm. TL_MEC employs the historical cluster centers and membership of the past data as the references to guide the clustering on the current data, which promotes its performance distinctly from three aspects: clustering effectiveness, anti-noise, as well as privacy protection. Thus TL_MEC can work well on those small dataset if enough historical data are available. The experimental studies verified and demonstrated the contributions of this study.
{"title":"Transfer learning based maximum entropy clustering","authors":"Shouwei Sun, Yizhang Jiang, Pengjiang Qian","doi":"10.1109/ICIST.2014.6920605","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920605","url":null,"abstract":"The classical maximum entropy clustering (MEC) algorithm can only work on a single dataset, which might result in poor effectiveness in the condition that the capacity of the dataset is insufficient. To resolve this problem, using the strategy of transfer learning, this paper proposed the novel transfer learning based maximum entropy clustering (TL_MEC) algorithm. TL_MEC employs the historical cluster centers and membership of the past data as the references to guide the clustering on the current data, which promotes its performance distinctly from three aspects: clustering effectiveness, anti-noise, as well as privacy protection. Thus TL_MEC can work well on those small dataset if enough historical data are available. The experimental studies verified and demonstrated the contributions of this study.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122197994","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-04-26DOI: 10.1109/ICIST.2014.6920345
Weiwei Yuan, D. Guan, Linshan Shen, Haiwei Pan
Finding suitable number of recommenders helps to improve the efficiency and the rating prediction accuracy in the trust-aware recommender system (TARS). Most existing works involve all available recommenders to enlarge the diversity of recommendations. However, it is computational expensive if the number of involved recommenders is big. In this work, we experimental study real application data to find the suitable number of recommenders needs to be involved in TARS. It is suggested that all recommenders should be involved for most users. For those who have sufficient number of recommenders, only part of recommenders is suggested to be involved, i.e., around one fourth of the maximum number of recommenders in our experimental dataset.
{"title":"Finding suitable number of recommenders for trust-aware recommender systems: An experimental study","authors":"Weiwei Yuan, D. Guan, Linshan Shen, Haiwei Pan","doi":"10.1109/ICIST.2014.6920345","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920345","url":null,"abstract":"Finding suitable number of recommenders helps to improve the efficiency and the rating prediction accuracy in the trust-aware recommender system (TARS). Most existing works involve all available recommenders to enlarge the diversity of recommendations. However, it is computational expensive if the number of involved recommenders is big. In this work, we experimental study real application data to find the suitable number of recommenders needs to be involved in TARS. It is suggested that all recommenders should be involved for most users. For those who have sufficient number of recommenders, only part of recommenders is suggested to be involved, i.e., around one fourth of the maximum number of recommenders in our experimental dataset.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314311","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-04-26DOI: 10.1109/ICIST.2014.6920331
Lin Zhumei, Zhu Liqi
Moral hypocrisy is a phenomenon in which individuals evaluating other people's moral transgressions differ from their evaluations of the same transgressions enacted by themselves. The present study examined whether there is a moral hypocrisy when participants take different roles in moral dilemma. We found that although participants' decisions were no different when they taking different roles in moral dilemmas, the participants in the role of a protagonist took more time to make a decision. These results demonstrated that there may be an implicit moral hypocrisy in moral dilemmas and supported the view that it is the volitionally-guided justifications that results i n hypocrisy.
{"title":"Moral hypocrisy in moral dilemma","authors":"Lin Zhumei, Zhu Liqi","doi":"10.1109/ICIST.2014.6920331","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920331","url":null,"abstract":"Moral hypocrisy is a phenomenon in which individuals evaluating other people's moral transgressions differ from their evaluations of the same transgressions enacted by themselves. The present study examined whether there is a moral hypocrisy when participants take different roles in moral dilemma. We found that although participants' decisions were no different when they taking different roles in moral dilemmas, the participants in the role of a protagonist took more time to make a decision. These results demonstrated that there may be an implicit moral hypocrisy in moral dilemmas and supported the view that it is the volitionally-guided justifications that results i n hypocrisy.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229907","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-04-26DOI: 10.1109/ICIST.2014.6920376
Jianfeng Zhao
It's important to effectively storage, computing and translate the massive data (i.e. passenger flow data, equipment monitoring data) into information. This paper proposed a data processing framework based on cloud computing for urban railway. First of all, the existing problem of traditional data processing platform for urban railway was analyzed; Then, the advantages of cloud computing platform was presented, the merits and faults of the current main cloud computing products was compared; Finally, an urban railway data processing framework based on cloud computing was proposed. This framework was based on Hadoop, used the HDFS to storage data, employed the MapReduce to calculate data and invoked the Hive to mine the data. This paper laid a good foundation for introducing cloud computing to urban railway as its information platform.
{"title":"Research on framework for urban railway massive data based on cloud computing platform","authors":"Jianfeng Zhao","doi":"10.1109/ICIST.2014.6920376","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920376","url":null,"abstract":"It's important to effectively storage, computing and translate the massive data (i.e. passenger flow data, equipment monitoring data) into information. This paper proposed a data processing framework based on cloud computing for urban railway. First of all, the existing problem of traditional data processing platform for urban railway was analyzed; Then, the advantages of cloud computing platform was presented, the merits and faults of the current main cloud computing products was compared; Finally, an urban railway data processing framework based on cloud computing was proposed. This framework was based on Hadoop, used the HDFS to storage data, employed the MapReduce to calculate data and invoked the Hive to mine the data. This paper laid a good foundation for introducing cloud computing to urban railway as its information platform.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129178600","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-04-26DOI: 10.1109/ICIST.2014.6920329
Jiansong Miao, Lin Ma, Kai Liu, Yan Wang, Shuying Wang
The improved partial proportional fair (IPPF) algorithm for OFDMA relay system is proposed, aiming at solving the fairness scheduling problem. Subcarriers are distributed to all users in both two sub-timeslots. And the relay users are regarded as two users in the subcarrier scheduling for the second sub-timeslot, so as to balance the data rates of all users. The IPPF algorithm achieves a better balance between the system throughput and user fairness, compared with the partial proportional fair (PPF) algorithm and the two-hop proportional fairness (THPF) algorithm, from the simulation results. Since the PPF algorithm only ensures the user fairness of the second sub-timeslot, and the system with THPF suffers a big throughput loss.
{"title":"Improved partial proportional fair scheduling algorithm for OFDMA relay system","authors":"Jiansong Miao, Lin Ma, Kai Liu, Yan Wang, Shuying Wang","doi":"10.1109/ICIST.2014.6920329","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920329","url":null,"abstract":"The improved partial proportional fair (IPPF) algorithm for OFDMA relay system is proposed, aiming at solving the fairness scheduling problem. Subcarriers are distributed to all users in both two sub-timeslots. And the relay users are regarded as two users in the subcarrier scheduling for the second sub-timeslot, so as to balance the data rates of all users. The IPPF algorithm achieves a better balance between the system throughput and user fairness, compared with the partial proportional fair (PPF) algorithm and the two-hop proportional fairness (THPF) algorithm, from the simulation results. Since the PPF algorithm only ensures the user fairness of the second sub-timeslot, and the system with THPF suffers a big throughput loss.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129875724","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-04-26DOI: 10.1109/ICIST.2014.6920582
Xiaofeng Liao, Q. Jiang, Wei Zhang, Kai Zhang
A BiModal Latent Dirichlet Allocation Model(BM-LDA) is proposed to learn a unified representation of data that comes from both the textual and visual modalities together. The model is able to form a unified representation that mixs both the textual and visual modalities. Based on the assumption, that the images and its surrounding text share a same topic, the model learns a posterior probability density in the space of latent variable of topics that bridging over the observed multi modality inputs. It maps the high dimensional space consist of the observed variables from both modalities to a low dimensional space of topcis. Experimental result on ImageCLEF data set, which consists of bi-modality data of images and surrounding text, shows our new BM-LDA model can get a fine representation for the multi-modality data, which is useful for tasks such as retrieval and classification.
{"title":"BiModal latent dirichlet allocation for text and image","authors":"Xiaofeng Liao, Q. Jiang, Wei Zhang, Kai Zhang","doi":"10.1109/ICIST.2014.6920582","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920582","url":null,"abstract":"A BiModal Latent Dirichlet Allocation Model(BM-LDA) is proposed to learn a unified representation of data that comes from both the textual and visual modalities together. The model is able to form a unified representation that mixs both the textual and visual modalities. Based on the assumption, that the images and its surrounding text share a same topic, the model learns a posterior probability density in the space of latent variable of topics that bridging over the observed multi modality inputs. It maps the high dimensional space consist of the observed variables from both modalities to a low dimensional space of topcis. Experimental result on ImageCLEF data set, which consists of bi-modality data of images and surrounding text, shows our new BM-LDA model can get a fine representation for the multi-modality data, which is useful for tasks such as retrieval and classification.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126451914","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-04-26DOI: 10.1109/ICIST.2014.6920537
An Xiang, Ruitao Chen, S. Wei, Guoqing Xu
This paper first introduces a novel type of current-fed push-pull ZVS dc/dc converter. Compared with the traditional Phase-shifted ZVS converter used in fuel cell system, this new converter can reduce the semiconductor switching losses and EMI noise and increase the circuit conversion efficiency. This paper also presents a detailed derivation of small-signal model using state space averaging technique. Then it designs the parameters of PI regulator for the current-loop and voltage-loop based on small-signal model. Finally, it gives the simulation model of the dual closed-loop control system with PSIM simulation software. The simulation results show that the designations of small-signal model and two controllers are feasible.
{"title":"Small signal analysis of a novel type of ZVS DC-DC converter for fuel cell","authors":"An Xiang, Ruitao Chen, S. Wei, Guoqing Xu","doi":"10.1109/ICIST.2014.6920537","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920537","url":null,"abstract":"This paper first introduces a novel type of current-fed push-pull ZVS dc/dc converter. Compared with the traditional Phase-shifted ZVS converter used in fuel cell system, this new converter can reduce the semiconductor switching losses and EMI noise and increase the circuit conversion efficiency. This paper also presents a detailed derivation of small-signal model using state space averaging technique. Then it designs the parameters of PI regulator for the current-loop and voltage-loop based on small-signal model. Finally, it gives the simulation model of the dual closed-loop control system with PSIM simulation software. The simulation results show that the designations of small-signal model and two controllers are feasible.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128973543","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-04-26DOI: 10.1109/ICIST.2014.6920584
Caiyun Ye, Lijun Yue, Fengqi Yu
Rate control is one of the key techniques in wireless multimedia sensor networks. This paper proposes an algorithm to enhance the performance of the rate control. In line with the difference between actual number of bits and expected ones of the last frame and difference between actual bit-rate and target bit-rate of encoded frames, we adjust the quantization parameter (QP). Simulations show the output real bit-rate is closer to the target one than the current bit-rate control algorithms without losing peak signal to noise ratio (PSNR).
{"title":"A bit-rate control algorithm for wireless multimedia sensor networks","authors":"Caiyun Ye, Lijun Yue, Fengqi Yu","doi":"10.1109/ICIST.2014.6920584","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920584","url":null,"abstract":"Rate control is one of the key techniques in wireless multimedia sensor networks. This paper proposes an algorithm to enhance the performance of the rate control. In line with the difference between actual number of bits and expected ones of the last frame and difference between actual bit-rate and target bit-rate of encoded frames, we adjust the quantization parameter (QP). Simulations show the output real bit-rate is closer to the target one than the current bit-rate control algorithms without losing peak signal to noise ratio (PSNR).","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793529","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-04-26DOI: 10.1109/ICIST.2014.6920326
Dan Ding, Naiping Cheng
In the paper, the widely used numerical optimization method for linear frequency modulated (LFM) signal parameters estimation is modified. To this purpose, an improved Dividing RECTangles (DIRECT) algorithm is proposed to substitute for the commonly used grid search method. The proposed global optimization algorithm can provide initial estimates for local optimization algorithms such as Newton and Simplex. Based on classical DIRECT algorithm, the improved version, called Lipschitz constant assisted DIRECT (L-DIRECT) Algorithm, eliminates hopeless areas, suspends unlikely areas, and concentrates on more promising areas in search space, finding the range of attraction (ROA) with lower SNR threshold or less computational burden for local optimization algorithms. The effect of the modification is validated by simulation results.
{"title":"LFM signal parameters estimation using an improved DIRECT algorithm","authors":"Dan Ding, Naiping Cheng","doi":"10.1109/ICIST.2014.6920326","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920326","url":null,"abstract":"In the paper, the widely used numerical optimization method for linear frequency modulated (LFM) signal parameters estimation is modified. To this purpose, an improved Dividing RECTangles (DIRECT) algorithm is proposed to substitute for the commonly used grid search method. The proposed global optimization algorithm can provide initial estimates for local optimization algorithms such as Newton and Simplex. Based on classical DIRECT algorithm, the improved version, called Lipschitz constant assisted DIRECT (L-DIRECT) Algorithm, eliminates hopeless areas, suspends unlikely areas, and concentrates on more promising areas in search space, finding the range of attraction (ROA) with lower SNR threshold or less computational burden for local optimization algorithms. The effect of the modification is validated by simulation results.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670675","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}
The general inverted pendulum on a cart (termed IPC) model with nonzero link mass is investigated and analyzed for the tracking-control problem solving due to its concise and representative structure. According to the numbers of times of using Zhang dynamics (ZD) and gradient dynamics (GD) methods, novel controllers are designed and analyzed for the tracking control of the IPC model with nonzero link mass, which are thus termed ZG (Zhang gradient) controllers. Note that the ZG controllers are of z2g0 and z2g1 types in the paper. More importantly, the efficacy and superiority of ZG controllers are further verified via plenty of computer simulations for the cart path tracking of the general IPC model with nonzero link mass.
{"title":"Verification of ZG controllers for cart path tracking of general IPC model with nonzero link mass","authors":"Mingzhi Mao, Zhengli Xiao, Xiaotian Yu, Yonghua Yin, Yunong Zhang","doi":"10.1109/ICIST.2014.6920384","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920384","url":null,"abstract":"The general inverted pendulum on a cart (termed IPC) model with nonzero link mass is investigated and analyzed for the tracking-control problem solving due to its concise and representative structure. According to the numbers of times of using Zhang dynamics (ZD) and gradient dynamics (GD) methods, novel controllers are designed and analyzed for the tracking control of the IPC model with nonzero link mass, which are thus termed ZG (Zhang gradient) controllers. Note that the ZG controllers are of z2g0 and z2g1 types in the paper. More importantly, the efficacy and superiority of ZG controllers are further verified via plenty of computer simulations for the cart path tracking of the general IPC model with nonzero link mass.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131124144","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
扫码关注我们
求助内容：
应助结果提醒方式：