Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713049
Zheng Yanwei, Ni Hong, Deng Haojiang, Liu Lei
The objective of web services selection is to maximize an application-specific utility function under the end-to-end QoS constraints. Existing methods can be divided into two types: local selection method and global selection method. The local selection method is simple and efficient, but can not meet the end-to-end QoS constraints. The global selection method can satisfy the global QoS constraints, but at the price of higher computational time, and it is not suitable for the dynamic environment. To address this issue, this paper proposes an algorithm to combine global QoS constraints with local selection, which first splits the global QoS constraints into local constraints using heuristic method, and then uses local selection to find the optimal solution under the local constraints. The experimental results show that our approach improves the performance by reducing the computation time greatly while achieving close-to-optimal results.
{"title":"A dynamic web services selection based on decomposition of global QoS constraints","authors":"Zheng Yanwei, Ni Hong, Deng Haojiang, Liu Lei","doi":"10.1109/YCICT.2010.5713049","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713049","url":null,"abstract":"The objective of web services selection is to maximize an application-specific utility function under the end-to-end QoS constraints. Existing methods can be divided into two types: local selection method and global selection method. The local selection method is simple and efficient, but can not meet the end-to-end QoS constraints. The global selection method can satisfy the global QoS constraints, but at the price of higher computational time, and it is not suitable for the dynamic environment. To address this issue, this paper proposes an algorithm to combine global QoS constraints with local selection, which first splits the global QoS constraints into local constraints using heuristic method, and then uses local selection to find the optimal solution under the local constraints. The experimental results show that our approach improves the performance by reducing the computation time greatly while achieving close-to-optimal results.","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":"128114765","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.5713113
Weng Bin, Pan Ri-jing, Yao Zhi-qiang, Xiao Jun, Yang Shan-chao
T-spline surfaces are widely used in entertainment, engineering, science and medicine. Nonuniform B-spline wavelets transformation is introduced into T-spline surfaces watermarking, and a scheme is proposed for embedding watermarks into T-spline surfaces. In watermark embeding stage, firstly, the points are selected from the standard T-spline surfaces. Secondly, the points are decomposited by nonumiform B-spline wavelets transformation, then the watermarks are embedded into its lower resolution coefficients, and then the watermarked points are obtained by the B-spline wavelets reconstruction. Finally, the watermarked T-spline surfaces are obtained by modifing the T-spline control points. In watermark extracting stage, the same points selection and wavelets decomposition processes are performed to both the original surfaces and the watermarked surfaces, then the watermarks are obtained according to the differences of their lower resolution coefficients. Experimental results show that the proposed scheme is robust against attacks such as translation, rotation, uniform scaling, noise addition, control points modification, weights modification, local knot insertion and control point removal.
{"title":"Robust watermarking for T-spline surfaces based on nonuniform B-spline wavelets transformation","authors":"Weng Bin, Pan Ri-jing, Yao Zhi-qiang, Xiao Jun, Yang Shan-chao","doi":"10.1109/YCICT.2010.5713113","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713113","url":null,"abstract":"T-spline surfaces are widely used in entertainment, engineering, science and medicine. Nonuniform B-spline wavelets transformation is introduced into T-spline surfaces watermarking, and a scheme is proposed for embedding watermarks into T-spline surfaces. In watermark embeding stage, firstly, the points are selected from the standard T-spline surfaces. Secondly, the points are decomposited by nonumiform B-spline wavelets transformation, then the watermarks are embedded into its lower resolution coefficients, and then the watermarked points are obtained by the B-spline wavelets reconstruction. Finally, the watermarked T-spline surfaces are obtained by modifing the T-spline control points. In watermark extracting stage, the same points selection and wavelets decomposition processes are performed to both the original surfaces and the watermarked surfaces, then the watermarks are obtained according to the differences of their lower resolution coefficients. Experimental results show that the proposed scheme is robust against attacks such as translation, rotation, uniform scaling, noise addition, control points modification, weights modification, local knot insertion and control point removal.","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":"116617440","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.5713127
Sun Tongjing, Li Guijuan, Li Mingda
In order to solve the problem of broadband omnidirectional acoustic scattering computing for underwater elastic object, broadband acoustic scattering model of underwater elastic object is presented combining Finite-Difference Time-Domain (FDTD) method and the relation between scattering wave spectrum and form function. We simualted broadband acoustic scattering characteristic of elastic aluminum sphere using this method, and compared the result with the corresponding analytic solution, and they were in good agreement. Furthermore, we computed non-backscattering broadband characteristics, which were very difficult to gain using other methods, including bistatic angle 45 degree and 90 degree, and compared and analyzed them. The results showed that their formant position, vibration amplitude and resonance period existed distinct difference, that was to say, with the changing of bistatic angle, frequency domain scattering characteristic of the object brought great difference.
{"title":"Modeling broadband acoustic scattering of underwater elastic object using Finite-Difference Time-Domain (FDTD) method","authors":"Sun Tongjing, Li Guijuan, Li Mingda","doi":"10.1109/YCICT.2010.5713127","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713127","url":null,"abstract":"In order to solve the problem of broadband omnidirectional acoustic scattering computing for underwater elastic object, broadband acoustic scattering model of underwater elastic object is presented combining Finite-Difference Time-Domain (FDTD) method and the relation between scattering wave spectrum and form function. We simualted broadband acoustic scattering characteristic of elastic aluminum sphere using this method, and compared the result with the corresponding analytic solution, and they were in good agreement. Furthermore, we computed non-backscattering broadband characteristics, which were very difficult to gain using other methods, including bistatic angle 45 degree and 90 degree, and compared and analyzed them. The results showed that their formant position, vibration amplitude and resonance period existed distinct difference, that was to say, with the changing of bistatic angle, frequency domain scattering characteristic of the object brought great difference.","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":"130912870","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.5713096
Yang Chen
In this paper, a new method for extracting edges in images is proposed. The local pixel values are normalized to make their sum become unity. Then, a nonlinear filtering process is applied to the normalized pixel values by using the sine or cosine function. Two new edge detection operators, which exploit the local convexity of the sine and cosine functions, are thus defined. The edges are detected at the places where these operators yield large values. The new approach exhibits desirable results in both effect and efficiency compared with some classical methods.
{"title":"Sine and cosine functions based edge detection operators","authors":"Yang Chen","doi":"10.1109/YCICT.2010.5713096","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713096","url":null,"abstract":"In this paper, a new method for extracting edges in images is proposed. The local pixel values are normalized to make their sum become unity. Then, a nonlinear filtering process is applied to the normalized pixel values by using the sine or cosine function. Two new edge detection operators, which exploit the local convexity of the sine and cosine functions, are thus defined. The edges are detected at the places where these operators yield large values. The new approach exhibits desirable results in both effect and efficiency compared with some classical methods.","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":"125968512","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.5713063
Ning Zhang, Xiuping Li
This paper presents RFID tag antenna quick design and optimization of by using the Artificial Neural Network (ANN) modeling technique. The proposed antenna presents at least 90MHz (840∼930MHz) bandwidth for microchip impedance between (10-j50) Ω and (40-j300) Ω under the condition of return loss less than −10dB by changing the antenna's two key parameters. These two key parameters are used to capture critical input-output relationships in the ANN model. Once fully developed, the ANN model has been shown to be as accurate as an EM simulator and much more efficient in the design and optimization of the RFID tag antenna.
{"title":"RFID tag antenna quick design and optimization by using Artificial Neural Network modeling technique","authors":"Ning Zhang, Xiuping Li","doi":"10.1109/YCICT.2010.5713063","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713063","url":null,"abstract":"This paper presents RFID tag antenna quick design and optimization of by using the Artificial Neural Network (ANN) modeling technique. The proposed antenna presents at least 90MHz (840∼930MHz) bandwidth for microchip impedance between (10-j50) Ω and (40-j300) Ω under the condition of return loss less than −10dB by changing the antenna's two key parameters. These two key parameters are used to capture critical input-output relationships in the ANN model. Once fully developed, the ANN model has been shown to be as accurate as an EM simulator and much more efficient in the design and optimization of the RFID tag antenna.","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":"128097595","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.5713099
Rong Chai, Jingjing Cheng, Qianbin Chen, Tao Dong
In next generation network (NGN), different access networks are integrated and seamless vertical handoff technique should be performed. Cross-layer design for vertical handoff has gained considerable attention in recent years. In this paper, we give a survey on cross-layer strategy in vertical handoff scheme design including both cross-layer system architectures and cross-layer information interaction mechanisms for handoff performances improvement in heterogeneous integration networks. Furthermore, we point out some open technical challenges in the cross-layer design for seamless integration of heterogeneous networks.
{"title":"Cross-layer design in vertical handoff technique","authors":"Rong Chai, Jingjing Cheng, Qianbin Chen, Tao Dong","doi":"10.1109/YCICT.2010.5713099","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713099","url":null,"abstract":"In next generation network (NGN), different access networks are integrated and seamless vertical handoff technique should be performed. Cross-layer design for vertical handoff has gained considerable attention in recent years. In this paper, we give a survey on cross-layer strategy in vertical handoff scheme design including both cross-layer system architectures and cross-layer information interaction mechanisms for handoff performances improvement in heterogeneous integration networks. Furthermore, we point out some open technical challenges in the cross-layer design for seamless integration of heterogeneous networks.","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":"122992494","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.5713118
Yuanfeng Lian, Yan Zhao, Falin Wu, Huiguang He
This paper presents a new approach based on modified adaptive probabilistic neural network for brain segmentation with magnetic resonance imaging (MRI). The SOM (Self-Organizing Map) neural network is employed to overly segment the input MR image, and yield reference vectors with a large training data set for the probabilistic classification. For improving the training quality of neural work, the feature set is extracted from the statistical intensity and gradient information of the image pixels. The proposed approach also incorporates modified particle swarm optimization (MPSO) to optimize the smoothing parameter of the kernel function in the neural network, enhancing its performance. The experimental results demonstrate the effectiveness and robustness of the proposed approach.
{"title":"Modified adaptive probabilistic neural network using for MR image segmentation","authors":"Yuanfeng Lian, Yan Zhao, Falin Wu, Huiguang He","doi":"10.1109/YCICT.2010.5713118","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713118","url":null,"abstract":"This paper presents a new approach based on modified adaptive probabilistic neural network for brain segmentation with magnetic resonance imaging (MRI). The SOM (Self-Organizing Map) neural network is employed to overly segment the input MR image, and yield reference vectors with a large training data set for the probabilistic classification. For improving the training quality of neural work, the feature set is extracted from the statistical intensity and gradient information of the image pixels. The proposed approach also incorporates modified particle swarm optimization (MPSO) to optimize the smoothing parameter of the kernel function in the neural network, enhancing its performance. The experimental results demonstrate the effectiveness and robustness 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":"123345390","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.5713152
Shaokang Wang, Baoping Yan
Authorship attribution, i.e., identifying the authorship of a piece of disputed text, is an important problem due to the increased concerns on copyright violations. While various authorship attribution algorithms have been proposed to identify the authorship of articles, they fail in several situations. This paper proposes a new authorship attribution algorithm for Chinese text using the sentence rhythm features of articles. In our algorithm, a rhythm feature matrix is proposed to depict the sentence rhythm of Chinese text. In order to determine the similarity of rhythm feature matrices, we compare two definitions of similarity based on Euclidean distance and improved Kullback-Leibler Divergence, respectively. Experimental results show that our algorithm achieves a success rate of 80%.
{"title":"Authorship attribution for Chinese text based on sentence rhythm features","authors":"Shaokang Wang, Baoping Yan","doi":"10.1109/YCICT.2010.5713152","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713152","url":null,"abstract":"Authorship attribution, i.e., identifying the authorship of a piece of disputed text, is an important problem due to the increased concerns on copyright violations. While various authorship attribution algorithms have been proposed to identify the authorship of articles, they fail in several situations. This paper proposes a new authorship attribution algorithm for Chinese text using the sentence rhythm features of articles. In our algorithm, a rhythm feature matrix is proposed to depict the sentence rhythm of Chinese text. In order to determine the similarity of rhythm feature matrices, we compare two definitions of similarity based on Euclidean distance and improved Kullback-Leibler Divergence, respectively. Experimental results show that our algorithm achieves a success rate of 80%.","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":"116507939","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.5713106
Quan Xu, Jian-bing Lee
This paper introduces an improved algorithm to distribute erase operations evenly across the large-capacity flash memory system. Such implementation requires the wear-leveling mechanism to deal with a large proportion of data that is not frequently updated. The original algorithm shows a good performance in lowering memory consumption but can not well satisfy that requirement. Detailed analysis show how the problem occurs, and our work focuses on addressing this problem. Moreover, a FIFO structure is used in this algorithm to improve the efficiency of basic hot-cold data swapping. The simulation results demonstrate that the proposed algorithm provides a much higher performance than the previous scheme, while consuming roughly the same memory space.
{"title":"An improved algorithm for large-capacity flash memory systems","authors":"Quan Xu, Jian-bing Lee","doi":"10.1109/YCICT.2010.5713106","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713106","url":null,"abstract":"This paper introduces an improved algorithm to distribute erase operations evenly across the large-capacity flash memory system. Such implementation requires the wear-leveling mechanism to deal with a large proportion of data that is not frequently updated. The original algorithm shows a good performance in lowering memory consumption but can not well satisfy that requirement. Detailed analysis show how the problem occurs, and our work focuses on addressing this problem. Moreover, a FIFO structure is used in this algorithm to improve the efficiency of basic hot-cold data swapping. The simulation results demonstrate that the proposed algorithm provides a much higher performance than the previous scheme, while consuming roughly the same memory space.","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":"124980275","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.5713065
Xin Li, Huapu Lu
Video detector is used widely in modern city to monitor the traffic situation. But the data from detectors is usually not fully used. In this paper, we adopt data mining method to deal with these data in order to analyze the traffic flow character and estimate OD matrix more accurately. On the basis of study data character carefully, we discuss the traffic flow feature from 3 parts: spatial, temporal and vehicle types. Then an improved method to obtain OD matrix is proposed. It costs less than traditional method and is more direct and simpler than the method which used link flow to calculate OD matrix. At last ,we study a case with real data in Beijing to verify the effectiveness of this data mining method.
{"title":"City traffic flow character analysis and origin-destination estimation based on data mining","authors":"Xin Li, Huapu Lu","doi":"10.1109/YCICT.2010.5713065","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713065","url":null,"abstract":"Video detector is used widely in modern city to monitor the traffic situation. But the data from detectors is usually not fully used. In this paper, we adopt data mining method to deal with these data in order to analyze the traffic flow character and estimate OD matrix more accurately. On the basis of study data character carefully, we discuss the traffic flow feature from 3 parts: spatial, temporal and vehicle types. Then an improved method to obtain OD matrix is proposed. It costs less than traditional method and is more direct and simpler than the method which used link flow to calculate OD matrix. At last ,we study a case with real data in Beijing to verify the effectiveness of this data mining method.","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":"114534425","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
扫码关注我们
求助内容：
应助结果提醒方式：