932 resultados para efficient algorithm
Resumo:
The paper deals with the development and application of the methodology for automatic mapping of pollution/contamination data. General Regression Neural Network (GRNN) is considered in detail and is proposed as an efficient tool to solve this problem. The automatic tuning of isotropic and an anisotropic GRNN model using cross-validation procedure is presented. Results are compared with k-nearest-neighbours interpolation algorithm using independent validation data set. Quality of mapping is controlled by the analysis of raw data and the residuals using variography. Maps of probabilities of exceeding a given decision level and ?thick? isoline visualization of the uncertainties are presented as examples of decision-oriented mapping. Real case study is based on mapping of radioactively contaminated territories.
Resumo:
Este trabajo presenta un Algoritmo Genético (GA) del problema de secuenciar unidades en una línea de producción. Se tiene en cuenta la posibilidad de cambiar la secuencia de piezas mediante estaciones con acceso a un almacén intermedio o centralizado. El acceso al almacén además está restringido, debido al tamaño de las piezas.AbstractThis paper presents a Genetic Algorithm (GA) for the problem of sequencing in a mixed model non-permutation flowshop. Resequencingis permitted where stations have access to intermittent or centralized resequencing buffers. The access to a buffer is restricted by the number of available buffer places and the physical size of the products.
Resumo:
Many engineering problems that can be formulatedas constrained optimization problems result in solutionsgiven by a waterfilling structure; the classical example is thecapacity-achieving solution for a frequency-selective channel.For simple waterfilling solutions with a single waterlevel and asingle constraint (typically, a power constraint), some algorithmshave been proposed in the literature to compute the solutionsnumerically. However, some other optimization problems result insignificantly more complicated waterfilling solutions that includemultiple waterlevels and multiple constraints. For such cases, itmay still be possible to obtain practical algorithms to evaluate thesolutions numerically but only after a painstaking inspection ofthe specific waterfilling structure. In addition, a unified view ofthe different types of waterfilling solutions and the correspondingpractical algorithms is missing.The purpose of this paper is twofold. On the one hand, itoverviews the waterfilling results existing in the literature from aunified viewpoint. On the other hand, it bridges the gap betweena wide family of waterfilling solutions and their efficient implementationin practice; to be more precise, it provides a practicalalgorithm to evaluate numerically a general waterfilling solution,which includes the currently existing waterfilling solutions andothers that may possibly appear in future problems.
Resumo:
The objective of this work was to evaluate the contribution of efficient nitrogen-fixing rhizobial strains to grain yield of new cowpea cultivars, indicated for cultivation in the Brazilian Semiarid region, in the sub-medium of the São Francisco River Valley. Two experiments were set up at the irrigated perimeters of Mandacaru (Juazeiro, state of Bahia) and Bebedouro (Petrolina, state of Pernambuco). The treatments consisted of single inoculation of five rhizobial strains - BR 3267, BR 3262, INPA 03-11B, UFLA 03-84 (Bradyrhizobiumsp.), and BR 3299T(Microvirga vignae) -, besides a treatment with nitrogen and a control without inoculation or N application. The following cowpea cultivars were evaluated: BRS Pujante, BRS Tapaihum, BRS Carijó, and BRS Acauã. A randomized complete block design, with four replicates, was used. Inoculated plants showed similar grain yield to the one observed with plants fertilized with 80 kg ha-1 N. The cultivars BRS Tapaihum and BRS Pujante stood out in grain yield and protein contents when inoculated, showing their potential for cultivation in the sub-medium of the São Francisco River Valley.
Resumo:
Buccal swabs have recently been used as a minimally invasive sampling method in genetic studies of wild populations, including amphibian species. Yet it is not known to date what is the level of reliability for microsatellite genotypes obtained using such samples. Allelic dropout and false alleles may affect the genotyping derived from buccal samples. Here we quantified the success of microsatellite amplification and the rates of genotyping errors using buccal swabs in two amphibian species, the Alpine newt Triturus alpestris and the Green tree frog Hyla arborea, and we estimated two important parameters for downstream analyses, namely the number of repetitions required to achieve typing reliability and the probability of identity among genotypes. Amplification success was high, and only one locus tested required two to three repetitions to achieve reliable genotypes, showing that buccal swabbing is a very efficient approach allowing good quality DNA retrieval. This sampling method which allows avoiding the controversial toe-clipping will likely prove very useful in the context of amphibian conservation.
Resumo:
Tämän tutkielman tavoitteena on selvittää Venäjän, Slovakian, Tsekin, Romanian, Bulgarian, Unkarin ja Puolan osakemarkkinoiden heikkojen ehtojen tehokkuutta. Tämä tutkielma on kvantitatiivinen tutkimus ja päiväkohtaiset indeksin sulkemisarvot kerättiin Datastreamin tietokannasta. Data kerättiin pörssien ensimmäisestä kaupankäyntipäivästä aina vuoden 2006 elokuun loppuun saakka. Analysoinnin tehostamiseksi dataa tutkittiin koko aineistolla, sekä kahdella aliperiodilla. Osakemarkkinoiden tehokkuutta on testattu neljällä tilastollisella metodilla, mukaan lukien autokorrelaatiotesti ja epäparametrinen runs-testi. Tavoitteena on myös selvittääesiintyykö kyseisillä markkinoilla viikonpäiväanomalia. Viikonpäiväanomalian esiintymistä tutkitaan käyttämällä pienimmän neliösumman menetelmää (OLS). Viikonpäiväanomalia on löydettävissä kaikilta edellä mainituilta osakemarkkinoilta paitsi Tsekin markkinoilta. Merkittävää, positiivista tai negatiivista autokorrelaatiota, on löydettävissä kaikilta osakemarkkinoilta, myös Ljung-Box testi osoittaa kaikkien markkinoiden tehottomuutta täydellä periodilla. Osakemarkkinoiden satunnaiskulku hylätään runs-testin perusteella kaikilta muilta paitsi Slovakian osakemarkkinoilla, ainakin tarkastellessa koko aineistoa tai ensimmäistä aliperiodia. Aineisto ei myöskään ole normaalijakautunut minkään indeksin tai aikajakson kohdalla. Nämä havainnot osoittavat, että kyseessä olevat markkinat eivät ole heikkojen ehtojen mukaan tehokkaita
Resumo:
Qualitative differences in strategy selection during foraging in a partially baited maze were assessed in young and old rats. The baited and non-baited arms were at a fixed position in space and marked by a specific olfactory cue. The senescent rats did more re-entries during the first four-trial block but were more rapid than the young rats in selecting the reinforced arms during the first visits. Dissociation between the olfactory spatial cue reference by rotating the maze revealed that only few old subjects relied on olfactory cues to select the baited arms and the remainder relied mainly on the visuo-spatial cues.
Resumo:
In this paper, a new two-dimensional shear deformable beam element based on the absolute nodal coordinate formulation is proposed. The nonlinear elastic forces of the beam element are obtained using a continuum mechanics approach without employing a local element coordinate system. In this study, linear polynomials are used to interpolate both the transverse and longitudinal components of the displacement. This is different from other absolute nodal-coordinate-based beam elements where cubic polynomials are used in the longitudinal direction. The accompanying defects of the phenomenon known as shear locking are avoided through the adoption of selective integration within the numerical integration method. The proposed element is verified using several numerical examples, and the results are compared to analytical solutions and the results for an existing shear deformable beam element. It is shown that by using the proposed element, accurate linear and nonlinear static deformations, as well as realistic dynamic behavior, can be achieved with a smaller computational effort than by using existing shear deformable two-dimensional beam elements.
Resumo:
Adaptació de l'algorisme de Kumar per resoldre sistemes d'equacions amb matrius de Toeplitz sobre els reals a cossos finits en un temps 0 (n log n).
Resumo:
La principal motivació d'aquest treball ha estat implementar l'algoritme Rijndael-AES en un full Sage-math, paquet de software matemàtic de lliure distribució i en actual desenvolupament, aprofitant les seves eines i funcionalitats integrades.
Resumo:
The past few decades have seen a considerable increase in the number of parallel and distributed systems. With the development of more complex applications, the need for more powerful systems has emerged and various parallel and distributed environments have been designed and implemented. Each of the environments, including hardware and software, has unique strengths and weaknesses. There is no single parallel environment that can be identified as the best environment for all applications with respect to hardware and software properties. The main goal of this thesis is to provide a novel way of performing data-parallel computation in parallel and distributed environments by utilizing the best characteristics of difference aspects of parallel computing. For the purpose of this thesis, three aspects of parallel computing were identified and studied. First, three parallel environments (shared memory, distributed memory, and a network of workstations) are evaluated to quantify theirsuitability for different parallel applications. Due to the parallel and distributed nature of the environments, networks connecting the processors in these environments were investigated with respect to their performance characteristics. Second, scheduling algorithms are studied in order to make them more efficient and effective. A concept of application-specific information scheduling is introduced. The application- specific information is data about the workload extractedfrom an application, which is provided to a scheduling algorithm. Three scheduling algorithms are enhanced to utilize the application-specific information to further refine their scheduling properties. A more accurate description of the workload is especially important in cases where the workunits are heterogeneous and the parallel environment is heterogeneous and/or non-dedicated. The results obtained show that the additional information regarding the workload has a positive impact on the performance of applications. Third, a programming paradigm for networks of symmetric multiprocessor (SMP) workstations is introduced. The MPIT programming paradigm incorporates the Message Passing Interface (MPI) with threads to provide a methodology to write parallel applications that efficiently utilize the available resources and minimize the overhead. The MPIT allows for communication and computation to overlap by deploying a dedicated thread for communication. Furthermore, the programming paradigm implements an application-specific scheduling algorithm. The scheduling algorithm is executed by the communication thread. Thus, the scheduling does not affect the execution of the parallel application. Performance results achieved from the MPIT show that considerable improvements over conventional MPI applications are achieved.
Resumo:
This thesis studies gray-level distance transforms, particularly the Distance Transform on Curved Space (DTOCS). The transform is produced by calculating distances on a gray-level surface. The DTOCS is improved by definingmore accurate local distances, and developing a faster transformation algorithm. The Optimal DTOCS enhances the locally Euclidean Weighted DTOCS (WDTOCS) with local distance coefficients, which minimize the maximum error from the Euclideandistance in the image plane, and produce more accurate global distance values.Convergence properties of the traditional mask operation, or sequential localtransformation, and the ordered propagation approach are analyzed, and compared to the new efficient priority pixel queue algorithm. The Route DTOCS algorithmdeveloped in this work can be used to find and visualize shortest routes between two points, or two point sets, along a varying height surface. In a digital image, there can be several paths sharing the same minimal length, and the Route DTOCS visualizes them all. A single optimal path can be extracted from the route set using a simple backtracking algorithm. A new extension of the priority pixel queue algorithm produces the nearest neighbor transform, or Voronoi or Dirichlet tessellation, simultaneously with the distance map. The transformation divides the image into regions so that each pixel belongs to the region surrounding the reference point, which is nearest according to the distance definition used. Applications and application ideas for the DTOCS and its extensions are presented, including obstacle avoidance, image compression and surface roughness evaluation.
Resumo:
Background: Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA) models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Results: Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC) models that extend the power-law formalism to deal with saturation and cooperativity. Conclusions: Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.
Resumo:
BACKGROUND & AIMS: The hepatitis C virus (HCV) NS3-4A protease is essential for the HCV life cycle and a prime target of antiviral treatment strategies. Protease inhibitors, however, are limited by emergence of resistance-associated amino acid variants (RAVs). The capacity to cleave and inactivate mitochondrial antiviral-signaling protein (MAVS) in the RIG-I-signaling pathway is a cardinal feature of NS3-4A, by which HCV blocks induction of interferon-(IFN)-β, thereby promoting viral persistence. Here, we aimed to investigate the impact of NS3-4A RAVs on MAVS cleavage. METHODS: The impact of NS3-4A RAVs on MAVS cleavage was assessed using immunoblot analyses, luciferase reporter assays and molecular dynamics simulations to study the underlying molecular principles. IFN-β was quantified in serum from patients with different NS3-4A RAVs. RESULTS: We show that macrocyclic NS3-4A RAVS with substitutions at residue D168 of the protease result in an increased capacity of NS3-4A to cleave MAVS and suppress IFN-β induction compared with a comprehensive panel of RAVs and wild type HCV. Mechanistically, we show the reconstitution of a tight network of electrostatic interactions between protease and the peptide substrate that allows much stronger binding of MAVS to D168 RAVs than to the wild-type protease. Accordingly, we could show IFN-β serum levels to be lower in patients with treatment failure due to the selection of D168 variants compared to R155 RAVs. CONCLUSIONS: Our data constitutes a proof of concept that the selection of RAVs against specific classes of direct antivirals can lead to the predominance of viral variants with possibly adverse pathogenic characteristics.
Resumo:
ZnO nanorods grown by both high temperature vapour phase transport and low temperature chemical bath deposition are very promising sources for UV third harmonic generation. Material grown by both methods show comparable efficiencies, in both cases an order of magnitude higher than surface third harmonic generation at the quartz-air interface of a bare quartz substrate. This result is in stark contrast to the linear optical properties of ZnO nanorods grown by these two methods, which show vastly different PL efficiencies. The third harmonic generated signal is analysed using intensity dependent measurements and interferometric frequency resolved optical gating, allowing extraction of the laser pulse parameters. The comparable levels of efficiency of ZnO grown by these very different methods as sources for third harmonic UV generation provides a broad suite of possible growth methods to suit various substrates, coverage and scalability requirements. Potential application areas range from interferometric frequency resolved optical gating characterization of few cycle fs pulses to single cell UV irradiation for biophysical studies.