Based on the degree of participation and contribution, the current study classified online community users into four categories, which are active login, active participant, indirect contributor and direct contributor. In order to help enterprises understand how users of different categories behave and how to guide users to the category which is beneficial to the enterprise's marketing efforts, the study adopted the relatively static variable of consumer's role to represent the dynamic consumer behaviors and empirically tested the path of user's role formation in an enterprise's official community with the applications of SEM.
{"title":"The Formation of Consumer's Role in Virtual Communities","authors":"Zhiying Zheng, Lei Shen","doi":"10.1109/ISCID.2013.161","DOIUrl":"https://doi.org/10.1109/ISCID.2013.161","url":null,"abstract":"Based on the degree of participation and contribution, the current study classified online community users into four categories, which are active login, active participant, indirect contributor and direct contributor. In order to help enterprises understand how users of different categories behave and how to guide users to the category which is beneficial to the enterprise's marketing efforts, the study adopted the relatively static variable of consumer's role to represent the dynamic consumer behaviors and empirically tested the path of user's role formation in an enterprise's official community with the applications of SEM.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126613073","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}
A new adaptive demodulation(ADM) scheme based on rate less code and Maximum a Posteriori Probability compute the log-likelihood ratio(LLR) of each bit in the modulated symbol, if the LLR of this bit is larger than the pre-set threshold, demodulate this bit, else delete it. Because the channel state information(CSI) is known by the receiver, this scheme select the bit to demodulate based on the CSI, so it improve the channel usage. The demodulate threshold in this algorithm determines the demodulation order, hence it has great influence on system performance. This paper analyses the demodulation threshold in this adaptive demodulation algorithm, and find out the optimal threshold by simulation, in order to achieve the optimal performance.
{"title":"Analysis of the Threshold in Adaptive Demodulation","authors":"Xujin Guo, Weijia Lei, Xianzhong Xie","doi":"10.1109/ISCID.2013.159","DOIUrl":"https://doi.org/10.1109/ISCID.2013.159","url":null,"abstract":"A new adaptive demodulation(ADM) scheme based on rate less code and Maximum a Posteriori Probability compute the log-likelihood ratio(LLR) of each bit in the modulated symbol, if the LLR of this bit is larger than the pre-set threshold, demodulate this bit, else delete it. Because the channel state information(CSI) is known by the receiver, this scheme select the bit to demodulate based on the CSI, so it improve the channel usage. The demodulate threshold in this algorithm determines the demodulation order, hence it has great influence on system performance. This paper analyses the demodulation threshold in this adaptive demodulation algorithm, and find out the optimal threshold by simulation, in order to achieve the optimal performance.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129189933","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 operational effectiveness of torpedo weapon system (TWS) is exhibited in the process of attack-defense movement. According to the uncertainty of situation in using torpedo weapon system, a new dynamic-static evaluation effectiveness method (fuzzy probability) is proposed using fuzzy mathematics and AHP. The math model and arithmetic is presented, and the operational effectiveness of shipboard torpedo is analyzed. The result shows the efficiency of the method in evaluation for operational effectiveness of complex weapon system with fuzzy and uncertain dynamic-countermeasure characteristic.
{"title":"Evaluation of Operational Effectiveness for TWS Based on Fuzzy Probability","authors":"Zhijun Xia, Linzhou Xu, Wentao Fan","doi":"10.1109/ISCID.2013.92","DOIUrl":"https://doi.org/10.1109/ISCID.2013.92","url":null,"abstract":"The operational effectiveness of torpedo weapon system (TWS) is exhibited in the process of attack-defense movement. According to the uncertainty of situation in using torpedo weapon system, a new dynamic-static evaluation effectiveness method (fuzzy probability) is proposed using fuzzy mathematics and AHP. The math model and arithmetic is presented, and the operational effectiveness of shipboard torpedo is analyzed. The result shows the efficiency of the method in evaluation for operational effectiveness of complex weapon system with fuzzy and uncertain dynamic-countermeasure characteristic.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131414322","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}
Recently, semi-supervised learning has attracted much attention, and it is applicable to both clustering and classification. But among a large number of these algorithms, only a few considered combining semi-supervised clustering and classification together. However, in supervised learning, the fuzzy relational classifier (FRC) is a recently proposed two-step nonlinear classifier which combines the unsupervised clustering and supervised classification together. Inspired from FRC, in this paper, we present a new method, called Semi-supervised Fuzzy Relational Classifier (SSFRC), which combines semi-supervised clustering and classification together. In the proposed SSFRC, we employ the semi-supervised pair wise-constrained competitive agglomeration (PCCA) to replace FCM to obtain clusters fitting user expectations without specifying the exact cluster number. In addition, we incorporate the fuzzy class labels of unlabeled data into the classification mechanism to improve its performance. The experimental results on real-life datasets demonstrate that SSFRC can outperform FRC with all data labeled in classification performance.
{"title":"Semi-supervised Fuzzy Relational Classifier","authors":"Yuesong Yan, Jinsheng Cui, Zhisong Pan","doi":"10.1109/ISCID.2013.207","DOIUrl":"https://doi.org/10.1109/ISCID.2013.207","url":null,"abstract":"Recently, semi-supervised learning has attracted much attention, and it is applicable to both clustering and classification. But among a large number of these algorithms, only a few considered combining semi-supervised clustering and classification together. However, in supervised learning, the fuzzy relational classifier (FRC) is a recently proposed two-step nonlinear classifier which combines the unsupervised clustering and supervised classification together. Inspired from FRC, in this paper, we present a new method, called Semi-supervised Fuzzy Relational Classifier (SSFRC), which combines semi-supervised clustering and classification together. In the proposed SSFRC, we employ the semi-supervised pair wise-constrained competitive agglomeration (PCCA) to replace FCM to obtain clusters fitting user expectations without specifying the exact cluster number. In addition, we incorporate the fuzzy class labels of unlabeled data into the classification mechanism to improve its performance. The experimental results on real-life datasets demonstrate that SSFRC can outperform FRC with all data labeled in classification performance.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123872618","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 least mean squares (LMS) algorithm is widely applied in the machine learning community. Insensitive Modification of Subspace Information Criterion (IMSIC) is one of the model selection methods, which is defined on an unbiased estimator of the generalization error-Subspace Information Criterion(SIC). In this paper, we will give the method of selecting LMS learning models by IMSIC.
{"title":"Insensitive Modification of Subspace Information Criterion for Least Mean Squares Learning","authors":"Xuejun Zhou","doi":"10.1109/ISCID.2013.219","DOIUrl":"https://doi.org/10.1109/ISCID.2013.219","url":null,"abstract":"The least mean squares (LMS) algorithm is widely applied in the machine learning community. Insensitive Modification of Subspace Information Criterion (IMSIC) is one of the model selection methods, which is defined on an unbiased estimator of the generalization error-Subspace Information Criterion(SIC). In this paper, we will give the method of selecting LMS learning models by IMSIC.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597518","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}
This paper analyzes the current mainstream open-source Open Stack cloud platform resource scheduling mechanism, and proposes an extensible resource optimization scheduling framework based on Open Stack. The framework divides the physical hyper visor host into multiple logical resource pools. It not only can configure global resources optimization strategy for individual resource pool, but also specify local resources optimization strategies for each resource pool. The results show that the multi-resource pool resource optimization scheduling optimization framework proposed in this article is good for Open Stack resource optimization, performance isolation and security isolation, and has a good extension.
{"title":"An OpenStack-Based Resource Optimization Scheduling Framework","authors":"Yu Huanle, S. Weifeng, Bai Tingting","doi":"10.1109/ISCID.2013.72","DOIUrl":"https://doi.org/10.1109/ISCID.2013.72","url":null,"abstract":"This paper analyzes the current mainstream open-source Open Stack cloud platform resource scheduling mechanism, and proposes an extensible resource optimization scheduling framework based on Open Stack. The framework divides the physical hyper visor host into multiple logical resource pools. It not only can configure global resources optimization strategy for individual resource pool, but also specify local resources optimization strategies for each resource pool. The results show that the multi-resource pool resource optimization scheduling optimization framework proposed in this article is good for Open Stack resource optimization, performance isolation and security isolation, and has a good extension.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117060903","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}
This paper focuses on the problem of building the user interest graph on microblog. While previous efforts in interest modeling on microblog have focused on building a "bag-of-words" profile only based on his own content or his followees' for each user. They ignored the fact that users always released posts about the fields which they are expert in, but not really interested in. By introducing the side information, a novel method is proposed to settle this problem by analyzing the posts they receive and update. The interest features are extracted from the user's followee by Latent Dirichlet Allocation (LDA), and then they are propagated to the user with a weighting factor. For every user, our method gives probabilities of different fields they may be interested in and it can be used for calculating the probability of a new topic this user will be interested in. We exploit the collected experimental data provided by Sina Weibo API to validate our method.
{"title":"Microblog User Interest Modeling Based on Feature Propagation","authors":"Qiunan Liu, K. Niu, Zhiqiang He, Xuan He","doi":"10.1109/ISCID.2013.102","DOIUrl":"https://doi.org/10.1109/ISCID.2013.102","url":null,"abstract":"This paper focuses on the problem of building the user interest graph on microblog. While previous efforts in interest modeling on microblog have focused on building a \"bag-of-words\" profile only based on his own content or his followees' for each user. They ignored the fact that users always released posts about the fields which they are expert in, but not really interested in. By introducing the side information, a novel method is proposed to settle this problem by analyzing the posts they receive and update. The interest features are extracted from the user's followee by Latent Dirichlet Allocation (LDA), and then they are propagated to the user with a weighting factor. For every user, our method gives probabilities of different fields they may be interested in and it can be used for calculating the probability of a new topic this user will be interested in. We exploit the collected experimental data provided by Sina Weibo API to validate our method.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252243","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}
Based on the software of Lab VIEW and the advantage of the virtual instrument, a suite of micro seismic real-time monitoring system is designed. A wavelet denoising method is presented here to process microseism signal, and the microseism record can get high signal to noise ratio. The advantage of the virtual instrument was sufficiently exerted to achieve the real-time monitoring and analyzing of the microseism.
{"title":"Design of Microseismic Monitoring System Based on Virtual Instrument","authors":"Lu Zeng, Shuren Han, D. Lai","doi":"10.1109/ISCID.2013.185","DOIUrl":"https://doi.org/10.1109/ISCID.2013.185","url":null,"abstract":"Based on the software of Lab VIEW and the advantage of the virtual instrument, a suite of micro seismic real-time monitoring system is designed. A wavelet denoising method is presented here to process microseism signal, and the microseism record can get high signal to noise ratio. The advantage of the virtual instrument was sufficiently exerted to achieve the real-time monitoring and analyzing of the microseism.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125894538","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 method is proposed for noise reduction of chaotic time series technique based on singularity spectrum. On the one hand, singularity spectrum has a good performance in the noise reduction for chaotic time series. On the other hand, what determine the order of singularity spectrum have not proposing. If the order selected is too high, full reduction of noise is not achieved. If the order selected is too low, the completeness of signal suffers distortion. So the order selected is a very important in chaotic noise reduction technique based on singularity spectrum. A novel arithmetic based on singularity entropy is introduced in this paper. The increment of singularity Entropy is sensitive with change of the order of singularity spectrum. Finally, experimental results show that the method is quite effective for determining noise reduction order in the field of chaotic time series.
{"title":"Noise Reduction for Chaotic Time Series Based on Singular Entropy","authors":"Haibo Yang, Ji-Cong Chen, Shuai Su","doi":"10.1109/ISCID.2013.167","DOIUrl":"https://doi.org/10.1109/ISCID.2013.167","url":null,"abstract":"The method is proposed for noise reduction of chaotic time series technique based on singularity spectrum. On the one hand, singularity spectrum has a good performance in the noise reduction for chaotic time series. On the other hand, what determine the order of singularity spectrum have not proposing. If the order selected is too high, full reduction of noise is not achieved. If the order selected is too low, the completeness of signal suffers distortion. So the order selected is a very important in chaotic noise reduction technique based on singularity spectrum. A novel arithmetic based on singularity entropy is introduced in this paper. The increment of singularity Entropy is sensitive with change of the order of singularity spectrum. Finally, experimental results show that the method is quite effective for determining noise reduction order in the field of chaotic time series.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988492","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}
It is notoriously known there are lots of factors influence cutter efficiency and tool life for boring operations. The key problem is how much each influenced and where is the best balance point. This paper uses the orthogonal test method to simulate and verified the influence by the most two important cutting parameters, like cutting speed, cutting penetration (which is the same as cutting depth as in the mechanical machine). Firstly, we used the optimized model and designed a new test mechanism. In the simulation part, we use Rock Failure Process Analysis in simulates the rock fragments and the changes of stress field. With these new numerical algorithms, we can simulate the mass and cutting forces in the boring, and we finally find each balance point in the real boring in different cutting parameters. And we also updated a new liner cutting test experimental mechanism, which can simulate the real boring operations in the lab when we set different cutting parameters. We use the simulation and test method to verify our predicting result. We show that the best penetration is 3.8mm and the best cutting speed is 2.1mm/s for 17 inches cutter ring in our cutting test. However, since we understand the complex of different factors we can bound the balance point to those values in certain boring condition.
{"title":"Predicting and Verifying Forces on Boring Parameters","authors":"Z. Wang, Kai Zhang, W. Wang, Haifeng Zhao","doi":"10.1109/ISCID.2013.101","DOIUrl":"https://doi.org/10.1109/ISCID.2013.101","url":null,"abstract":"It is notoriously known there are lots of factors influence cutter efficiency and tool life for boring operations. The key problem is how much each influenced and where is the best balance point. This paper uses the orthogonal test method to simulate and verified the influence by the most two important cutting parameters, like cutting speed, cutting penetration (which is the same as cutting depth as in the mechanical machine). Firstly, we used the optimized model and designed a new test mechanism. In the simulation part, we use Rock Failure Process Analysis in simulates the rock fragments and the changes of stress field. With these new numerical algorithms, we can simulate the mass and cutting forces in the boring, and we finally find each balance point in the real boring in different cutting parameters. And we also updated a new liner cutting test experimental mechanism, which can simulate the real boring operations in the lab when we set different cutting parameters. We use the simulation and test method to verify our predicting result. We show that the best penetration is 3.8mm and the best cutting speed is 2.1mm/s for 17 inches cutter ring in our cutting test. However, since we understand the complex of different factors we can bound the balance point to those values in certain boring condition.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217757","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
扫码关注我们
求助内容：
应助结果提醒方式：