935 resultados para Motzkin decomposition
Resumo:
Opaque products enable service providers to hide specific characteristics of their service fulfillment from the customer until after purchase. Prominent examples include internet-based service providers selling airline tickets without defining details, such as departure time or operating airline, until the booking has been made. Owing to the resulting flexibility in resource utilization, the traditional revenue management process needs to be modified. In this paper, we extend dynamic programming decomposition techniques widely used for traditional revenue management to develop an intuitive capacity control approach that allows for the incorporation of opaque products. In a simulation study, we show that the developed approach significantly outperforms other well-known capacity control approaches adapted to the opaque product setting. Based on the approach, we also provide computational examples of how the share of opaque products as well as the degree of opacity can influence the results.
Resumo:
A number of hydrological, botanical, macro- and micro-climatological processes are involved in the formation of patterned peatlands. La Grande Tsa at 2336 m a.s.l. is probably the highest bog in the central Swiss Alps and is unique in its pattern. In two of five pools there is in the contact zone between the basal peat and the overlying gyttja an unconformity in the depth-age models based on radiocarbon dates. Palynostratigraphies of cores from a ridge and a pool confirm the occurrence of an unconformity in the contact zone. We conclude that deepening of the pools results from decomposition of peat. The fact that the dated unconformities in the two pools and the unconformity in the ridge-core all fall within the Bronze Age suggest they were caused by events external to the bog. We hypothesize that early transhumance resulted in anthropogenic lowering of the timberline, which resulted in a reduction in the leaf-area index and evapotranspiration, and in higher water levels and thus pool formation.
Resumo:
Frequency-transformed EEG resting data has been widely used to describe normal and abnormal brain functional states as function of the spectral power in different frequency bands. This has yielded a series of clinically relevant findings. However, by transforming the EEG into the frequency domain, the initially excellent time resolution of time-domain EEG is lost. The topographic time-frequency decomposition is a novel computerized EEG analysis method that combines previously available techniques from time-domain spatial EEG analysis and time-frequency decomposition of single-channel time series. It yields a new, physiologically and statistically plausible topographic time-frequency representation of human multichannel EEG. The original EEG is accounted by the coefficients of a large set of user defined EEG like time-series, which are optimized for maximal spatial smoothness and minimal norm. These coefficients are then reduced to a small number of model scalp field configurations, which vary in intensity as a function of time and frequency. The result is thus a small number of EEG field configurations, each with a corresponding time-frequency (Wigner) plot. The method has several advantages: It does not assume that the data is composed of orthogonal elements, it does not assume stationarity, it produces topographical maps and it allows to include user-defined, specific EEG elements, such as spike and wave patterns. After a formal introduction of the method, several examples are given, which include artificial data and multichannel EEG during different physiological and pathological conditions.
Resumo:
Background and aims Fine root decomposition contributes significantly to element cycling in terrestrial ecosystems. However, studies on root decomposition rates and on the factors that potentially influence them are fewer than those on leaf litter decomposition. To study the effects of region and land use intensity on fine root decomposition, we established a large scale study in three German regions with different climate regimes and soil properties. Methods In 150 forest and 150 grassland sites we deployed litterbags (100 μm mesh size) with standardized litter consisting of fine roots from European beech in forests and from a lowland mesophilous hay meadow in grasslands. In the central study region, we compared decomposition rates of this standardized litter with root litter collected on-site to separate the effect of litter quality from environmental factors. Results Standardized herbaceous roots in grassland soils decomposed on average significantly faster (24 ± 6 % mass loss after 12 months, mean ± SD) than beech roots in forest soils (12 ± 4 %; p < 0.001). Fine root decomposition varied among the three study regions. Land use intensity, in particular N addition, decreased fine root decomposition in grasslands. The initial lignin:N ratio explained 15 % of the variance in grasslands and 11 % in forests. Soil moisture, soil temperature, and C:N ratios of soils together explained 34 % of the variance of the fine root mass loss in grasslands, and 24 % in forests. Conclusions Grasslands, which have higher fine root biomass and root turnover compared to forests, also have higher rates of root decomposition. Our results further show that at the regional scale fine root decomposition is influenced by environmental variables such as soil moisture, soil temperature and soil nutrient content. Additional variation is explained by root litter quality.
Resumo:
In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.