21 resultados para Weak Greedy Algorithms
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
A detailed study was performed for a sample of low-mass pre-main-sequence (PMS) stars, previously identified as weak-line T Tauri stars, which are compared to members of the Tucanae and Horologium Associations. Aiming to verify if there is any pattern of abundances when comparing the young stars at different phases, we selected objects in the range from 1 to 100 Myr, which covers most of PMS evolution. High-resolution optical spectra were acquired at European Southern Observatory and Observatorio do Pico dos Dias. The stellar fundamental parameters effective temperature and gravity were calculated by excitation and ionization equilibria of iron absorption lines. Chemical abundances were obtained via equivalent width calculations and spectral synthesis for 44 per cent of the sample, which shows metallicities within 0.5 dex solar. A classification was developed based on equivalent width of Li I 6708 angstrom and Ha lines and spectral types of the studied stars. This classification allowed a separation of the sample into categories that correspond to different evolutive stages in the PMS. The position of these stars in the Hertzsprung-Russell diagram was also inspected in order to estimate their ages and masses. Among the studied objects, it was verified that our sample actually contains seven weak-line T Tauri stars, three are Classical T Tauri, 12 are Fe/Ge PMS stars and 21 are post-T Tauri or young main-sequence stars. An estimation of circumstellar luminosity was obtained using a disc model to reproduce the observed spectral energy distribution. Most of the stars show low levels of circumstellar emission, corresponding to less than 30 per cent of the total emission.
Resumo:
Based on our previous work, we investigate here the effects on the wind and magnetospheric structures of weak-lined T Tauri stars due to a misalignment between the axis of rotation of the star and its magnetic dipole moment vector. In such a configuration, the system loses the axisymmetry presented in the aligned case, requiring a fully three-dimensional (3D) approach. We perform 3D numerical magnetohydrodynamic simulations of stellar winds and study the effects caused by different model parameters, namely the misalignment angle theta(t), the stellar period of rotation, the plasma-beta, and the heating index.. Our simulations take into account the interplay between the wind and the stellar magnetic field during the time evolution. The system reaches a periodic behavior with the same rotational period of the star. We show that the magnetic field lines present an oscillatory pattern. Furthermore, we obtain that by increasing theta(t), the wind velocity increases, especially in the case of strong magnetic field and relatively rapid stellar rotation. Our 3D, time-dependent wind models allow us to study the interaction of a magnetized wind with a magnetized extrasolar planet. Such interaction gives rise to reconnection, generating electrons that propagate along the planet`s magnetic field lines and produce electron cyclotron radiation at radio wavelengths. The power released in the interaction depends on the planet`s magnetic field intensity, its orbital radius, and on the stellar wind local characteristics. We find that a close-in Jupiter-like planet orbiting at 0.05 AU presents a radio power that is similar to 5 orders of magnitude larger than the one observed in Jupiter, which suggests that the stellar wind from a young star has the potential to generate strong planetary radio emission that could be detected in the near future with LOFAR. This radio power varies according to the phase of rotation of the star. For three selected simulations, we find a variation of the radio power of a factor 1.3-3.7, depending on theta(t). Moreover, we extend the investigation done in Vidotto et al. and analyze whether winds from misaligned stellar magnetospheres could cause a significant effect on planetary migration. Compared to the aligned case, we show that the timescale tau(w) for an appreciable radial motion of the planet is shorter for larger misalignment angles. While for the aligned case tau(w) similar or equal to 100 Myr, for a stellar magnetosphere tilted by theta(t) = 30 degrees, tau(w) ranges from similar to 40 to 70 Myr for a planet located at a radius of 0.05 AU. Further reduction on tau(w) might occur for even larger misalignment angles and/or different wind parameters.
Resumo:
A numerous population of weak line galaxies (WLGs) is often left out of statistical studies on emission-line galaxies (ELGs) due to the absence of an adequate classification scheme, since classical diagnostic diagrams, such as [O iii]/H beta versus [N ii]/H alpha (the BPT diagram), require the measurement of at least four emission lines. This paper aims to remedy this situation by transposing the usual divisory lines between star-forming (SF) galaxies and active galactic nuclei (AGN) hosts and between Seyferts and LINERs to diagrams that are more economical in terms of line quality requirements. By doing this, we rescue from the classification limbo a substantial number of sources and modify the global census of ELGs. More specifically, (1) we use the Sloan Digital Sky Survey Data Release 7 to constitute a suitable sample of 280 000 ELGs, one-third of which are WLGs. (2) Galaxies with strong emission lines are classified using the widely applied criteria of Kewley et al., Kauffmann et al. and Stasinska et al. to distinguish SF galaxies and AGN hosts and Kewley et al. to distinguish Seyferts from LINERs. (3) We transpose these classification schemes to alternative diagrams keeping [N ii]/H alpha as a horizontal axis, but replacing H beta by a stronger line (H alpha or [O ii]), or substituting the ionization-level sensitive [O iii]/H beta ratio with the equivalent width of H alpha (W(H alpha)). Optimized equations for the transposed divisory lines are provided. (4) We show that nothing significant is lost in the translation, but that the new diagrams allow one to classify up to 50 per cent more ELGs. (5) Introducing WLGs in the census of galaxies in the local Universe increases the proportion of metal-rich SF galaxies and especially LINERs. In the course of this analysis, we were led to make the following points. (i) The Kewley et al. BPT line for galaxy classification is generally ill-used. (ii) Replacing [O iii]/H beta by W(H alpha) in the classification introduces a change in the philosophy of the distinction between LINERs and Seyferts, but not in its results. Because the W(H alpha) versus [N ii]/H alpha diagram can be applied to the largest sample of ELGs without loss of discriminating power between Seyferts and LINERs, we recommend its use in further studies. (iii) The dichotomy between Seyferts and LINERs is washed out by WLGs in the BPT plane, but it subsists in other diagnostic diagrams. This suggests that the right wing in the BPT diagram is indeed populated by at least two classes, tentatively identified with bona fide AGN and `retired` galaxies that have stopped forming stars and are ionized by their old stellar populations.
Resumo:
By means of numerical simulations, we investigate magnetized stellar winds of pre-main-sequence stars. In particular, we analyze under which circumstances these stars will present elongated magnetic features (e.g., helmet streamers, slingshot prominences, etc). We focus on weak-lined T Tauri stars, as the presence of the tenuous accretion disk is not expected to have strong influence on the structure of the stellar wind. We show that the plasma-beta parameter (the ratio of thermal to magnetic energy densities) is a decisive factor in defining the magnetic configuration of the stellar wind. Using initial parameters within the observed range for these stars, we show that the coronal magnetic field configuration can vary between a dipole-like configuration and a configuration with strong collimated polar lines and closed streamers at the equator (multicomponent configuration for the magnetic field). We show that elongated magnetic features will only be present if the plasma-beta parameter at the coronal base is beta(0) << 1. Using our self-consistent three-dimensional magnetohydrodynamics model, we estimate for these stellar winds the timescale of planet migration due to drag forces exerted by the stellar wind on a hot-Jupiter. In contrast to the findings of Lovelace et al., who estimated such timescales using the Weber and Davis model, our model suggests that the stellar wind of these multicomponent coronae are not expected to have significant influence on hot-Jupiters migration. Further simulations are necessary to investigate this result under more intense surface magnetic field strengths (similar to 2-3 kG) and higher coronal base densities, as well as in a tilted stellar magnetosphere.
Resumo:
A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.
Resumo:
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.
Resumo:
Model trees are a particular case of decision trees employed to solve regression problems. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed. Moreover, model trees present an acceptable level of predictive performance in comparison to most techniques used for solving regression problems. Since generating the optimal model tree is an NP-Complete problem, traditional model tree induction algorithms make use of a greedy top-down divide-and-conquer strategy, which may not converge to the global optimal solution. In this paper, we propose a novel algorithm based on the use of the evolutionary algorithms paradigm as an alternate heuristic to generate model trees in order to improve the convergence to globally near-optimal solutions. We call our new approach evolutionary model tree induction (E-Motion). We test its predictive performance using public UCI data sets, and we compare the results to traditional greedy regression/model trees induction algorithms, as well as to other evolutionary approaches. Results show that our method presents a good trade-off between predictive performance and model comprehensibility, which may be crucial in many machine learning applications. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
We compute one- and two-nucleon kinetic-energy spectra and opening-angle distributions for the nonmesonic weak decay of several hypernuclei, and compare our results with some recent data. The decay dynamics is described by transition potentials of the one-meson-exchange type, and the nuclear structure aspects by two versions of the independent-particle shell model (IPSM). In version IPSM-a, the bole states are treated as stationary, while in version IPSM-b the deep-hole ones are considered to be quasi-stationary and are described by Breit-Wigner distributions.
Resumo:
To comprehend the recent Brookhaven National Laboratory experiment E788 on (4)(Lambda)He, we have outlined a simple theoretical framework. based on the independent-particle shell model, for the one-nucleon-induced nonmesonic weak decay spectra. Basically, the shapes of all the spectra are tailored by the kinematics of the corresponding phase space, depending very weakly on the dynamics, which is gauged here by the one-meson-exchange potential. In spite of the straightforwardness of the approach a good agreement with data is achieved. This might be an indication that the final-state-interactions and the two-nucleon induced processes are not very important in the decay of this hypernucleus. We have also found that the pi + K exchange potential with soft vertex-form-factor cutoffs (Lambda(pi) approximate to 0.7 GeV, Lambda(K) approximate to 0.9 GeV), is able to account simultaneously for the available experimental data related to Gamma(p) and Gamma(n) for (4)(Lambda)H, (4)(Lambda)H, and (5)(Lambda)H. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
The anomalous alternating magnetoresistivity in HgTe quantum wells with thicknesses of 5.8 and 8.3 nm, i.e., near the transition from the direct band spectrum to an inverted spectrum, has been revealed and analyzed. It has been shown that the revealed anomalous alternating magnetoresistivity in wells with an inverted spectrum is well described by the theory developed by S.V. Iordanskii et al. [JETP Lett. 60, 206 (1994)] and W. Knap et al. [Phys. Rev. B 53, 3912 (1996)]. A detailed comparison of the experimental data with the theory indicates the presence of only the cubic term in the spin splitting of the electronic spectrum. The applicability conditions of the mentioned theory are not satisfied in a well with a direct gap and, for this reason, such a certain conclusion is impossible. The results indicate the existence of a strong spin-orbit interaction in symmetric HgTe quantum wells near the topological transition.
Resumo:
In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.