Cogeneration design problem Computational complexity analysis and solution through an expert system

Purpose - The purpose of this paper is twofold: to analyze the computational complexity of the cogeneration design problem; to present an expert system to solve the proposed problem, comparing such an approach with the traditional searching methods available.Design/methodology/approach - The complexity of the cogeneration problem is analyzed through the transformation of the well-known knapsack problem. Both problems are formulated as decision problems and it is proven that the cogeneration problem is np-complete. Thus, several searching approaches, such as population heuristics and dynamic programming, could be used to solve the problem. Alternatively, a knowledge-based approach is proposed by presenting an expert system and its knowledge representation scheme.Findings - The expert system is executed considering two case-studies. First, a cogeneration plant should meet power, steam, chilled water and hot water demands. The expert system presented two different solutions based on high complexity thermodynamic cycles. In the second case-study the plant should meet just power and steam demands. The system presents three different solutions, and one of them was never considered before by our consultant expert.Originality/value - The expert system approach is not a "blind" method, i.e. it generates solutions based on actual engineering knowledge instead of the searching strategies from traditional methods. It means that the system is able to explain its choices, making available the design rationale for each solution. This is the main advantage of the expert system approach over the traditional search methods. On the other hand, the expert system quite likely does not provide an actual optimal solution. All it can provide is one or more acceptable solutions.

The effects of habitat complexity and hydraulic conditions on the establishment of benthic stream macroalgae

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Complexity and information technologies: an ethical inquiry into human autonomous action

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Alterações epigenéticas do gene RASSF1 e investigação de modulação gene-específica por non-coding RNA em linhagens celulares derivadas de carcinomas mamários

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

The relationship between macroalgal morphological complexity and hydraulic conditions in stream habitats

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

HLA-E coding and 3' untranslated region variability determined by next-generation sequencing in two West-African population samples

HLA-E is a non-classical Human Leucocyte Antigen class I gene with immunomodulatory properties. Whereas HLA-E expression usually occurs at low levels, it is widely distributed amongst human tissues, has the ability to bind self and non-self antigens and to interact with NK cells and T lymphocytes, being important for immunosurveillance and also for fighting against infections. HLA-E is usually the most conserved locus among all class I genes. However, most of the previous studies evaluating HLA-E variability sequenced only a few exons or genotyped known polymorphisms. Here we report a strategy to evaluate HLA-E variability by next-generation sequencing (NGS) that might be used to other HLA loci and present the HLA-E haplotype diversity considering the segment encoding the entire HLA-E mRNA (including 5'UTR, introns and the 3'UTR) in two African population samples, Susu from Guinea-Conakry and Lobi from Burkina Faso. Our results indicate that (a) the HLA-E gene is indeed conserved, encoding mainly two different protein molecules; (b) Africans do present several unknown HLA-E alleles presenting synonymous mutations; (c) the HLA-E 3'UTR is quite polymorphic and (d) haplotypes in the HLA-E 3'UTR are in close association with HLA-E coding alleles. NGS has proved to be an important tool on data generation for future studies evaluating variability in non-classical MHC genes.

Task complexity reveals expertise of table tennis players

AIM: The purpose of this study was to examine the effect of intensive practice in table-­tennis on perceptual, decision-­making and motor-­systems. Groups of elite (HL=11), intermediate (LL=6) and control (CC=11) performed tasks of different levels. METHODS: All subjects underwent to reaction-­time-­test and response-­time-­test consisting of a pointing task to targets placed at distinct distances (15 and 25-­cm) on the right and left sides. The ball speed test in forehand and backhand condition just for HL and LL group. RESULTS: In CC group reaction time was higher compared to HL (P< 0.05) group. In the response-­time-­test, there was a significant main effect of distance (P< 0.0001) and the tennis-­table expertise (P= 0.011). In the ball speed test the HL were constantly faster compared to the LL in both forehand stroke (P< 0.0001) and backhand stroke (P< 0.0001). Overall, the forehand stroke was significantly faster than the backhand stroke. CONCLUSION: We can conclude that table-­tennis-­players have shorter response-­times than non-­athletes and the tasks of reaction-­time and response-­time are incapable to distinguish the performance of well-­trained table tennis players of the intermediate player, but the ball speed test seems be able to do it.

MicroRNoma do carcinoma de pâncreas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Potenciais microRNAs circulantes como biomarcadores de Leucemia Mieloide Crônica - Fase Crônica: recém diagnosticada e tratada com mesilato de imatinibe

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.

Model complexity affects transient population dynamics following a dispersal event: A case study with pea aphids

Stage-structured population models predict transient population dynamics if the population deviates from the stable stage distribution. Ecologists’ interest in transient dynamics is growing because populations regularly deviate from the stable stage distribution, which can lead to transient dynamics that differ significantly from the stable stage dynamics. Because the structure of a population matrix (i.e., the number of life-history stages) can influence the predicted scale of the deviation, we explored the effect of matrix size on predicted transient dynamics and the resulting amplification of population size. First, we experimentally measured the transition rates between the different life-history stages and the adult fecundity and survival of the aphid, Acythosiphon pisum. Second, we used these data to parameterize models with different numbers of stages. Third, we compared model predictions with empirically measured transient population growth following the introduction of a single adult aphid. We find that the models with the largest number of life-history stages predicted the largest transient population growth rates, but in all models there was a considerable discrepancy between predicted and empirically measured transient peaks and a dramatic underestimation of final population sizes. For instance, the mean population size after 20 days was 2394 aphids compared to the highest predicted population size of 531 aphids; the predicted asymptotic growth rate (λmax) was consistent with the experiments. Possible explanations for this discrepancy are discussed. Includes 4 supplemental files.

Analyzing the Complexity and Reliability of Switch-Frequency-Reconfigurable Antennas Using Graph Models

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.