Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extracti...Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extraction, constraint network construction andoperation, constraint chains are acquired, and then the conceptual design scheme can be got bydecoding the information stored in the design constraint chains, which provides a novelty method formechanical product design automation. Shearing mechanism of shearing machine has been designed bythis way.展开更多
This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and con...This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and conflict solution sequence.Considering pipe routing as an assembling process,a conflict detection approach for pipe routing in collaborative architectural design is proposed based on an aforementioned model.Constraint network is used to describe the relationship among pipe routing design parameters and constraints;design conflicts are detected by matching designers' input and constraint network;and detected design conflicts are reordered according to the number of pipe parameters in conflicts.In order to support the collaborative requirement of pipe routing design,a prototype system using browser/server architecture is developed.An illustrative example of water pipe routing in a room is used to show the effectiveness and efficiency of the approach.展开更多
In this paper, a study of control for an uncertain2-degree of freedom(DOF) helicopter system is given. The2-DOF helicopter is subject to input deadzone and output constraints. In order to cope with system uncertaintie...In this paper, a study of control for an uncertain2-degree of freedom(DOF) helicopter system is given. The2-DOF helicopter is subject to input deadzone and output constraints. In order to cope with system uncertainties and input deadzone, the neural network technique is introduced because of its capability in approximation. In order to update the weights of the neural network, an adaptive control method is utilized to improve the system adaptability. Furthermore, the integral barrier Lyapunov function(IBLF) is adopt in control design to guarantee the condition of output constraints and boundedness of the corresponding tracking errors. The Lyapunov direct method is applied in the control design to analyze system stability and convergence. Finally, numerical simulations are conducted to prove the feasibility and effectiveness of the proposed control based on the model of Quanser's 2-DOF helicopter.展开更多
We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subje...We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-hard and propose approximation algorithm proving the approximation ratio with lnm+1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation. Key words network - distributed monitoring - delay constraint - NP-hard CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60373023)Biography: LIU Xiang-hui(1973-), male, Ph. D. candidate, research direction: algorithm complexity analysis, QoS in Internet.展开更多
When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian...When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian networks. In this paper, a new monotonic constraint model is proposed to represent a type of common domain knowledge. And then, the monotonic constraint estimation algorithm is proposed to learn the parameters with the monotonic constraint model. In order to demonstrate the superiority of the proposed algorithm, series of experiments are carried out. The experiment results show that the proposed algorithm is able to obtain more accurate parameters compared to some existing algorithms while the complexity is not the highest.展开更多
In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of net...In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of networks varies significantly. This effect is thoroughly analyzed with a heuristic algorithm for different network topologies belonging to some European network operators. The main conclusion extracted is that limiting the transparent reach in such multi-layer networks can give a good tradeoff between CAPEX of IP/MPLS networks and WSON networks,and even lead to signifi cant savings in CAPEX when compared to longer lightpaths routing strategies.展开更多
This paper addresses the problem of fault detection（FD） for networked systems with access constraints and packet dropouts.Two independent Markov chains are used to describe the sequences of channels which are availa...This paper addresses the problem of fault detection（FD） for networked systems with access constraints and packet dropouts.Two independent Markov chains are used to describe the sequences of channels which are available for communication at an instant and the packet dropout process,respectively.Performance indexes H∞ and H_ are introduced to describe the robustness of residual against external disturbances and sensitivity of residual to faults,respectively.By using a mode-dependent fault detection filter（FDF） as residual generator,the addressed FD problem is converted into an auxiliary filter design problem with the above index constraints.A sufficient condition for the existence of the FDF is derived in terms of certain linear matrix inequalities（LMIs）.When these LMIs are feasible,the explicit expression of the desired FDF can also be characterized.A numerical example is exploited to show the usefulness of the proposed results.展开更多
This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transf...This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transformed from the NCSs, an augmented Lyapunov function containing more useful information is constructed. A less conservative sufficient condition is established such that the closed-loop systems stability and time-domain integral quadratic constraints （IQCs） are satisfied while both time-varying network- induced delays and packet losses are taken into account. The fuzzy tracking controllers design scheme is derived in terms of linear matrix inequalities （LMIs） and parallel distributed compensation （PDC）. Furthermore, robust stabilization criterion for nonlinear NCSs is given as an extension of the tracking control result. Finally, numerical simulations are provided to illustrate the effectiveness and merits of the proposed method.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
文摘Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extraction, constraint network construction andoperation, constraint chains are acquired, and then the conceptual design scheme can be got bydecoding the information stored in the design constraint chains, which provides a novelty method formechanical product design automation. Shearing mechanism of shearing machine has been designed bythis way.
基金Supported by the National High Technology Research and Development Programme of China(No.2006AA04Z112)the National Natural Science Foundation of China(No.51175287)the National S&T Major Program(No.2009ZX02001-003)
文摘This paper analyzes conflict features in architecture pipe routing,and builds a pipe routing design conflict model by taking into account of discrete nominal internal diameter selection of pipes,material costs,and conflict solution sequence.Considering pipe routing as an assembling process,a conflict detection approach for pipe routing in collaborative architectural design is proposed based on an aforementioned model.Constraint network is used to describe the relationship among pipe routing design parameters and constraints;design conflicts are detected by matching designers' input and constraint network;and detected design conflicts are reordered according to the number of pipe parameters in conflicts.In order to support the collaborative requirement of pipe routing design,a prototype system using browser/server architecture is developed.An illustrative example of water pipe routing in a room is used to show the effectiveness and efficiency of the approach.
基金supported by the National Natural Science Foundation of China(61803085,61806052,U1713209)the Natural Science Foundation of Jiangsu Province of China(BK20180361)
文摘In this paper, a study of control for an uncertain2-degree of freedom(DOF) helicopter system is given. The2-DOF helicopter is subject to input deadzone and output constraints. In order to cope with system uncertainties and input deadzone, the neural network technique is introduced because of its capability in approximation. In order to update the weights of the neural network, an adaptive control method is utilized to improve the system adaptability. Furthermore, the integral barrier Lyapunov function(IBLF) is adopt in control design to guarantee the condition of output constraints and boundedness of the corresponding tracking errors. The Lyapunov direct method is applied in the control design to analyze system stability and convergence. Finally, numerical simulations are conducted to prove the feasibility and effectiveness of the proposed control based on the model of Quanser's 2-DOF helicopter.
文摘We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-hard and propose approximation algorithm proving the approximation ratio with lnm+1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation. Key words network - distributed monitoring - delay constraint - NP-hard CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60373023)Biography: LIU Xiang-hui(1973-), male, Ph. D. candidate, research direction: algorithm complexity analysis, QoS in Internet.
基金supported by the National Natural Science Foundation of China(6130513361573285)the Fundamental Research Funds for the Central Universities(3102016CG002)
文摘When the training data are insufficient, especially when only a small sample size of data is available, domain knowledge will be taken into the process of learning parameters to improve the performance of the Bayesian networks. In this paper, a new monotonic constraint model is proposed to represent a type of common domain knowledge. And then, the monotonic constraint estimation algorithm is proposed to learn the parameters with the monotonic constraint model. In order to demonstrate the superiority of the proposed algorithm, series of experiments are carried out. The experiment results show that the proposed algorithm is able to obtain more accurate parameters compared to some existing algorithms while the complexity is not the highest.
基金jointly supported by Jiangsu Government Scholarship for Overseas studies,Chinathe open fund of State Key Laboratory of Advanced Optical Communication Systems and Networks, Shanghai Jiao Tong University,China(No. 2015GZKF03006)Research Center of Optical Communications Engineering & Technology,Jiangsu Province(No.ZSF0201)
文摘In this work,the impact of hop constraints on the CAPEX of multi-layer IP/MPLS over WSON networks is evaluated under different scenarios. By routing lightpaths with different number of transparent hops,the cost of networks varies significantly. This effect is thoroughly analyzed with a heuristic algorithm for different network topologies belonging to some European network operators. The main conclusion extracted is that limiting the transparent reach in such multi-layer networks can give a good tradeoff between CAPEX of IP/MPLS networks and WSON networks,and even lead to signifi cant savings in CAPEX when compared to longer lightpaths routing strategies.
基金supported by the National Natural Science Foundation of China (6057408860874053)
文摘This paper addresses the problem of fault detection（FD） for networked systems with access constraints and packet dropouts.Two independent Markov chains are used to describe the sequences of channels which are available for communication at an instant and the packet dropout process,respectively.Performance indexes H∞ and H_ are introduced to describe the robustness of residual against external disturbances and sensitivity of residual to faults,respectively.By using a mode-dependent fault detection filter（FDF） as residual generator,the addressed FD problem is converted into an auxiliary filter design problem with the above index constraints.A sufficient condition for the existence of the FDF is derived in terms of certain linear matrix inequalities（LMIs）.When these LMIs are feasible,the explicit expression of the desired FDF can also be characterized.A numerical example is exploited to show the usefulness of the proposed results.
基金supported by National Natural Science Foundation of China (No. 60574014, No. 60425310)Doctor Subject Foundation of China (No. 200805330004)+2 种基金Program for New Century Excellent Talents in University (No. NCET-06-0679)Natural Science Foundation of Hunan Province of China (No. 08JJ1010)Science Foundation of Education Department of Hunan Province (No. 08C106)
文摘This paper investigates the robust tracking control problcm for a class of nonlinear networked control systems （NCSs） using the Takagi-Sugeno （T-S） fuzzy model approach. Based on a time-varying delay system transformed from the NCSs, an augmented Lyapunov function containing more useful information is constructed. A less conservative sufficient condition is established such that the closed-loop systems stability and time-domain integral quadratic constraints （IQCs） are satisfied while both time-varying network- induced delays and packet losses are taken into account. The fuzzy tracking controllers design scheme is derived in terms of linear matrix inequalities （LMIs） and parallel distributed compensation （PDC）. Furthermore, robust stabilization criterion for nonlinear NCSs is given as an extension of the tracking control result. Finally, numerical simulations are provided to illustrate the effectiveness and merits of the proposed method.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
