Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713146
Jing-long Zhang, Jie Tang, Q. Zong, Jun-fang Li
Elevator group control scheduling is to dispatch every elevator to serve call requests from different floors based on some certain goal. It's a kind of typical combinatorial optimization problems. Ant colony algorithm is good at solving the discrete combinatorial optimization, its well global optimization ability and quick convergence velocity are both necessary to a scheduling algorithm. Moreover, reducing passengers' waiting and traveling time is the main focus of current dispatching algorithms, neglecting the energy consumed by the elevator system. So it's necessary to research on energy-saving algorithms. For the purpose of elevator group's energy-conservation run, the objective function of energy is built, ant colony model for elevator group control system is created, its optimization mechanism is figured out, and convergence of the algorithm is studied in this paper. Simulation results show the effectiveness of the strategy.
{"title":"Energy-saving scheduling strategy for elevator group control system based on ant colony optimization","authors":"Jing-long Zhang, Jie Tang, Q. Zong, Jun-fang Li","doi":"10.1109/YCICT.2010.5713146","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713146","url":null,"abstract":"Elevator group control scheduling is to dispatch every elevator to serve call requests from different floors based on some certain goal. It's a kind of typical combinatorial optimization problems. Ant colony algorithm is good at solving the discrete combinatorial optimization, its well global optimization ability and quick convergence velocity are both necessary to a scheduling algorithm. Moreover, reducing passengers' waiting and traveling time is the main focus of current dispatching algorithms, neglecting the energy consumed by the elevator system. So it's necessary to research on energy-saving algorithms. For the purpose of elevator group's energy-conservation run, the objective function of energy is built, ant colony model for elevator group control system is created, its optimization mechanism is figured out, and convergence of the algorithm is studied in this paper. Simulation results show the effectiveness of the strategy.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848227","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-01DOI: 10.1109/YCICT.2010.5713092
Zhou Fu-cheng
When gearbox operated abnormally, a frequency vibration energy of signal after undecimated wavelet transformation would have great changes, the online monitoring and diagnosis system of wind turbine gearbox was developed accordingly. Measured the vibration signal of bearing fault in the laboratory, The results showed that this proposed method can be more accurate display characteristics, which was conducive to diagnose bearing failure quickly and effectively.
{"title":"Research on online monitoring and diagnosis of bearing fault of wind turbine gearbox based on undecimated wavelet transformation","authors":"Zhou Fu-cheng","doi":"10.1109/YCICT.2010.5713092","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713092","url":null,"abstract":"When gearbox operated abnormally, a frequency vibration energy of signal after undecimated wavelet transformation would have great changes, the online monitoring and diagnosis system of wind turbine gearbox was developed accordingly. Measured the vibration signal of bearing fault in the laboratory, The results showed that this proposed method can be more accurate display characteristics, which was conducive to diagnose bearing failure quickly and effectively.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127561163","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-01DOI: 10.1109/YCICT.2010.5713150
Fangjin Zhu, Hua Wang
Traditional multicast technology faces a serious state scalability problem when there are large numbers of concurrent groups in the network. As a new approach to solve this scalability problem, aggregated multicast forces multiple multicast groups to share a common distribution tree. This can be defined as a minimum grouping problem and is proved to be an NPC problem. An ant colony optimization algorithm to tackle this problem is proposed. The number of groups in each aggregated tree is used as an important component when designing the fitness function between two multicast groups. Pheromone update rules are designed based on the fitness function. And the number of common neighbors between a multicast group and an aggregated tree is defined as the selection heuristic information. Simulation results show that this algorithm performs well with various bandwidth waste rates. Compared with a greedy algorithm, this algorithm has better optimization performance, especially when bandwidth waste rate is relatively big.
{"title":"An ACO algorithm to tackle aggregated multicast problem","authors":"Fangjin Zhu, Hua Wang","doi":"10.1109/YCICT.2010.5713150","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713150","url":null,"abstract":"Traditional multicast technology faces a serious state scalability problem when there are large numbers of concurrent groups in the network. As a new approach to solve this scalability problem, aggregated multicast forces multiple multicast groups to share a common distribution tree. This can be defined as a minimum grouping problem and is proved to be an NPC problem. An ant colony optimization algorithm to tackle this problem is proposed. The number of groups in each aggregated tree is used as an important component when designing the fitness function between two multicast groups. Pheromone update rules are designed based on the fitness function. And the number of common neighbors between a multicast group and an aggregated tree is defined as the selection heuristic information. Simulation results show that this algorithm performs well with various bandwidth waste rates. Compared with a greedy algorithm, this algorithm has better optimization performance, especially when bandwidth waste rate is relatively big.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122492416","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-01DOI: 10.1109/YCICT.2010.5713072
Hong-wei Wang, Bo Kong, Xiying Zheng
The reduced support vector machine (RSVM) was proposed to overcome the computational difficulties as well as to reduce the model complexity in generating a nonlinear separating surface for a massive data set. However, it selects ‘support vectors’ randomly from the training set, this will effect the result. To overcome this shortcoming of RSVM, an improved RSVM algorithm is presented in this paper. First of all, we calculate the average of relative distance for each sample point in every class; and then use percentile to deal with unbalanced sample and remove the outliers form margin vectors, so the representative vectors as ‘support vectors’ were extracted; finally, we apply the RSVM on these representative vectors. Because we reduce the effect of unbalanced sample and outliers, and apply the representative vectors as ‘support vectors’, so the new algorithm improves the ability of RSVM to classify and the training speed of C-SVM .
{"title":"An improved reduced support vector machine","authors":"Hong-wei Wang, Bo Kong, Xiying Zheng","doi":"10.1109/YCICT.2010.5713072","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713072","url":null,"abstract":"The reduced support vector machine (RSVM) was proposed to overcome the computational difficulties as well as to reduce the model complexity in generating a nonlinear separating surface for a massive data set. However, it selects ‘support vectors’ randomly from the training set, this will effect the result. To overcome this shortcoming of RSVM, an improved RSVM algorithm is presented in this paper. First of all, we calculate the average of relative distance for each sample point in every class; and then use percentile to deal with unbalanced sample and remove the outliers form margin vectors, so the representative vectors as ‘support vectors’ were extracted; finally, we apply the RSVM on these representative vectors. Because we reduce the effect of unbalanced sample and outliers, and apply the representative vectors as ‘support vectors’, so the new algorithm improves the ability of RSVM to classify and the training speed of C-SVM .","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278059","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-01DOI: 10.1109/YCICT.2010.5713093
Wang Zhongmei, Long Yonghong
Digital image forgery detection becomes an important research topic now in digital image forensics. JPEG as a popular file form for digital image. DCT transformation and quantization are two main parts of JPEG encoding process. Quantization table is used for quantizing the DCT coefficient and have been proved as an effective feature for image forgery detection. In this paper, we describe an approach to detect digital forgeries by checking inconsistencies of JPEG blocks and measure the block quantization error to get the forgery area. Experiment results also demonstrate the validity of the proposed approach.
{"title":"Digital image forgeries detection based on blocking artifact","authors":"Wang Zhongmei, Long Yonghong","doi":"10.1109/YCICT.2010.5713093","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713093","url":null,"abstract":"Digital image forgery detection becomes an important research topic now in digital image forensics. JPEG as a popular file form for digital image. DCT transformation and quantization are two main parts of JPEG encoding process. Quantization table is used for quantizing the DCT coefficient and have been proved as an effective feature for image forgery detection. In this paper, we describe an approach to detect digital forgeries by checking inconsistencies of JPEG blocks and measure the block quantization error to get the forgery area. Experiment results also demonstrate the validity of the proposed approach.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115201149","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-01DOI: 10.1109/YCICT.2010.5713070
Xiying Zheng, Bo Kong
In this paper, the generator polynomial of linear cyclic codes on ring ZPm are studied, and we prove that the depth spectrum of linear cyclic codes Cl = (pl−1fl)(degfl = n−k, l = 1, 2 · · · ,m) has consisted exactly k non zero values and give the depth spectrum of linear cyclic codes on ring ZPm.
本文研究了ZPm环上线性循环码的生成多项式，证明了线性循环码的深度谱Cl = (pl−1fl)(degfl = n−k, l = 1,2···，m)恰好由k个非零值组成，并给出了ZPm环上线性循环码的深度谱。
{"title":"The depth spectrums of linear cyclic codes on ring ZPm","authors":"Xiying Zheng, Bo Kong","doi":"10.1109/YCICT.2010.5713070","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713070","url":null,"abstract":"In this paper, the generator polynomial of linear cyclic codes on ring Z<inf>Pm</inf> are studied, and we prove that the depth spectrum of linear cyclic codes C<inf>l</inf> = (p<sup>l−1</sup>f<inf>l</inf>)(degf<inf>l</inf> = n−k, l = 1, 2 · · · ,m) has consisted exactly k non zero values and give the depth spectrum of linear cyclic codes on ring Z<inf>Pm</inf>.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687972","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-01DOI: 10.1109/YCICT.2010.5713083
Zheng Jiali, Qin Tuanfa
Disparity estimation is an essential step in stereoscopic video coding. Existing disparity estimation methods are based on single disparity model and lack the robustness for estimating the real-time view disparities. To overcome this problem, this paper proposes an adaptive disparity estimation scheme which employs adaptive selection of disparity models based on the rate distortion optimization function. By exploiting the information obtained from the disparity models, the proposed technique estimates and compensates the disparities among different views in stereoscopic video coding efficiently. Experimental results show that the proposed technique contributes to improve the accurate of disparity estimation and save the bits spent on the coding.
{"title":"Adaptive disparity estimation for stereoscopic video coding","authors":"Zheng Jiali, Qin Tuanfa","doi":"10.1109/YCICT.2010.5713083","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713083","url":null,"abstract":"Disparity estimation is an essential step in stereoscopic video coding. Existing disparity estimation methods are based on single disparity model and lack the robustness for estimating the real-time view disparities. To overcome this problem, this paper proposes an adaptive disparity estimation scheme which employs adaptive selection of disparity models based on the rate distortion optimization function. By exploiting the information obtained from the disparity models, the proposed technique estimates and compensates the disparities among different views in stereoscopic video coding efficiently. Experimental results show that the proposed technique contributes to improve the accurate of disparity estimation and save the bits spent on the coding.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116409531","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-01DOI: 10.1109/YCICT.2010.5713134
X. Qiu, Jianwei Liu, A. Sangi
Routing security is an important and well known issue in Ad hoc network applications and development. Various kinds of solutions have been proposed but they are impractical to be fully applied. In this paper, firstly the wormhole attack topology is analyzed, then cryptography and trust mechanism are combined to design a new multipath trust-based secure routing protocol(MTSR). MTSR based on AODV and SAODV, is distributed and can resist almost all available routing attacks such as discarding, Sybil, spoofing, jamming, flooding, rushing, and especially wormhole attack. Its trust value computation follows the principle of slowly increasing but sharply decreasing, and it does not require any additional equipment, strict assumptions, node location and precise time information.
{"title":"MTSR: Wormhole attack resistant secure routing for Ad hoc network","authors":"X. Qiu, Jianwei Liu, A. Sangi","doi":"10.1109/YCICT.2010.5713134","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713134","url":null,"abstract":"Routing security is an important and well known issue in Ad hoc network applications and development. Various kinds of solutions have been proposed but they are impractical to be fully applied. In this paper, firstly the wormhole attack topology is analyzed, then cryptography and trust mechanism are combined to design a new multipath trust-based secure routing protocol(MTSR). MTSR based on AODV and SAODV, is distributed and can resist almost all available routing attacks such as discarding, Sybil, spoofing, jamming, flooding, rushing, and especially wormhole attack. Its trust value computation follows the principle of slowly increasing but sharply decreasing, and it does not require any additional equipment, strict assumptions, node location and precise time information.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126427195","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-01DOI: 10.1109/YCICT.2010.5713120
Yun Tian, Haisheng Li, Qiang Cai, Shouxiang Zhao
A novel modeling method is presented in this paper to measure the similarity between short texts. We thought that the complete expression of a sentence or a short text, not only depends on the words, but also relies on the syntactic structure, thus the method takes word similarity feature and syntactic feature into account. The proposed method can be used in a variety of applications involving automatic document summarization, text knowledge representation and discovery. Experiment on two different data sets shows that the proposed method performs better than the measure proposed by Li et al.
{"title":"Measuring the similarity of short texts by word similarity and tree kernels","authors":"Yun Tian, Haisheng Li, Qiang Cai, Shouxiang Zhao","doi":"10.1109/YCICT.2010.5713120","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713120","url":null,"abstract":"A novel modeling method is presented in this paper to measure the similarity between short texts. We thought that the complete expression of a sentence or a short text, not only depends on the words, but also relies on the syntactic structure, thus the method takes word similarity feature and syntactic feature into account. The proposed method can be used in a variety of applications involving automatic document summarization, text knowledge representation and discovery. Experiment on two different data sets shows that the proposed method performs better than the measure proposed by Li et al.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126524183","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-01DOI: 10.1109/YCICT.2010.5713103
Qindong Sun, Nan Wang
Recently the mobile service is gaining a rapid expansion, which has brought a lot of concerns in various areas of researches. As a major business of the mobile services multimedia messaging service (MMS) has the very important research values. In this paper we have carried out a detailed measurement on the multimedia messaging service social network. According to the measurement results, the MMS social network shows a small world property. This social network complies with the power law distribution and has a small average path as well as a high clustering coefficient. The node degree correlation of MMS is different from other kinds of social networks. The geographical property is also an important factor which affects the users' behavior. Finally we discuss the status of huge degree nodes in the MMS social network.
{"title":"Characteristics in the multimedia messaging service social network","authors":"Qindong Sun, Nan Wang","doi":"10.1109/YCICT.2010.5713103","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713103","url":null,"abstract":"Recently the mobile service is gaining a rapid expansion, which has brought a lot of concerns in various areas of researches. As a major business of the mobile services multimedia messaging service (MMS) has the very important research values. In this paper we have carried out a detailed measurement on the multimedia messaging service social network. According to the measurement results, the MMS social network shows a small world property. This social network complies with the power law distribution and has a small average path as well as a high clustering coefficient. The node degree correlation of MMS is different from other kinds of social networks. The geographical property is also an important factor which affects the users' behavior. Finally we discuss the status of huge degree nodes in the MMS social network.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128448721","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
扫码关注我们
求助内容：
应助结果提醒方式：