869 resultados para Simultaneous Roots Finding
Resumo:
In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with known multiplicities. The offered generalization does not demand calculation of derivatives of order higher than first simultaneously keeping quaternary rate of convergence which makes this method suitable for application from practical point of view.
Resumo:
Simultaneous effects of ferulic (FA) and vanillic (VA) acids on peroxidase (POD, EC 1.11.1.7) and phenylalanine ammonia-lyase (PAL, EC 4.3.1.5) activities on soybean (Glycine max (L.) MERR.) root growth were analyzed. Three-day-old seedlings were cultivated in nutrient solution containing FA or VA (0.5 mM; 1.0 mM or equimolar mixtures) for 48 h. Acting alone, both compounds (at 0.5 or 1.0 mM) decreased root length (RL), fresh weight (FW), dry weight (DW) and increased soluble POD and cell wall (CW)-bound POD activities. At 1.0 mM, FA increased (but VA decreased) the PAL activity. Acting simultaneously, the effects of the allelochemical interaction were lower than the sum of the effects of each compound tested separately, suggesting antagonism.
Resumo:
This paper illustrates a method for finding useful visual landmarks for performing simultaneous localization and mapping (SLAM). The method is based loosely on biological principles, using layers of filtering and pooling to create learned templates that correspond to different views of the environment. Rather than using a set of landmarks and reporting range and bearing to the landmark, this system maps views to poses. The challenge is to produce a system that produces the same view for small changes in robot pose, but provides different views for larger changes in pose. The method has been developed to interface with the RatSLAM system, a biologically inspired method of SLAM. The paper describes the method of learning and recalling visual landmarks in detail, and shows the performance of the visual system in real robot tests.
Resumo:
We investigated memories of room-sized spatial layouts learned by sequentially or simultaneously viewing objects from a stationary position. In three experiments, sequential viewing (one or two objects at a time) yielded subsequent memory performance that was equivalent or superior to simultaneous viewing of all objects, even though sequential viewing lacked direct access to the entire layout. This finding was replicated by replacing sequential viewing with directed viewing in which all objects were presented simultaneously and participants’ attention was externally focused on each object sequentially, indicating that the advantage of sequential viewing over simultaneous viewing may have originated from focal attention to individual object locations. These results suggest that memory representation of object-to-object relations can be constructed efficiently by encoding each object location separately, when those locations are defined within a single spatial reference system. These findings highlight the importance of considering object presentation procedures when studying spatial learning mechanisms.
Resumo:
We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.
Resumo:
A common approach to visualise multidimensional data sets is to map every data dimension to a separate visual feature. It is generally assumed that such visual features can be judged independently from each other. However, we have recently shown that interactions between features do exist [Hannus et al. 2004; van den Berg et al. 2005]. In those studies, we first determined individual colour and size contrast or colour and orientation contrast necessary to achieve a fixed level of discrimination performance in single feature search tasks. These contrasts were then used in a conjunction search task in which the target was defined by a combination of a colour and a size or a colour and an orientation. We found that in conjunction search, despite the matched feature discriminability, subjects significantly more often chose an item with the correct colour than one with correct size or orientation. This finding may have consequences for visualisation: the saliency of information coded by objects' size or orientation may change when there is a need to simultaneously search for colour that codes another aspect of the information. In the present experiment, we studied whether a colour bias can also be found in a more complex and continuous task, Subjects had to search for a target in a node-link diagram consisting of SO nodes, while their eye movements were being tracked, Each node was assigned a random colour and size (from a range of 10 possible values with fixed perceptual distances). We found that when we base the distances on the mean threshold contrasts that were determined in our previous experiments, the fixated nodes tend to resemble the target colour more than the target size (Figure 1a). This indicates that despite the perceptual matching, colour is judged with greater precision than size during conjunction search. We also found that when we double the size contrast (i.e. the distances between the 10 possible node sizes), this effect disappears (Figure 1b). Our findings confirm that the previously found decrease in salience of other features during colour conjunction search is also present in more complex (more 'visualisation- realistic') visual search tasks. The asymmetry in visual search behaviour can be compensated for by manipulating step sizes (perceptual distances) within feature dimensions. Our results therefore also imply that feature hierarchies are not completely fixed and may be adapted to the requirements of a particular visualisation. Copyright © 2005 by the Association for Computing Machinery, Inc.
Resumo:
M. Galea and Q. Shen. Simultaneous ant colony optimisation algorithms for learning linguistic fuzzy rules. A. Abraham, C. Grosan and V. Ramos (Eds.), Swarm Intelligence in Data Mining, pages 75-99.
Resumo:
Plant parasitic nematodes (PPN) locate host plants by following concentration gradients of root exudate chemicals in the soil. We present a simple method for RNA interference (RNAi)-induced knockdown of genes in tomato seedling roots, facilitating the study of root exudate composition, and PPN responses. Knockdown of sugar transporter genes, STP1 and STP2, in tomato seedlings triggered corresponding reductions of glucose and fructose, but not xylose, in collected root exudate. This corresponded directly with reduced infectivity and stylet thrusting of the promiscuous PPN Meloidogyne incognita, however we observed no impact on the infectivity or stylet thrusting of the selective Solanaceae PPN Globodera pallida. This approach can underpin future efforts to understand the early stages of plant-pathogen interactions in tomato and potentially other crop plants.
Resumo:
Order parameter profiles extracted from the NMR spectra of model membranes are a valuable source of information about their structure and molecular motions. To al1alyze powder spectra the de-Pake-ing (numerical deconvolution) ~echnique can be used, but it assumes a random (spherical) dist.ribution of orientations in the sample. Multilamellar vesicles are known to deform and orient in the strong magnetic fields of NMR magnets, producing non-spherical orientation distributions. A recently developed technique for simultaneously extracting the anisotropies of the system as well as the orientation distributions is applied to the analysis of partially magnetically oriented 31p NMR spectra of phospholipids. A mixture of synthetic lipids, POPE and POPG, is analyzed to measure distortion of multilamellar vesicles in a magnetic field. In the analysis three models describing the shape of the distorted vesicles are examined. Ellipsoids of rotation with a semiaxis ratio of about 1.14 are found to provide a good approximation of the shape of the distorted vesicles. This is in reasonable agreement with published experimental work. All three models yield clearly non-spherical orientational distributions, as well as a precise measure of the anisotropy of the chemical shift. Noise in the experimental data prevented the analysis from concluding which of the three models is the best approximation. A discretization scheme for finding stability in the algorithm is outlined
Resumo:
Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.
Resumo:
Root exudates were collected over a 27 day period from defoliated and non-defoliated Lolium perenne L. plants grown under sterile conditions in microlysimeters. Eleven individual sugars, including both aldehyde and alcohol sugars, were identified and quantified with a gas chromatograph-mass spectrometer (GC-MS). There was no change in the number of sugars present between 7 and 27 days, but the exudation of alcohol sugars decreased rapidly at about day 12. Xylose and glucose were present in the largest amounts. Defoliation initially increased the total amount of sugars in the exudates, but continuous defoliation reduced total sugar exudation by 16% and induced changes in the exudation patterns of individual sugars. Defoliation enhanced exudation of erythritol, threitol, and xylitol, reduced exudation of glucose and arabitol, but had little effect on the amounts of other sugars exuded. The more complex 6 C, 5 OH aldehyde sugars, especially glucose, showed changes earlier and to a greater extent (17 days), than the 5 C, 4 OH (xylose and ribose) and 6 C 4 OH (fucose) aldehyde groups. These findings confirm the general finding that repeated defoliation reduces the quantity of total sugars exuded, but the pattern of release of individual sugars is complex and variable.
Resumo:
O objetivo deste trabalho foi estimar parâmetros genéticos e avaliar a seleção simultânea quanto à produtividade de raízes e à adaptabilidade e estabilidade de genótipos de mandioca. Os efeitos dos genótipos foram considerados como fixos e aleatórios, e a metodologia de modelos mistos (REML/Blup) foi utilizada para estimar os parâmetros genéticos e a média harmônica do desempenho relativo dos valores genotípicos (MHPRVG), para seleção simultânea. Dez genótipos foram avaliados em delineamento de blocos ao acaso, com quatro repetições. O experimento foi realizado nos municípios de Altamira, Santarém e Santa Luzia do Pará, PA, nos anos agrícolas de 2009/2010, 2010/2011 e 2011/2012. As raízes foram colhidas 12 meses após o plantio, em todos os locais testados. A produtividade de raízes apresentou baixo coeficiente de variação genotípica (4,25%) e herdabilidade de parcelas individuais no sentido amplo (0,0424), o que resultou em baixo ganho genético. Em razão da baixa correlação genotípica (0,15), a classificação dos genótipos quanto à produtividade de raízes variou de acordo com o ambiente. Os genótipos CPATU 060, CPATU 229 e CPATU 404 destacaram-se quanto à produtividade, adaptabilidade e estabilidade.
Resumo:
Integrated choice and latent variable (ICLV) models represent a promising new class of models which merge classic choice models with the structural equation approach (SEM) for latent variables. Despite their conceptual appeal, applications of ICLV models in marketing remain rare. We extend previous ICLV applications by first estimating a multinomial choice model and, second, by estimating hierarchical relations between latent variables. An empirical study on travel mode choice clearly demonstrates the value of ICLV models to enhance the understanding of choice processes. In addition to the usually studied directly observable variables such as travel time, we show how abstract motivations such as power and hedonism as well as attitudes such as a desire for flexibility impact on travel mode choice. Furthermore, we show that it is possible to estimate such a complex ICLV model with the widely available structural equation modeling package Mplus. This finding is likely to encourage more widespread application of this appealing model class in the marketing field.
Resumo:
This paper illustrates a method for finding useful visual landmarks for performing simultaneous localization and mapping (SLAM). The method is based loosely on biological principles, using layers of filtering and pooling to create learned templates that correspond to different views of the environment. Rather than using a set of landmarks and reporting range and bearing to the landmark, this system maps views to poses. The challenge is to produce a system that produces the same view for small changes in robot pose, but provides different views for larger changes in pose. The method has been developed to interface with the RatSLAM system, a biologically inspired method of SLAM. The paper describes the method of learning and recalling visual landmarks in detail, and shows the performance of the visual system in real robot tests.