Pub Date : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.23
Jianli Wei
The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incompletely known, and the attribute values take the form of linguistic variables. We develop a new method to solve linguistic MADM with incomplete weight. In order to get the weight vector of the attribute, we establish an optimization model based on the basic ideal of traditional TOPSIS, by which the attribute weights can be determined. Based on this model, we develop a TOPSIS method to rank alternatives and to select the most desirable one(s). Finally, an example is shown to highlight the procedure of the proposed algorithm at the end of this paper.
{"title":"TOPSIS Method for Multiple Attribute Decision Making with Incomplete Weight Information in Linguistic Setting","authors":"Jianli Wei","doi":"10.4156/JCIT.VOL5.ISSUE10.23","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.23","url":null,"abstract":"The aim of this paper is to investigate the multiple attribute decision making problems with linguistic information, in which the information about attribute weights is incompletely known, and the attribute values take the form of linguistic variables. We develop a new method to solve linguistic MADM with incomplete weight. In order to get the weight vector of the attribute, we establish an optimization model based on the basic ideal of traditional TOPSIS, by which the attribute weights can be determined. Based on this model, we develop a TOPSIS method to rank alternatives and to select the most desirable one(s). Finally, an example is shown to highlight the procedure of the proposed algorithm at the end of this paper.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132330324","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.30
Xiaojiang Liu, Nenghai Yu
The two most important tasks in entity information summarization from the Web are named entity recognition and relation extraction. Little work has been done toward an integrated statistical model for understanding both named entities and their relationships. Most of the previous works on relation extraction assume the named entities are pre-given. The drawbacks of these sequential models are that the results of relation extraction cannot be used to guide the named entity recognition, which have been proven useful. This paper proposed a novel integrate framework called EntSum, which enables bidirectional integration of named entity recognition and relation extraction using iterative optimization. Experiments on a one million large real Web data set show that EntSum achieves much better performance on both tasks than sequential methods.
{"title":"People Summarization by Combining Named Entity Recognition and Relation Extraction","authors":"Xiaojiang Liu, Nenghai Yu","doi":"10.4156/JCIT.VOL5.ISSUE10.30","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.30","url":null,"abstract":"The two most important tasks in entity information summarization from the Web are named entity recognition and relation extraction. Little work has been done toward an integrated statistical model for understanding both named entities and their relationships. Most of the previous works on relation extraction assume the named entities are pre-given. The drawbacks of these sequential models are that the results of relation extraction cannot be used to guide the named entity recognition, which have been proven useful. This paper proposed a novel integrate framework called EntSum, which enables bidirectional integration of named entity recognition and relation extraction using iterative optimization. Experiments on a one million large real Web data set show that EntSum achieves much better performance on both tasks than sequential methods.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121038788","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.15
Xiao Chen, Feifei Lu
The JVT-G012 rate control algorithm for H.264 video encoding can get high encoding efficiency. But the algorithm has disadvantage that the target bit allocation in the frame layer is uniform according to the buffer residual bits. This paper presents a new method which uses a content complexity quotiety of frame for allocating target bits in the frame layer more accurately. The content complexity quotiety is the combination of the average difference of gray histogram and mean absolute difference (MAD) ratio in the frame. Experimental results show that the bit rate maximum error of tested sequences in this algorithm is 1.38 percent and their average peak signal noise ratio (PSNR) is improved by 0.38 dB on average compared to the original JVT-G012 algorithm. Therefore, the proposed rate control algorithm can not only more accurately control bit rate, but also improve PSNR of video sequences. The video image quality is better and smoother.
{"title":"An Improved Rate Control Scheme for H, 264 Based on Frame Complexity Estimation","authors":"Xiao Chen, Feifei Lu","doi":"10.4156/JCIT.VOL5.ISSUE10.15","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.15","url":null,"abstract":"The JVT-G012 rate control algorithm for H.264 video encoding can get high encoding efficiency. But the algorithm has disadvantage that the target bit allocation in the frame layer is uniform according to the buffer residual bits. This paper presents a new method which uses a content complexity quotiety of frame for allocating target bits in the frame layer more accurately. The content complexity quotiety is the combination of the average difference of gray histogram and mean absolute difference (MAD) ratio in the frame. Experimental results show that the bit rate maximum error of tested sequences in this algorithm is 1.38 percent and their average peak signal noise ratio (PSNR) is improved by 0.38 dB on average compared to the original JVT-G012 algorithm. Therefore, the proposed rate control algorithm can not only more accurately control bit rate, but also improve PSNR of video sequences. The video image quality is better and smoother.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121824513","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.16
Jun Tang
This paper proposed improved K-means clustering algorithm based on user tag. It first used social annotation data to expand the vector space model of K-means. Then, it applied the links involved in social tagging network to enhance the clustering performance. Experimental result shows that the proposed improved K-means clustering algorithm based on user tag is effective.
{"title":"Improved K-means Clustering Algorithm Based on User Tag","authors":"Jun Tang","doi":"10.4156/JCIT.VOL5.ISSUE10.16","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.16","url":null,"abstract":"This paper proposed improved K-means clustering algorithm based on user tag. It first used social annotation data to expand the vector space model of K-means. Then, it applied the links involved in social tagging network to enhance the clustering performance. Experimental result shows that the proposed improved K-means clustering algorithm based on user tag is effective.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122183721","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.14
Fengxia Wang, Xiao Chang
In recent years, the algorithms of learning to rank have been proposed by researchers. However, in information retrieval, instances of ranks are imbalanced. After the instances of ranks are composed to pairs, the pairs of ranks are imbalanced too. In this paper, a cost-sensitive risk minimum model of pairwise learning to rank imbalanced data sets is proposed. Following this model, the algorithm of cost-sensitive supported vector learning to rank is investigated. In experiment, the standard Ranking SVM is used as baseline. The document retrieval data set is used in experiment. The experiment results show that the performance of cost-sensitive support vector learning to rank is better than Ranking SVM on two rank imbalanced data sets.
{"title":"Cost-Sensitive Support Vector Ranking for Information Retrieval","authors":"Fengxia Wang, Xiao Chang","doi":"10.4156/JCIT.VOL5.ISSUE10.14","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.14","url":null,"abstract":"In recent years, the algorithms of learning to rank have been proposed by researchers. However, in information retrieval, instances of ranks are imbalanced. After the instances of ranks are composed to pairs, the pairs of ranks are imbalanced too. In this paper, a cost-sensitive risk minimum model of pairwise learning to rank imbalanced data sets is proposed. Following this model, the algorithm of cost-sensitive supported vector learning to rank is investigated. In experiment, the standard Ranking SVM is used as baseline. The document retrieval data set is used in experiment. The experiment results show that the performance of cost-sensitive support vector learning to rank is better than Ranking SVM on two rank imbalanced data sets.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124354541","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.8
Hongwei Dai, Yu Yang, Cunhua Li
Premature convergence is one of the major difficulties with Clonal Selection Algorithm (CSA). It has been observed that this problem is closely tied to the problem of losing diversity in the population. In this paper, we propose a distance maintaining compact quantum crossover based CSA. The compact quantum crossover is useful for information exchanging between different solutions, whereas uses fewer antibodies. On the other hand, distance maintaining scheme permits the algorithm to fine tune its solutions. Simulation results on Traveling Salesman Problems (TSP) show that the novel algorithm is able to effectively balance exploration and exploitation of the search space and can also present the optimal or near-optimal solutions.
{"title":"Distance Maintaining Compact Quantum Crossover Based Clonal Selection Algorithm","authors":"Hongwei Dai, Yu Yang, Cunhua Li","doi":"10.4156/JCIT.VOL5.ISSUE10.8","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.8","url":null,"abstract":"Premature convergence is one of the major difficulties with Clonal Selection Algorithm (CSA). It has been observed that this problem is closely tied to the problem of losing diversity in the population. In this paper, we propose a distance maintaining compact quantum crossover based CSA. The compact quantum crossover is useful for information exchanging between different solutions, whereas uses fewer antibodies. On the other hand, distance maintaining scheme permits the algorithm to fine tune its solutions. Simulation results on Traveling Salesman Problems (TSP) show that the novel algorithm is able to effectively balance exploration and exploitation of the search space and can also present the optimal or near-optimal solutions.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133257261","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.1
Jianping Ge, Yalin Lei
In this study, we use the computable general equilibrium (CGE) model to examine welfare and growth effects of expanding grain-based fuel ethanol production in China. The results show that reasonable development of grain-based fuel ethanol will accelerate China’s economy, improve rural household income, and narrow the gap between the rich and the poor. However, expanding the production of grain-based fuel ethanol will also stimulate consumer price index (CPI).
{"title":"Assessing Welfare and Growth Effects of Grain-based Fuel Ethanol Development in China: a General Equilibrium Framework","authors":"Jianping Ge, Yalin Lei","doi":"10.4156/JCIT.VOL5.ISSUE10.1","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.1","url":null,"abstract":"In this study, we use the computable general equilibrium (CGE) model to examine welfare and growth effects of expanding grain-based fuel ethanol production in China. The results show that reasonable development of grain-based fuel ethanol will accelerate China’s economy, improve rural household income, and narrow the gap between the rich and the poor. However, expanding the production of grain-based fuel ethanol will also stimulate consumer price index (CPI).","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132118619","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.27
Zhenlin Wei
In this paper, 4 microRNAs and their targets were predicted through a de novo prediction procedure in the genome of Porcine Reproductive and Respiratory Syndrome virus. Through clustalW analysis, these 4 microRNAs were recognized as novel PRRSV derivate microRNAs. Target prediction results showed PRRSV mir-1, 2 and 4 have total 16 targets in porcine 3’ UTR database. These targets could be divided into 4 groups, which related to germ cell development, immunity function, apoptosis and other cell function genes, respectively. The roles of these targets inhibition on virus infection were issued and the link of these suppressions to clinical syndrome was discussed. In conclusion, the results showed microRNAs were exploited by PRRSV to escape host anti-virus surveillance and help virus infection, and the consequences of individual target suppression were related closely to clinical syndromes. In conclusion, the results will deep the understanding on PRRSV infection and provide novel virus microRNAs as targets for counter virus infection in gene therapy era.
{"title":"Novel MicroRNAs and Targets Prediction in PRRS Virus Genome","authors":"Zhenlin Wei","doi":"10.4156/JCIT.VOL5.ISSUE10.27","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.27","url":null,"abstract":"In this paper, 4 microRNAs and their targets were predicted through a de novo prediction procedure in the genome of Porcine Reproductive and Respiratory Syndrome virus. Through clustalW analysis, these 4 microRNAs were recognized as novel PRRSV derivate microRNAs. Target prediction results showed PRRSV mir-1, 2 and 4 have total 16 targets in porcine 3’ UTR database. These targets could be divided into 4 groups, which related to germ cell development, immunity function, apoptosis and other cell function genes, respectively. The roles of these targets inhibition on virus infection were issued and the link of these suppressions to clinical syndrome was discussed. In conclusion, the results showed microRNAs were exploited by PRRSV to escape host anti-virus surveillance and help virus infection, and the consequences of individual target suppression were related closely to clinical syndromes. In conclusion, the results will deep the understanding on PRRSV infection and provide novel virus microRNAs as targets for counter virus infection in gene therapy era.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122504470","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 : 2010-12-31DOI: 10.4156/JCIT.VOL5.ISSUE10.12
Jie Huang, Bei Huang, Qiucen Huang
A dynamic time delay model for load balancing was proposed in distributed heterogeneous system by Hayat. But how to compute the load-transfer delay and the gain coefficient were not gived, so it is imposible to quantitatively analyse the performance of a distributed system. In this paper, an improved dynamic load balancing model with load-transfer delay is designed for LAN, and the gain coefficient is defined by a number of simulation test, so to meet requirements of LAN. At last, the simulation test is presented. The conclusion is that the improved algorithm not only saves the resources, but also realizes a reliable and efficient operation of the system. So the improved algorithm can be used to the distributed system in LAN.
{"title":"An Improved Dynamic Load Balancing Algorithm for a Distributed System in LAN","authors":"Jie Huang, Bei Huang, Qiucen Huang","doi":"10.4156/JCIT.VOL5.ISSUE10.12","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE10.12","url":null,"abstract":"A dynamic time delay model for load balancing was proposed in distributed heterogeneous system by Hayat. But how to compute the load-transfer delay and the gain coefficient were not gived, so it is imposible to quantitatively analyse the performance of a distributed system. In this paper, an improved dynamic load balancing model with load-transfer delay is designed for LAN, and the gain coefficient is defined by a number of simulation test, so to meet requirements of LAN. At last, the simulation test is presented. The conclusion is that the improved algorithm not only saves the resources, but also realizes a reliable and efficient operation of the system. So the improved algorithm can be used to the distributed system in LAN.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129663184","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 : 2010-11-30DOI: 10.4156/JCIT.VOL5.ISSUE9.23
Gang Lv, Heming Zhao
Aimed at the characteristics of Chinese whispered speech formants, i.e., migrating to highfrequency, increased bandwidth, and increased spurious peaks and merged peaks, a method of tracking the formant trajectory of continuous Chinese whispered speech using the Hidden Dynamic Model (HDM) with dynamic target orientation was put forward in this study. The calculation proceeded as follows: firstly, the PIF-LPC algorithm was used to evaluate the formant parameters of whispered speech (PIF-LPC is an improved LPC algorithm. In PIF-LPC, pole interaction factors are used to correct the formant bandwidth of residual poles, to reduce the effect of pole intersection and to improve the accuracy of formant parameters); then, the extracted formant parameters as dynamic target orientation were introduced in HDM and compared with the actual observation results for realtime adjustment of the weight of dynamic target orientation; finally, HDM was solved through auxiliary particle filtering (APF), so as to realize the tracking of the formant trajectory of whispered speech. It was shown in the experimental results that the interferences of spurious peaks and merged peaks were avoided when the formant trajectory of continuous whispered speech was tracked by this method.
{"title":"Tracking Formant Trajectory of Continuous Chinese Whispered Speech with Hidden Dynamic Model Based on Dynamic Target Orientation","authors":"Gang Lv, Heming Zhao","doi":"10.4156/JCIT.VOL5.ISSUE9.23","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE9.23","url":null,"abstract":"Aimed at the characteristics of Chinese whispered speech formants, i.e., migrating to highfrequency, increased bandwidth, and increased spurious peaks and merged peaks, a method of tracking the formant trajectory of continuous Chinese whispered speech using the Hidden Dynamic Model (HDM) with dynamic target orientation was put forward in this study. The calculation proceeded as follows: firstly, the PIF-LPC algorithm was used to evaluate the formant parameters of whispered speech (PIF-LPC is an improved LPC algorithm. In PIF-LPC, pole interaction factors are used to correct the formant bandwidth of residual poles, to reduce the effect of pole intersection and to improve the accuracy of formant parameters); then, the extracted formant parameters as dynamic target orientation were introduced in HDM and compared with the actual observation results for realtime adjustment of the weight of dynamic target orientation; finally, HDM was solved through auxiliary particle filtering (APF), so as to realize the tracking of the formant trajectory of whispered speech. It was shown in the experimental results that the interferences of spurious peaks and merged peaks were avoided when the formant trajectory of continuous whispered speech was tracked by this method.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814734","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
扫码关注我们
求助内容：
应助结果提醒方式：