Here we study the problem of sampling random proper colorings of a bounded degree graph. Let k be the number of colors and let d be the maximum degree. In 1999, Vigoda [Vig99] showed that the Glauber dynamics is rapid...
详细信息
The Bayesian online selection problem aims to design a pricing scheme for a sequence of arriving buyers that maximizes the expected social welfare (or revenue) subject to different structural constraints. Inspired by ...
详细信息
In this paper a method is present solving fractional linear programming problems in fuzzy environment by ranging methods, where parameters are fuzzy numbers with uncertain coefficients in the objective function. Here ...
详细信息
In this paper a method is present solving fractional linear programming problems in fuzzy environment by ranging methods, where parameters are fuzzy numbers with uncertain coefficients in the objective function. Here we constitute the crisp relationship between the objective function and the decision variables to solve the resulting programming problem to find a fair optimal solution to the material related problem, illustrated with an example.
This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear progra...
详细信息
This paper shows a novel approach to the design of a digital allpass phase-compensation system. This approach extends the linear-fractional programming (LFP) method to the case of designing an allpass phase-compensati...
详细信息
ISBN:
(纸本)9781728107295
This paper shows a novel approach to the design of a digital allpass phase-compensation system. This approach extends the linear-fractional programming (LFP) method to the case of designing an allpass phase-compensation system and solves the system design problem as a linear-programming (LP) minimization. Originally, the LFP is used to minimize an objective function that is a ratio of two affine functions over a polyhedron. The LFP first transforms the original minimization problem to a linear-programming (LP) one, where the affine functions have constant coefficients. This paper extends this transformation to the minimax design of an allpass phase-compensation system, where the objective function is a ratio of two affine functions, but the coefficients are non-constant. This paper discusses how to extend the LFP to the case where the coefficients are non-constant and then design an allpass phase-compensation system by using the LFP approach. A demonstrative example is given to show the feasibility of the extended LFP.
In order to improve the throughput of network and ensure the quality of user experience, more small stations has been densely deployed in cellular networks. And consumption of fossil fuel will increase rapidly, which ...
详细信息
ISBN:
(纸本)9781509057597
In order to improve the throughput of network and ensure the quality of user experience, more small stations has been densely deployed in cellular networks. And consumption of fossil fuel will increase rapidly, which has brought serious challenges to the mobile operators in cost control and the ecological environment. With the development of renewable energy and smart grid, great changes have taken place in energy structure and energy utilization of the cellular network. The future trend of cellular networks will present a multi-source power. Traditional grid as the main body, centralized powering the base station form the wide area power grid, to maintain the basic power of wireless network. As a supplement, green base station can combine the set of equipment, base station, storage battery and charge controller together to achieve micro electric power network by multi-sources energy harvesting technology. However, the harvest of the renewable energy is influenced by the time-space instability. The demand of users and the consumption of the cellular networks are also influenced by space-time instability. Therefore, this paper proposes a model of the flexible configuration of energy through the energy management unit(EMU), through energy cooperation between base stations and smart grid, we can get optimal energy configuration. By analyzing the scenario of N time slots, m base station, we solve the optimal energy profiles for each time slots according to the greedy algorithm and linear programming, and then the relevant simulation will validate the algorithm. By using the algorithm to realize the energy cooperation according to the demands of each node, we can recede the instability of the process of energy harvesting. And we can achieve the goal of optimizing the efficient use of clean energy.
This paper addresses an improved approach to dynamic output-feedback control design of positive systems. By using a simple matrix transformation technique that a matrix can be described via the sum of all its column v...
详细信息
ISBN:
(纸本)9781509059928
This paper addresses an improved approach to dynamic output-feedback control design of positive systems. By using a simple matrix transformation technique that a matrix can be described via the sum of all its column vectors, a linear programming based controller design approach for nominal positive systems is proposed. Subsequently, the proposed approach is extended to interval positive systems. The present approach contains three merits that are different from existing ones: (i) it employs the linear programming technique while existing ones adopt the linear matrix inequalities technique;(ii) it provides a more general controller without negative restriction while existing ones may require the negativity of the controller gain matrix;(iii) it is easy to be extended to other issues of positive systems while this may not always be possible for existing approaches. Finally, a numerical example is provided to verify the effectiveness of the proposed design.
The linear programming ( LP) based approach we introduced in [1] for finding finite blocklength converses for joint source-channel coding is extended to some network-like settings. Finite blocklength channel coding of...
详细信息
ISBN:
(纸本)9781509030972
The linear programming ( LP) based approach we introduced in [1] for finding finite blocklength converses for joint source-channel coding is extended to some network-like settings. Finite blocklength channel coding of compound and averaged channels under the maximum probability error criterion is considered. Through the LP approach new converses are obtained which imply a weak converse for both channels and a strong converse for the compound channel. The LP approach is also extended to the networked setting and a new finite blocklength converse for Slepian-Wolf coding which improves on the converse in Han [2, Lemma 7.2.2] is derived.
The pressure to maintain (or increase) the level of competitiveness in companies leads to an ever-increasing requirement for effective management supported by the variety of existing resources, which tend to interfere...
详细信息
ISBN:
(纸本)9781509050475
The pressure to maintain (or increase) the level of competitiveness in companies leads to an ever-increasing requirement for effective management supported by the variety of existing resources, which tend to interfere into the work of the manager. Particularly, in the case of waiting queues, the most relevant aspect is the combination of the number of multitasking servers assigned to attend and the demand that varies over the course of a day's work. The main objective is to meet the expectations created by the client regarding the opinion of the service that was provided. The contribution that this work proposes to give consists in planning the number of servers adapted to a given demand, not forgetting the valuation associated with the release of resources to perform other tasks related to the business. We use linear programming to determine the optimal number of the servers to serve customers, depending on their hourly availability to fulfill this function and the estimated demand. The model is submitted to four distinct real scenarios, each one reflecting a certain service reality, so that we can evaluate its behavior and possible gains against real situations occurring under the same conditions. The results show the credibility of the model since it reveals in conditions very similar to those of a real situation (translated in one of the scenarios), very little relevant differences.
A new type of linear-programming based Model Predictive Control (LP-MPC) is presented in this work. The MPC optimization process is reformulated as a linear programming problem and solved using the Simplex method. The...
详细信息
ISBN:
(纸本)9789875447547
A new type of linear-programming based Model Predictive Control (LP-MPC) is presented in this work. The MPC optimization process is reformulated as a linear programming problem and solved using the Simplex method. The optimization result is the duty cycle of a fixed-frequency pulse width modulator (PWM) which switches the transistors of a three-phase grid-connected voltage source inverter. In opposition to other LP-MPC formulations, the optimization is carried out online. In order to validate the proposal, a comparison with a Generalized Predictive Control (GPC) algorithm is made through simulations. Results show a better performance of the proposed strategy in different non ideal scenarios.
暂无评论