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":"48 1","pages":"0"},"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.6920386
Xuan Xiao, Zi Liu, Wangren Qiu
Post-translational modifications (PTMs) play vital roles in most of the protein maturation, structural stabilization and function. How to predict protein' PTMs types is an important and challenging problem. Most of the existing approaches can only be used to recognize single-label PTMs type. By introducing the multi-labeled K-Nearest-Neighbor algorithm, a new predictor has been proposed which can be used to dispose of the proteins containing both single and multi-label PTMs type. As a result that the 10-fold crosses validation was implemented on a benchmark data set of proteins which were divided into the following 4 types: (1) methylation, (2) nitrosylation, (3) acetylation, (4) phosphorylation, where many proteins belong to two or more types. For such a complex system, the outcomes achieved by our predictor for the six indices were quite promising, anticipated the predictor may become a complementary tool in this area.
{"title":"Using multi-label algorithm to predict the post-translation modification types of proteins","authors":"Xuan Xiao, Zi Liu, Wangren Qiu","doi":"10.1109/ICIST.2014.6920386","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920386","url":null,"abstract":"Post-translational modifications (PTMs) play vital roles in most of the protein maturation, structural stabilization and function. How to predict protein' PTMs types is an important and challenging problem. Most of the existing approaches can only be used to recognize single-label PTMs type. By introducing the multi-labeled K-Nearest-Neighbor algorithm, a new predictor has been proposed which can be used to dispose of the proteins containing both single and multi-label PTMs type. As a result that the 10-fold crosses validation was implemented on a benchmark data set of proteins which were divided into the following 4 types: (1) methylation, (2) nitrosylation, (3) acetylation, (4) phosphorylation, where many proteins belong to two or more types. For such a complex system, the outcomes achieved by our predictor for the six indices were quite promising, anticipated the predictor may become a complementary tool in this area.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"346 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690554","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.6920327
Huaikun Xiang, Antao Ming
Bus passenger flow collection technology is a subject urgently to be solved in current city intelligent transport system construction. By using self-developed multi-sensor array devices to collect the foot type data of passengers getting on and off, a kind of bus passenger flow intelligent recognition and statistical algorithms based on motion vector tracking is researched and proposed. The basic idea is based on establishing the motion vector model, determining the optimal solution of motion vector by advance prediction method, similarity criterion and dynamic search strategy according to the law of human body kinematics, tracking the motion process of passengers dynamically, ultimately, determining the movement direction of the passengers. The actual test results show that this algorithm can accurately and effectively deal with all kinds of complicated conditions.
{"title":"A study of the city bus passenger flow intelligent statistical algorithm based on motion vector tracking","authors":"Huaikun Xiang, Antao Ming","doi":"10.1109/ICIST.2014.6920327","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920327","url":null,"abstract":"Bus passenger flow collection technology is a subject urgently to be solved in current city intelligent transport system construction. By using self-developed multi-sensor array devices to collect the foot type data of passengers getting on and off, a kind of bus passenger flow intelligent recognition and statistical algorithms based on motion vector tracking is researched and proposed. The basic idea is based on establishing the motion vector model, determining the optimal solution of motion vector by advance prediction method, similarity criterion and dynamic search strategy according to the law of human body kinematics, tracking the motion process of passengers dynamically, ultimately, determining the movement direction of the passengers. The actual test results show that this algorithm can accurately and effectively deal with all kinds of complicated conditions.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115019370","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":"56 1","pages":"0"},"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":"31 1","pages":"0"},"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.6920533
Hongyan Zhang, Xiaoming Yu, Yi Zhai
The hierarchical clustering algorithm is one of the clustering algorithms used widely. The typical character of the hierarchical clustering algorithm is to find the “shortest” patterns. But it is not to ensure that to find the global optimal result by adding the shortest pattern each time. In this paper, we use DNA computing to solve this problem. Because during the ligation of the DNA strands, the bio-reaction's character is to combine all the possible single DNA strands into the shortest double DNA strand. We propose a DNA model with the coding strategy and DNA computing algorithm for the hierarchical clustering problem. we use this algorithm to solve the real problem - the retailer's region partition problem. Although we use the computer to simulate the bio-chemical reactions, we will execute this algorithm in the biological lab in the near future.
{"title":"A DNA model for solving the hierarchical clustering problem","authors":"Hongyan Zhang, Xiaoming Yu, Yi Zhai","doi":"10.1109/ICIST.2014.6920533","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920533","url":null,"abstract":"The hierarchical clustering algorithm is one of the clustering algorithms used widely. The typical character of the hierarchical clustering algorithm is to find the “shortest” patterns. But it is not to ensure that to find the global optimal result by adding the shortest pattern each time. In this paper, we use DNA computing to solve this problem. Because during the ligation of the DNA strands, the bio-reaction's character is to combine all the possible single DNA strands into the shortest double DNA strand. We propose a DNA model with the coding strategy and DNA computing algorithm for the hierarchical clustering problem. we use this algorithm to solve the real problem - the retailer's region partition problem. Although we use the computer to simulate the bio-chemical reactions, we will execute this algorithm in the biological lab in the near future.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123307969","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":"218 1","pages":"0"},"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.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":"131 1","pages":"0"},"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.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":"64 1","pages":"0"},"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.6920550
Huiyong Wang, Lan Wang, Xunying Liu
Accented speech recognition is more challenging than standard speech recognition due to acoustic and linguistic mismatch between standard and accented data. In this paper, we propose a new framework combining Tandem system to improve the discriminative ability of acoustic features with Multi-level Adaptive Network (MLAN) to incorporate information from standard Mandarin corpus and also to solve the data sparseness problem. Mandarin spoken by Guangzhou speakers is considered as the accented mandarin (accented Putonghua, A-PTH), while spoken by northern area as the standard mandarin (standard Putonghua, S-PTH). Significant character error rate reduction of 13.8% and 24.6% relative are obtained over the baseline GMM-HMM systems trained on mixed corpus including both A-PTH and S-PTH corpus, as well as only the A-PTH corpus respectively.
{"title":"Multi-level adaptive network for accented Mandarin speech recognition","authors":"Huiyong Wang, Lan Wang, Xunying Liu","doi":"10.1109/ICIST.2014.6920550","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920550","url":null,"abstract":"Accented speech recognition is more challenging than standard speech recognition due to acoustic and linguistic mismatch between standard and accented data. In this paper, we propose a new framework combining Tandem system to improve the discriminative ability of acoustic features with Multi-level Adaptive Network (MLAN) to incorporate information from standard Mandarin corpus and also to solve the data sparseness problem. Mandarin spoken by Guangzhou speakers is considered as the accented mandarin (accented Putonghua, A-PTH), while spoken by northern area as the standard mandarin (standard Putonghua, S-PTH). Significant character error rate reduction of 13.8% and 24.6% relative are obtained over the baseline GMM-HMM systems trained on mixed corpus including both A-PTH and S-PTH corpus, as well as only the A-PTH corpus respectively.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":"1995 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405175","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
扫码关注我们
求助内容：
应助结果提醒方式：