Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920372
Wei Ni, Yanzhu Liu, Su Zhang, Yanhui Yang, Jichun Bu
A buffer allocation algorithm based on self-similar queuing model is proposed, with the consideration of self-similar communication characteristics of Networks-on-Chip and virtual-channels. It calculates the overflow probability of each virtual-channel according the Discrete Poisson Pareto Burst Process (DPPBP) model, which is the basis of distributing buffer resources. And the experimental results indicate that the average packet latency is lower than that of existing algorithm in the condition of the same buffer resources.
{"title":"A buffer allocation algorithm for network-on-chip with self-similar traffic","authors":"Wei Ni, Yanzhu Liu, Su Zhang, Yanhui Yang, Jichun Bu","doi":"10.1109/ICIST.2014.6920372","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920372","url":null,"abstract":"A buffer allocation algorithm based on self-similar queuing model is proposed, with the consideration of self-similar communication characteristics of Networks-on-Chip and virtual-channels. It calculates the overflow probability of each virtual-channel according the Discrete Poisson Pareto Burst Process (DPPBP) model, which is the basis of distributing buffer resources. And the experimental results indicate that the average packet latency is lower than that of existing algorithm in the condition of the same buffer resources.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122715256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920347
Charles Z. Liew, Raymond Shaw, Shi‐Dan Sun
In this brief paper, coupled heterogeneous dynamic has been discussed and an optimal co-estimation with distributed Kalman filter strategy is proposed for monitoring such dynamic with consideration of incomplete information scenario. The experiment result shows that proposed co-estimation strategy obtains better effect to estimate the state of coupled heterogeneous monitoring under the noisy environment compared to separate DKF.
{"title":"Optimal co-monitoring strategy for coupled dynamics with distributed Kalman filtering","authors":"Charles Z. Liew, Raymond Shaw, Shi‐Dan Sun","doi":"10.1109/ICIST.2014.6920347","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920347","url":null,"abstract":"In this brief paper, coupled heterogeneous dynamic has been discussed and an optimal co-estimation with distributed Kalman filter strategy is proposed for monitoring such dynamic with consideration of incomplete information scenario. The experiment result shows that proposed co-estimation strategy obtains better effect to estimate the state of coupled heterogeneous monitoring under the noisy environment compared to separate DKF.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122743476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920334
S. Wibowo, S. Grandhi
This research work demonstrates a performance-based approach to evaluate the quality performance of group buying websites under uncertainty. Linguistic variables are assigned with values using triangular fuzzy numbers approach for effectively modeling the vagueness and imprecision of the decision making process. An effective algorithm grounded on the deviation degree and absolute area of a fuzzy number is developed for generating a general performance index for each alternative. This would help companies understand the performance quality level of their group buying websites. A group buying website quality performance evaluation example demonstrates how performance based approach can be used to assess the quality.
{"title":"A performance-based approach for assessing the quality of group buying websites","authors":"S. Wibowo, S. Grandhi","doi":"10.1109/ICIST.2014.6920334","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920334","url":null,"abstract":"This research work demonstrates a performance-based approach to evaluate the quality performance of group buying websites under uncertainty. Linguistic variables are assigned with values using triangular fuzzy numbers approach for effectively modeling the vagueness and imprecision of the decision making process. An effective algorithm grounded on the deviation degree and absolute area of a fuzzy number is developed for generating a general performance index for each alternative. This would help companies understand the performance quality level of their group buying websites. A group buying website quality performance evaluation example demonstrates how performance based approach can be used to assess the quality.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130120979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920396
Shun Kasahara, N. Minematsu, Han-Ping Shen, D. Saito, K. Hirose
English is the only language available for international communication and is used by approximately 1.5 billions of speakers. It is also known to have a large diversity of pronunciation partly due to the influence of the speakers' mother tongue, called accents. Our project aims at creating a global and individual-basis map of English pronunciations to be used in teaching and learning World Englishes (WE) as well as research studies of WE [1], [2]. Creating the map mathematically requires a distance matrix in terms of pronunciation differences among all the speakers considered, and technically requires a method of predicting the pronunciation distance between any pair of the speakers. Our previous but very recent study [3] combined invariant pronunciation structure analysis [4], [5], [6], [7] and Support Vector Regression (SVR) effectively to predict the interspeaker pronunciation distances. In [3], very high correlation of 0.903 was observed between reference IPA-based pronunciation distances and the distances predicted by our proposed method. In this paper, after explaining our proposed method, some new results of analytical investigation of the method are described.
{"title":"Structure-based prediction of English pronunciation distances and its analytical investigation","authors":"Shun Kasahara, N. Minematsu, Han-Ping Shen, D. Saito, K. Hirose","doi":"10.1109/ICIST.2014.6920396","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920396","url":null,"abstract":"English is the only language available for international communication and is used by approximately 1.5 billions of speakers. It is also known to have a large diversity of pronunciation partly due to the influence of the speakers' mother tongue, called accents. Our project aims at creating a global and individual-basis map of English pronunciations to be used in teaching and learning World Englishes (WE) as well as research studies of WE [1], [2]. Creating the map mathematically requires a distance matrix in terms of pronunciation differences among all the speakers considered, and technically requires a method of predicting the pronunciation distance between any pair of the speakers. Our previous but very recent study [3] combined invariant pronunciation structure analysis [4], [5], [6], [7] and Support Vector Regression (SVR) effectively to predict the interspeaker pronunciation distances. In [3], very high correlation of 0.903 was observed between reference IPA-based pronunciation distances and the distances predicted by our proposed method. In this paper, after explaining our proposed method, some new results of analytical investigation of the method are described.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128696615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920377
Bin Yin, Yujiu Yang, Wenhuang Liu
Collaborative Filtering (CF) is one of the most successful recommendation approaches to overcome information overload. To get a better recommendation, various researches have been conducted in previous literatures. Intuitively, ones' preference may rely on their interest and their friends' suggestion. However, to the best of our knowledge, no existing works systematically combine user's interest preference detection and the influence of social relationship. In this paper, we proposed ICSRec, a novel framework incorporating users' interest groups detection and the influence of social propagation. We first utilize PLSA model to mine the users' and items' interest-circles. In terms of users, a new indicator, POI(point of interest) score, is introduced to measure the extent how a target user is interested in an interest circle. Matrix factorization embedding social propagation is then employed to predict missing preference of a user for an item in each interest-circle. The experimental analysis on two large datasets Epinions and Ciao demonstrates that our approaches outperform other state-of-the-art methods.
{"title":"ICSRec: Interest circle-based recommendation system incorporating social propagation","authors":"Bin Yin, Yujiu Yang, Wenhuang Liu","doi":"10.1109/ICIST.2014.6920377","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920377","url":null,"abstract":"Collaborative Filtering (CF) is one of the most successful recommendation approaches to overcome information overload. To get a better recommendation, various researches have been conducted in previous literatures. Intuitively, ones' preference may rely on their interest and their friends' suggestion. However, to the best of our knowledge, no existing works systematically combine user's interest preference detection and the influence of social relationship. In this paper, we proposed ICSRec, a novel framework incorporating users' interest groups detection and the influence of social propagation. We first utilize PLSA model to mine the users' and items' interest-circles. In terms of users, a new indicator, POI(point of interest) score, is introduced to measure the extent how a target user is interested in an interest circle. Matrix factorization embedding social propagation is then employed to predict missing preference of a user for an item in each interest-circle. The experimental analysis on two large datasets Epinions and Ciao demonstrates that our approaches outperform other state-of-the-art methods.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920400
Ruining Huang, Taoyu Tang, Y. Lou, M. Xiao
In the off-line programming system, robot collision detection is one of the key technology and that was an important factor to improve virtual realistic system. In order to attain robot trajectory in the virtual environment, accurate and fast collision detection is requested. Aiming at this case, this paper adopts an accurate and fast collision detection algorithm based on space subdivision method. Through the using of hierarchical bounding box method and space decomposition method comprehensively, it can reduce the logarithm of triangles in the collision detection algorithm and increase the efficiency. One measure to be taken is to update moving objects' bounding boxes at any time, but don't change the stationary objects' bounding boxes which are built initially. Moreover, the distance threshold is also introduced, which make the collision detection more accurate. The simulation result shows that the detection method can meet the requirements of accuracy in complex virtual environment.
{"title":"A collision detection algorithm of Robot in off-line programming system","authors":"Ruining Huang, Taoyu Tang, Y. Lou, M. Xiao","doi":"10.1109/ICIST.2014.6920400","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920400","url":null,"abstract":"In the off-line programming system, robot collision detection is one of the key technology and that was an important factor to improve virtual realistic system. In order to attain robot trajectory in the virtual environment, accurate and fast collision detection is requested. Aiming at this case, this paper adopts an accurate and fast collision detection algorithm based on space subdivision method. Through the using of hierarchical bounding box method and space decomposition method comprehensively, it can reduce the logarithm of triangles in the collision detection algorithm and increase the efficiency. One measure to be taken is to update moving objects' bounding boxes at any time, but don't change the stationary objects' bounding boxes which are built initially. Moreover, the distance threshold is also introduced, which make the collision detection more accurate. The simulation result shows that the detection method can meet the requirements of accuracy in complex virtual environment.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121632673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920365
Wang Chen, Jiaquan Hou, Maojun Zhang, Z. Xiong, Hui Gao
Piecewise planar model for stereo matching can overcome the challenges presented by poorly textured surfaces. Lots of works employ color segmentation cues to build piecewise planar model. However, segmentation is not sufficient to represent the content-consistency, since segments are usually too small or too messy to ensure pixels from the same object surface to be assigned to the same disparity layer. To obtain more compact piecewise planar models for urban scenes, in this work, a two-layer (pixel-wise and semantic-piecewise) graph structure, which incorporates cues from image segmentation and semantic classification, is proposed. One of the graph layers models pixel color-consistency in image pairs, and the other models the disparity smoothness between image segments of the same object according to semantic classification. Experiments on different urban scenes justify the efficiency of our method.
{"title":"Semantic stereo: Integrating piecewise planar stereo with segmentation and classification","authors":"Wang Chen, Jiaquan Hou, Maojun Zhang, Z. Xiong, Hui Gao","doi":"10.1109/ICIST.2014.6920365","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920365","url":null,"abstract":"Piecewise planar model for stereo matching can overcome the challenges presented by poorly textured surfaces. Lots of works employ color segmentation cues to build piecewise planar model. However, segmentation is not sufficient to represent the content-consistency, since segments are usually too small or too messy to ensure pixels from the same object surface to be assigned to the same disparity layer. To obtain more compact piecewise planar models for urban scenes, in this work, a two-layer (pixel-wise and semantic-piecewise) graph structure, which incorporates cues from image segmentation and semantic classification, is proposed. One of the graph layers models pixel color-consistency in image pairs, and the other models the disparity smoothness between image segments of the same object according to semantic classification. Experiments on different urban scenes justify the efficiency of our method.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121958886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920318
Liang Ziyu, Liu Yan, He Wei, Lv Zhibo
As a main coaxial cable connector, BNC connector, internal connections of which often take the form of a clamping structure, is widely used in communication industry. Due to different manufactures' different production processes and standards, inadequate compaction or out-of-tolerance component size in BNC connector production may cause poor contact, which may lead to mismatch loss of coaxial cable and influence the quality of signal transmission. Based on an actual BNC connector fault in satellite communication, this paper analyzes mismatch loss caused by poor contact of BNC connector components. Quantitative analysis is given on the cause and sizes of mismatch loss, which provides reference for coaxial cable production and troubleshooting.
{"title":"Analysis on mismatch loss caused by poor contact of BNC connector components","authors":"Liang Ziyu, Liu Yan, He Wei, Lv Zhibo","doi":"10.1109/ICIST.2014.6920318","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920318","url":null,"abstract":"As a main coaxial cable connector, BNC connector, internal connections of which often take the form of a clamping structure, is widely used in communication industry. Due to different manufactures' different production processes and standards, inadequate compaction or out-of-tolerance component size in BNC connector production may cause poor contact, which may lead to mismatch loss of coaxial cable and influence the quality of signal transmission. Based on an actual BNC connector fault in satellite communication, this paper analyzes mismatch loss caused by poor contact of BNC connector components. Quantitative analysis is given on the cause and sizes of mismatch loss, which provides reference for coaxial cable production and troubleshooting.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920571
H. Dong, P. Zhao, X. Wang
Due to the complexity and asymmetrical illumination, some images are difficult to be effectively segmented by some routine method. In this paper, an algorithm based on multi-level features is designed and proposed, and which can be used for target extraction from the images with more noises, interference, uneven illumination and changeable scene. The algorithm first transfers the original image into a gray one. And then features of every level the target are extracted inheritably from the high or low level feature message. Furthermore, it also can track back to the original image or the features of low level, and the extraction goes on by recursion. So the target can be separated from the background. The algorithm experiment results indicates the target can be correctly extracted with high-efficiency and great precision, and with different sizes of the target and SNR also.
{"title":"A method of recursive target extraction based on multi-level features","authors":"H. Dong, P. Zhao, X. Wang","doi":"10.1109/ICIST.2014.6920571","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920571","url":null,"abstract":"Due to the complexity and asymmetrical illumination, some images are difficult to be effectively segmented by some routine method. In this paper, an algorithm based on multi-level features is designed and proposed, and which can be used for target extraction from the images with more noises, interference, uneven illumination and changeable scene. The algorithm first transfers the original image into a gray one. And then features of every level the target are extracted inheritably from the high or low level feature message. Furthermore, it also can track back to the original image or the features of low level, and the extraction goes on by recursion. So the target can be separated from the background. The algorithm experiment results indicates the target can be correctly extracted with high-efficiency and great precision, and with different sizes of the target and SNR also.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121524014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920373
Wang Pei, Shi Wei-ren, Lu Jun
In computer control optical surfacing technology (CCOS), removal function and dwell time optimization are hot research topics. The polishing process is susceptible to the environment interference and the removal function is instable. Thus, it is difficult to develop the optimal dwell time function. This paper focuses on the sine function and cubic function initial surface and aims to obtain the dwell time function under different conditions by changing the revolution ratio. Since the dwell time function's smoothness is one of major factors which affect the processing, difference rate algorithm is proposed to judge and the corresponding eccentricity and revolution ratio are obvious. In this way, it can provide the optimal parameters for the actual polishing and improve the processing efficiency.
{"title":"The optimization dwell time function based on difference rate algorithm","authors":"Wang Pei, Shi Wei-ren, Lu Jun","doi":"10.1109/ICIST.2014.6920373","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920373","url":null,"abstract":"In computer control optical surfacing technology (CCOS), removal function and dwell time optimization are hot research topics. The polishing process is susceptible to the environment interference and the removal function is instable. Thus, it is difficult to develop the optimal dwell time function. This paper focuses on the sine function and cubic function initial surface and aims to obtain the dwell time function under different conditions by changing the revolution ratio. Since the dwell time function's smoothness is one of major factors which affect the processing, difference rate algorithm is proposed to judge and the corresponding eccentricity and revolution ratio are obvious. In this way, it can provide the optimal parameters for the actual polishing and improve the processing efficiency.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129051964","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
扫码关注我们
求助内容：
应助结果提醒方式：