Pub Date : 2013-03-23DOI: 10.1109/ICIST.2013.6747525
Ruiyang Du, Qing Li, Jian Zhou
Industrial automation system integration (IASI) assessment is of great significance both to the administration and to the enterprise. A series of effective analysis methods is needed for data processing. This paper presents an analysis method based on locally weighted regression (LOWESS) in an investigation of the Chinese steel industry in 2011. Using this method we present the status and trends of the industry, and propose a relative capacity assessment (RCA) method for diagnostic analysis of the enterprise. The results may be instructive for policy making and enterprise strategy.
{"title":"Locally weighted regression based industrial automation system integration assessment","authors":"Ruiyang Du, Qing Li, Jian Zhou","doi":"10.1109/ICIST.2013.6747525","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747525","url":null,"abstract":"Industrial automation system integration (IASI) assessment is of great significance both to the administration and to the enterprise. A series of effective analysis methods is needed for data processing. This paper presents an analysis method based on locally weighted regression (LOWESS) in an investigation of the Chinese steel industry in 2011. Using this method we present the status and trends of the industry, and propose a relative capacity assessment (RCA) method for diagnostic analysis of the enterprise. The results may be instructive for policy making and enterprise strategy.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132306498","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747765
Zhongliang Wang, Yan Feng, Yin Jia
Compressive sensing (CS) is a new emerging approach in recent years, and is applied in acquisition of signals having a sparse or compressible representation in some basis. The CS literature has mostly focused on the problems involving 1-D signals and 2-D images. However, for hyperspectral image, compressive acquisition of this signal is complicated for its 3-D structures. In this paper, we consider the correlation of spatial and spectral of hyperspectral image and propose spatial-spectral compressive sensing. The results show that the proposed method leads to an increase in CS reconstruction performance under the same compression ratio and reconstruction algorithm. In particular, our method is more advantageous in realizing airborne or spaceborne hyperspectral remote sensing for its lower memory storage.
{"title":"Spatial-spectral compressive sensing of hyperspectral image","authors":"Zhongliang Wang, Yan Feng, Yin Jia","doi":"10.1109/ICIST.2013.6747765","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747765","url":null,"abstract":"Compressive sensing (CS) is a new emerging approach in recent years, and is applied in acquisition of signals having a sparse or compressible representation in some basis. The CS literature has mostly focused on the problems involving 1-D signals and 2-D images. However, for hyperspectral image, compressive acquisition of this signal is complicated for its 3-D structures. In this paper, we consider the correlation of spatial and spectral of hyperspectral image and propose spatial-spectral compressive sensing. The results show that the proposed method leads to an increase in CS reconstruction performance under the same compression ratio and reconstruction algorithm. In particular, our method is more advantageous in realizing airborne or spaceborne hyperspectral remote sensing for its lower memory storage.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134585509","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}
Modeling and simulation on channel conditions play an important role in performance evaluation of wireless protocols. Two most widely used channel error model are independent model and Markov model. The former is simple and easy to implement, but cannot capture the bursty nature of channel errors. And we find that, when the bit error rate is relatively small, the existing Markov model cannot efficiently predict channel conditions. For these reasons, we propose MIM, a hybrid channel error model. MIM partitions the received binary indicator sequence into m blocks. And it's assumed that the occurrence of bit errors within each block conforms to the two-state Markov model, while between blocks, block errors are independent and identically distributed (IID) as one fixed block error probability pb. We set up an office wireless environment and choose the optimal model parameters based on collected error trace. The analysis of model parameters shows that, our model well conforms to reality.
{"title":"MIM: A new class of hybrid channel error model","authors":"Gang Han, Jia Lu, Junhui Wang, Guofu Wu, Yaokai Zhu, Wenhua Dou","doi":"10.1109/ICIST.2013.6747748","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747748","url":null,"abstract":"Modeling and simulation on channel conditions play an important role in performance evaluation of wireless protocols. Two most widely used channel error model are independent model and Markov model. The former is simple and easy to implement, but cannot capture the bursty nature of channel errors. And we find that, when the bit error rate is relatively small, the existing Markov model cannot efficiently predict channel conditions. For these reasons, we propose MIM, a hybrid channel error model. MIM partitions the received binary indicator sequence into m blocks. And it's assumed that the occurrence of bit errors within each block conforms to the two-state Markov model, while between blocks, block errors are independent and identically distributed (IID) as one fixed block error probability pb. We set up an office wireless environment and choose the optimal model parameters based on collected error trace. The analysis of model parameters shows that, our model well conforms to reality.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129392542","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747548
Yunong Zhang, Ying Wang, Long Jin, Junwei Chen, Yiwen Yang
Zhang neural network (ZNN), a special class of recurrent neural network (RNN), has recently been introduced for time-varying convex quadratic-programming (QP) problems solving. In this paper, a drift-free robotic criterion is exploited in the form of a quadratic performance index. This repetitive-motion-planning (RMP) scheme can be reformulated into a time-varying quadratic program subject to a linear-equality constraint. As QP real-time solvers, two recurrent neural networks, i.e., Zhang neural network and gradient neural network (GNN), are then developed for the online solution of the time-varying QP problem. Computer simulations performed on a four-link robot manipulator demonstrate the superiority of the ZNN solver, compared to the GNN one. Moreover, robotic experiments conducted on a six degrees-of-freedom (DOF) motor-driven push-rod (MDPR) redundant robot manipulator substantiate the physical realizability and effectiveness of this RMP scheme using the ZNN solver.
{"title":"Simulations and experiments of ZNN for online quadratic programming applied to manipulator inverse kinematics","authors":"Yunong Zhang, Ying Wang, Long Jin, Junwei Chen, Yiwen Yang","doi":"10.1109/ICIST.2013.6747548","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747548","url":null,"abstract":"Zhang neural network (ZNN), a special class of recurrent neural network (RNN), has recently been introduced for time-varying convex quadratic-programming (QP) problems solving. In this paper, a drift-free robotic criterion is exploited in the form of a quadratic performance index. This repetitive-motion-planning (RMP) scheme can be reformulated into a time-varying quadratic program subject to a linear-equality constraint. As QP real-time solvers, two recurrent neural networks, i.e., Zhang neural network and gradient neural network (GNN), are then developed for the online solution of the time-varying QP problem. Computer simulations performed on a four-link robot manipulator demonstrate the superiority of the ZNN solver, compared to the GNN one. Moreover, robotic experiments conducted on a six degrees-of-freedom (DOF) motor-driven push-rod (MDPR) redundant robot manipulator substantiate the physical realizability and effectiveness of this RMP scheme using the ZNN solver.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235591","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747651
B. Yao, Hongyu Wang, Ming Yao, Xiangen Chen, Chao Yang, Xiao-Min Zhang
Connected Dominating Set Problem is a fundamental problem in connected facility location and studied intensively in computer science and operations research and it is also a central problem in wireless networking. Maximum Leaf Spanning Tree Problem (MLSTP) is related with investigating scale-free networks. We investigate the collapse of graphs since “robust yet fragile” is an important character of scale-free networks, and provide two algorithms to approximate MLSTP.
{"title":"On the collapse of graphs related to scale-free networks","authors":"B. Yao, Hongyu Wang, Ming Yao, Xiangen Chen, Chao Yang, Xiao-Min Zhang","doi":"10.1109/ICIST.2013.6747651","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747651","url":null,"abstract":"Connected Dominating Set Problem is a fundamental problem in connected facility location and studied intensively in computer science and operations research and it is also a central problem in wireless networking. Maximum Leaf Spanning Tree Problem (MLSTP) is related with investigating scale-free networks. We investigate the collapse of graphs since “robust yet fragile” is an important character of scale-free networks, and provide two algorithms to approximate MLSTP.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403937","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747530
F. Yakub, Y. Mori
Model predictive control (MPC), one of the advanced control methods that has received on going interest from academic and industrial researchers communities. One of the major attractive aspects of MPC methodology is the design formulation, which capitalizes a multivariable system structure where it controls performance parameters that are related to the engineering aspects of the system. Due to its advantages, it has been extended to many areas of vehicle dynamics system and control. Therefore, the goal of this paper is to review MPC as a practical controller for car vehicle dynamics system for active safety and stability control. The publications is classify to three main aspects, i.e., steering and braking control, yaw and roll control, and active and semi-active suspension control. MPC had a good control performance and robustness to parameters variations with constraints to linear or nonlinear systems.
{"title":"Model predictive control for car vehicle dynamics system - Comparative study","authors":"F. Yakub, Y. Mori","doi":"10.1109/ICIST.2013.6747530","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747530","url":null,"abstract":"Model predictive control (MPC), one of the advanced control methods that has received on going interest from academic and industrial researchers communities. One of the major attractive aspects of MPC methodology is the design formulation, which capitalizes a multivariable system structure where it controls performance parameters that are related to the engineering aspects of the system. Due to its advantages, it has been extended to many areas of vehicle dynamics system and control. Therefore, the goal of this paper is to review MPC as a practical controller for car vehicle dynamics system for active safety and stability control. The publications is classify to three main aspects, i.e., steering and braking control, yaw and roll control, and active and semi-active suspension control. MPC had a good control performance and robustness to parameters variations with constraints to linear or nonlinear systems.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133567559","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747511
Shanhui Liu, X. Mei, Li’e Ma, Hao You, Zheng Li
The stability of multi-input and multi-output web-tension systems is an important factor that is required to operate properly and to obtain reasonable printing performance in the roll-to-roll printing machines. This paper presents a unique method based on active disturbance rejection control for designing the tension decoupling controller of the unwinding system in the gravure printing machine. In this study, a decoupling model is constructed to obtain the order and the static decoupling plant of the unwinding system. Based on the order and static decoupling plant, an ADRC decoupling controller is designed to enhance the stability of the tension in the unwinding system. The effectiveness and capability of the proposed control strategy are verified by computer simulation and the results show that the proposed tension controller not only realizes a decoupling control for the unwinding system, but also has good disturbance rejection ability and robustness.
{"title":"Active disturbance rejection decoupling controller design for roll-to-roll printing machines","authors":"Shanhui Liu, X. Mei, Li’e Ma, Hao You, Zheng Li","doi":"10.1109/ICIST.2013.6747511","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747511","url":null,"abstract":"The stability of multi-input and multi-output web-tension systems is an important factor that is required to operate properly and to obtain reasonable printing performance in the roll-to-roll printing machines. This paper presents a unique method based on active disturbance rejection control for designing the tension decoupling controller of the unwinding system in the gravure printing machine. In this study, a decoupling model is constructed to obtain the order and the static decoupling plant of the unwinding system. Based on the order and static decoupling plant, an ADRC decoupling controller is designed to enhance the stability of the tension in the unwinding system. The effectiveness and capability of the proposed control strategy are verified by computer simulation and the results show that the proposed tension controller not only realizes a decoupling control for the unwinding system, but also has good disturbance rejection ability and robustness.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133639768","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747846
Xinsheng Ji, Xiaolei Kang, Kaizhi Huang, Keming Ma
The method of physical layer security in wireless relay communication based on cooperative jamming scheme need the channel of legitimate user keep constant. It fails if the eavesdropper has more antennas than the sender. To solve this problem, this paper proposes a second-order spatial hopping transmission scheme. The sender, by the antenna switching and the hopping spatial pattern (HSP), forms equivalent spatial channel of the first-order; Acting as a virtual multi-antenna receivers, relays use time-varying coefficient of beam-forming to weighted-and-forward, form equivalent spatial channel of the second-order. Simulation results show that the scheme proposed achieves low probability of intercept (LPI) in eavesdropper and the power consumption is lower than the method of cooperative jamming.
{"title":"A second-order spatial hopping transmission scheme for physical layer security","authors":"Xinsheng Ji, Xiaolei Kang, Kaizhi Huang, Keming Ma","doi":"10.1109/ICIST.2013.6747846","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747846","url":null,"abstract":"The method of physical layer security in wireless relay communication based on cooperative jamming scheme need the channel of legitimate user keep constant. It fails if the eavesdropper has more antennas than the sender. To solve this problem, this paper proposes a second-order spatial hopping transmission scheme. The sender, by the antenna switching and the hopping spatial pattern (HSP), forms equivalent spatial channel of the first-order; Acting as a virtual multi-antenna receivers, relays use time-varying coefficient of beam-forming to weighted-and-forward, form equivalent spatial channel of the second-order. Simulation results show that the scheme proposed achieves low probability of intercept (LPI) in eavesdropper and the power consumption is lower than the method of cooperative jamming.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132147342","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747618
Hui Zhang, N. Huang
Large scale networks, which are complex systems with huge number of nodes and links, are difficult to evaluate reliability with the existing theory of algorithms, simulation and test methods because of high complexity. In practice, a simplified version of network is always developed as the basis for the evaluation in order to greatly decrease the complexity of the analysis. Therefore, it is of great importance to search for the potential influences on reliability brought by the network simplification. BA network is a classic scale-free network model, which is best suitable to describe the network topology of many practical complex engineering networks. However, the effect on connectivity reliability of BA network brought by downsizing and reducing the number of nodes for simplification is still not clear. In this paper, a reliability simulation test is designed based on the network model built up to analyze the changing of network connectivity rate as the result of the physical failure of BA network nodes. Simulation results demonstrate the conclusion that the connectivity reliability of BA networks with different sizes shares some similarities, which can be regarded as the basis for network simplification in the scale-free network reliability analysis.
{"title":"Connectivity reliability analysis of different scale BA networks","authors":"Hui Zhang, N. Huang","doi":"10.1109/ICIST.2013.6747618","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747618","url":null,"abstract":"Large scale networks, which are complex systems with huge number of nodes and links, are difficult to evaluate reliability with the existing theory of algorithms, simulation and test methods because of high complexity. In practice, a simplified version of network is always developed as the basis for the evaluation in order to greatly decrease the complexity of the analysis. Therefore, it is of great importance to search for the potential influences on reliability brought by the network simplification. BA network is a classic scale-free network model, which is best suitable to describe the network topology of many practical complex engineering networks. However, the effect on connectivity reliability of BA network brought by downsizing and reducing the number of nodes for simplification is still not clear. In this paper, a reliability simulation test is designed based on the network model built up to analyze the changing of network connectivity rate as the result of the physical failure of BA network nodes. Simulation results demonstrate the conclusion that the connectivity reliability of BA networks with different sizes shares some similarities, which can be regarded as the basis for network simplification in the scale-free network reliability analysis.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133204214","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 : 2013-03-23DOI: 10.1109/ICIST.2013.6747611
Yufeng Zhuang, Junzheng Shi, Zeyan Hu
The throughput of Clos switch depends on the response time of devices and the computing time of rearranging when Clos network is blocked, so it is very important to reduce the time complexity of the rearranging algorithm. The Paull algorithm is used intensively as the rearranging algorithm of Clos network, in this paper we abandon the set matrix structure in the Paull algorithm, and instead, we improve the Paull algorithm according to employ the expandable data structure of adjacency list of figures. This solution reduces the time complexity significantly.
{"title":"Time complexity optimization of the Paull algorithm based on expandable data structure","authors":"Yufeng Zhuang, Junzheng Shi, Zeyan Hu","doi":"10.1109/ICIST.2013.6747611","DOIUrl":"https://doi.org/10.1109/ICIST.2013.6747611","url":null,"abstract":"The throughput of Clos switch depends on the response time of devices and the computing time of rearranging when Clos network is blocked, so it is very important to reduce the time complexity of the rearranging algorithm. The Paull algorithm is used intensively as the rearranging algorithm of Clos network, in this paper we abandon the set matrix structure in the Paull algorithm, and instead, we improve the Paull algorithm according to employ the expandable data structure of adjacency list of figures. This solution reduces the time complexity significantly.","PeriodicalId":415759,"journal":{"name":"2013 IEEE Third International Conference on Information Science and Technology (ICIST)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131664638","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
扫码关注我们
求助内容：
应助结果提醒方式：