This paper focuses on the problem of fuzzy control for a class of continuous-time T-S fuzzy systems. New methods of stabilization design and H-infinity control are derived based on a relaxed approach in which both fuz...
详细信息
This paper focuses on the problem of fuzzy control for a class of continuous-time T-S fuzzy systems. New methods of stabilization design and H-infinity control are derived based on a relaxed approach in which both fuzzy Lyapunov functions and staircase membership functions are used. Through the staircase membership functions approx- imating the continuous membership functions of the given fuzzy model, the membership functions can be brought into the design conditions of fuzzy systems, thereby significantly reducing the conservativeness in the recent fuzzy controller design methods. Unlike some previous fuzzy Lyapunov function approaches reported in the literatures, the proposed design techniques of stabilization and H-infinity control do not depend on the time-derivative of the membership functions that may be pointed out as the main source of conservatism when considering fuzzy Lyapunov functions analysis. Moreover, conditions for the solvability of the controller design given here are written in the form of linear matrix inequalities, but not bilinear matrix inequalities, which are easier to be solved by convex optimization techniques. Simulation examples are given to demonstrate the validity and applicability of the proposed approaches.
Quality score (QS) plays a critical role in sponsored search auctions and in practice is closely related to the historical click-through rate (CTR) of an advertisement. Existing research, however, has not explicitly c...
详细信息
Quality score (QS) plays a critical role in sponsored search auctions and in practice is closely related to the historical click-through rate (CTR) of an advertisement. Existing research, however, has not explicitly considered this correlation between QS and historical CTR. In this paper, we strive to bridge this gap. Based on a discrete time-dependent optimal control model, which explicitly captures the CTR-QS correlation, we analyze the optimal positioning strategy and the widely-observed greedy positioning strategy for advertisers. We find that both strategies lead advertisers to monotonically increase or decrease their ranks over time, and thus may result in a polarization trend in sponsored search markets. Our findings can help characterize advertisers' behavior dynamics and also offer valuable insights and suggestions to search engines.
Many organizations adopt information technologies to make intelligent decisions during operations. Time-series data plays a crucial role in supporting such decision making processes. Though current studies on time-ser...
详细信息
In this paper, we proposed an architecture of a hierarchical networked urban traffic signal control system Based on Multi-agent. With mobile agent technology, traffic control strategies are designed as traffic control...
详细信息
In this paper, we proposed an architecture of a hierarchical networked urban traffic signal control system Based on Multi-agent. With mobile agent technology, traffic control strategies are designed as traffic control agents, which can move from device to device in a network. The system can reconfigure and replace these agents according to inconstant states of traffic environment and performances of agents. By this way, demand-based control is realized in traffic signal control system. Then we described the details and key technologies in the procession of agent-generation, agent-storage and agent-usage. At last, a prototype of the system is developed and basic functions of this system are tested by simulations. These simulations also confirm extensibility and effectiveness of the system.
In this paper, we propose a sparse coding algorithm based on matrix rank minimization and k-means clustering and for recognition. We consider the problem of removing the noise in the training samples and generating mo...
详细信息
ISBN:
(纸本)9781467314886
In this paper, we propose a sparse coding algorithm based on matrix rank minimization and k-means clustering and for recognition. We consider the problem of removing the noise in the training samples and generating more samples at the same time. To accomplish this, we extended the matrix rank minimization problem to cope with complex data. Samples from the same class are segmented into several groups by k-means clustering algorithm, and matrix rank minimization is applied on the clustered data to separate the noises and recover the low-rank structures in the grouped data. An over-complete dictionary is constructed by connecting the low-rank structures and the training samples together to keep the samples diversity. Sparse representation is operated based on this over-complete dictionary for recognition. Furthermore, a parameter is introduced to adjust the weighting of the coefficients that code the noises. We apply the proposed algorithm for character and face recognition. Experiments with improved performances validate the effectiveness of the proposed algorithm.
Interactive image segmentation which needs the user to give certain hard constraints has shown promising performance for object segmentation. In this paper, we consider characters in text image as a special kind of ob...
详细信息
Interactive image segmentation which needs the user to give certain hard constraints has shown promising performance for object segmentation. In this paper, we consider characters in text image as a special kind of object, and propose an adaptive graph cut based text binarization method to segment text from background. The main contributions of the paper lie in: 1) in order to make the binarization local adaptive with uneven background, the text region image is firstly roughly split into several sub-images on which graph cut is applied, and 2) considering the unique characteristics of the text, we propose to automatically classify some pixels as text or background with high confidence, severed as hard constraints seeds for graph cut to extract text from background by spreading the seeds into the whole sub-image. The experimental results show that our approach could get better performance in both character extraction accuracy and recognition accuracy.
Detecting text in video or natural scene image is quite challenging due to the complex background, various fonts and illumination conditions. The preprocessing period, which suppresses the nontext areas so as to highl...
详细信息
Detecting text in video or natural scene image is quite challenging due to the complex background, various fonts and illumination conditions. The preprocessing period, which suppresses the nontext areas so as to highlight the text areas, is the basis for further text detection. In this paper, a novel graph-based background suppression method for scene text detection is proposed. Considering each pixel as a node in the graph, our approach incorporates pixel-level and context-level features into a graph. Various factors contribute to the unary and pair wise cost function which is optimized via max-flow/min-cut algorithm [16] to get a binary image whose nontext pixels are suppressed so that text pixels are highlighted. Furthermore, the proposed background suppression method could be easily combined with other detection methods to improve the performance. Experimental results on ICDAR 2011 competition dataset show promising performance.
This paper studies a mean square average consensus of general linear discrete-time time-invariant multi-agent systems with communication noises.A distributed protocol,which is composed of the agent’s own state feedba...
详细信息
This paper studies a mean square average consensus of general linear discrete-time time-invariant multi-agent systems with communication noises.A distributed protocol,which is composed of the agent’s own state feedback and the relative states between the agent and its neighbors,is proposed.A time-varying consensus gain is applied to attenuate the effect of noises.A polynomial,namely “parameter polynomial”,is constructed in such a way that its coefficients are the paraments in the control gain vector of the proposed *** turns out that the parameter polynomial plays an important role in the consensus analysis of linear multi-agent *** is proved that under the proposed protocol the necessary and sufficient conditions for ensuring the mean square average consensus are: the communication topology graph is balanced and strongly connected;the consensus gain satisfies the approximation-type conditions;and all roots of the parameter polynomial are in the unit circle.
The majority of the energy consumption by the sensors is the energy requirement for data transmission in Wireless Sensor Networks (WSNs). Therefore, introducing mobile collectors to collect data instead of nmlti-hop...
详细信息
The majority of the energy consumption by the sensors is the energy requirement for data transmission in Wireless Sensor Networks (WSNs). Therefore, introducing mobile collectors to collect data instead of nmlti-hop data relay is essential. However, for rmny proposed data gathering ap-proaches, long data deNNy is the train problenm. Hence, the problem of how to decrease the energy consumption and the data deNNy needs to be solved. In this paper, a low deNNy data collection mechanism using multiple mobile collectors is pro- posed. First, a self-organization clustering algorithm is designed. Second, sensor nodes are organized into three-level clusters. Then a collection strategy based on the hierarchical structure is proposed, which includes two rules to dispatch mobile collec- tors rationally. Simulation results show that the proposed mechanism is superior to other existing approaches in terms of the reduction in energy ex-penditure and the decrease in data deNNy.
A new data-driven predictive discrete-time guidance law is presented for an interceptor pursuing a target which can perform arbitrary maneuver. The designed guidance law is driven by observed data of certain steps, wh...
详细信息
暂无评论