977 resultados para Feature space


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Large Magellanic Cloud (LMC) has a rich star cluster system spanning a wide range of ages and masses. One striking feature of the LMC cluster system is the existence of an age gap between 3 and 10 Gyr. But this feature is not clearly seen among field stars. Three LMC fields containing relatively poor and sparse clusters whose integrated colours are consistent with those of intermediate-age simple stellar populations have been imaged in BVI with the Optical Imager (SOI) at the Southern Telescope for Astrophysical Research (SOAR). A total of six clusters, five of them with estimated initial masses M < 104 M(circle dot), were studied in these fields. Photometry was performed and colour-magnitude diagrams (CMDs) were built using standard point spread function fitting methods. The faintest stars measured reach V similar to 23. The CMD was cleaned from field contamination by making use of the three-dimensional colour and magnitude space available in order to select stars in excess relative to the field. A statistical CMD comparison method was developed for this purpose. The subtraction method has proven to be successful, yielding cleaned CMDs consistent with a simple stellar population. The intermediate-age candidates were found to be the oldest in our sample, with ages between 1 and 2 Gyr. The remaining clusters found in the SOAR/SOI have ages ranging from 100 to 200 Myr. Our analysis has conclusively shown that none of the relatively low-mass clusters studied by us belongs to the LMC age gap.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Colour-magnitude diagrams (CMDs) of the Small Magellanic Cloud (SMC) star cluster NGC 419, derived from Hubble Space Telescope (HST)/Advanced Camera for Surveys (ACS) data, reveal a well-delineated secondary clump located below the classical compact red clump typical of intermediate-age populations. We demonstrate that this feature belongs to the cluster itself, rather than to the underlying SMC field. Then, we use synthetic CMDs to show that it corresponds very well to the secondary clump predicted to appear as a result of He-ignition in stars just massive enough to avoid e(-)-degeneracy settling in their H-exhausted cores. The main red clump instead is made of the slightly less massive stars which passed through e(-) degeneracy and ignited He at the tip of the red giant branch. In other words, NGC 419 is the rare snapshot of a cluster while undergoing the fast transition from classical to degenerate H-exhausted cores. At this particular moment of a cluster`s life, the colour distance between the main-sequence turn-off and the red clump(s) depends sensitively on the amount of convective core overshooting, Lambda(c). By coupling measurements of this colour separation with fits to the red clump morphology, we are able to estimate simultaneously the cluster mean age (1.35(-0.04)(+0.11) Gyr) and overshooting efficiency (Lambda(c) = 0.47(-0.04)(+0.14)). Therefore, clusters like NGC 419 may constitute important marks in the age scale of intermediate-age populations. After eye inspection of other CMDs derived from HST/ACS data, we suggest that the same secondary clump may also be present in the Large Magellanic Cloud clusters NGC 1751, 1783, 1806, 1846, 1852 and 1917.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We have developed an inherently incremental technique (incBoard) that maintains a coherent disposition of elements from a dynamic multidimensional data set on a 2D grid as the set changes. Here, we introduce a novel layout that uses pairwise similarity from grid neighbors, as defined in incBoard, to reposition elements on the visual space, free from constraints imposed by the grid. The board continues to be updated and can be displayed alongside the new space. As similar items are placed together, while dissimilar neighbors are moved apart, it supports users in the identification of clusters and subsets of related elements. Densely populated areas identified in the incSpace can be efficiently explored with the corresponding incBoard visualization, which is not susceptible to occlusion. The solution remains inherently incremental and maintains a coherent disposition of elements, even for fully renewed sets. The algorithm considers relative positions for the initial placement of elements, and raw dissimilarity to fine tune the visualization. It has low computational cost, with complexity depending only on the size of the currently viewed subset, V. Thus, a data set of size N can be sequentially displayed in O(N) time, reaching O(N (2)) only if the complete set is simultaneously displayed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a filter-based algorithm for feature selection. The filter is based on the partitioning of the set of features into clusters. The number of clusters, and consequently the cardinality of the subset of selected features, is automatically estimated from data. The computational complexity of the proposed algorithm is also investigated. A variant of this filter that considers feature-class correlations is also proposed for classification problems. Empirical results involving ten datasets illustrate the performance of the developed algorithm, which in general has obtained competitive results in terms of classification accuracy when compared to state of the art algorithms that find clusters of features. We show that, if computational efficiency is an important issue, then the proposed filter May be preferred over their counterparts, thus becoming eligible to join a pool of feature selection algorithms to be used in practice. As an additional contribution of this work, a theoretical framework is used to formally analyze some properties of feature selection methods that rely on finding clusters of features. (C) 2011 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Identifying the correct sense of a word in context is crucial for many tasks in natural language processing (machine translation is an example). State-of-the art methods for Word Sense Disambiguation (WSD) build models using hand-crafted features that usually capturing shallow linguistic information. Complex background knowledge, such as semantic relationships, are typically either not used, or used in specialised manner, due to the limitations of the feature-based modelling techniques used. On the other hand, empirical results from the use of Inductive Logic Programming (ILP) systems have repeatedly shown that they can use diverse sources of background knowledge when constructing models. In this paper, we investigate whether this ability of ILP systems could be used to improve the predictive accuracy of models for WSD. Specifically, we examine the use of a general-purpose ILP system as a method to construct a set of features using semantic, syntactic and lexical information. This feature-set is then used by a common modelling technique in the field (a support vector machine) to construct a classifier for predicting the sense of a word. In our investigation we examine one-shot and incremental approaches to feature-set construction applied to monolingual and bilingual WSD tasks. The monolingual tasks use 32 verbs and 85 verbs and nouns (in English) from the SENSEVAL-3 and SemEval-2007 benchmarks; while the bilingual WSD task consists of 7 highly ambiguous verbs in translating from English to Portuguese. The results are encouraging: the ILP-assisted models show substantial improvements over those that simply use shallow features. In addition, incremental feature-set construction appears to identify smaller and better sets of features. Taken together, the results suggest that the use of ILP with diverse sources of background knowledge provide a way for making substantial progress in the field of WSD.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the horospherical geometry of submanifolds in hyperbolic space. The main result is a formula for the total absolute horospherical curvature of M, which implies, for the horospherical geometry, the analogues of classical inequalities of the Euclidean Geometry. We prove the horospherical Chern-Lashof inequality for surfaces in 3-space and the horospherical Fenchel and Fary-Milnor`s theorems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study horo-tight immersions of manifolds into hyperbolic spaces. The main result gives several characterizations of horo-tightness of spheres, answering a question proposed by Cecil and Ryan. For instance, we prove that a sphere is horo-tight if and only if it is tight in the hyperbolic sense. For codimension bigger than one, it follows that horo-tight spheres in hyperbolic space are metric spheres. We also prove that horo-tight hyperspheres are characterized by the property that both of its total absolute horospherical curvatures attend their minimum value. We also introduce the notion of weak horo-tightness: an immersion is weak horo-tight if only one of its total absolute curvature attends its minimum. We prove a characterization theorem for weak horo-tight hyperspheres.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the geometry of 3-manifolds generically embedded in R(n) by means of the analysis of the singularities of the distance-squared and height functions on them. We describe the local structure of the discriminant (associated to the distribution of asymptotic directions), the ridges and the flat ridges.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Public genealogical databases are becoming increasingly populated with historical data and records of the current population`s ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree`s structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user`s ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider incompressible Stokes flow with an internal interface at which the pressure is discontinuous, as happens for example in problems involving surface tension. We assume that the mesh does not follow the interface, which makes classical interpolation spaces to yield suboptimal convergence rates (typically, the interpolation error in the L(2)(Omega)-norm is of order h(1/2)). We propose a modification of the P(1)-conforming space that accommodates discontinuities at the interface without introducing additional degrees of freedom or modifying the sparsity pattern of the linear system. The unknowns are the pressure values at the vertices of the mesh and the basis functions are computed locally at each element, so that the implementation of the proposed space into existing codes is straightforward. With this modification, numerical tests show that the interpolation order improves to O(h(3/2)). The new pressure space is implemented for the stable P(1)(+)/P(1) mini-element discretization, and for the stabilized equal-order P(1)/P(1) discretization. Assessment is carried out for Poiseuille flow with a forcing surface and for a static bubble. In all cases the proposed pressure space leads to improved convergence orders and to more accurate results than the standard P(1) space. In addition, two Navier-Stokes simulations with moving interfaces (Rayleigh-Taylor instability and merging bubbles) are reported to show that the proposed space is robust enough to carry out realistic simulations. (c) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study properties of finitely determined corank 2 quasihomogeneous map germs f: (C(2), 0) -> (C(3), 0). Examples and counter examples of such map germs are presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a parallel hardware architecture for image feature detection based on the Scale Invariant Feature Transform algorithm and applied to the Simultaneous Localization And Mapping problem. The work also proposes specific hardware optimizations considered fundamental to embed such a robotic control system on-a-chip. The proposed architecture is completely stand-alone; it reads the input data directly from a CMOS image sensor and provides the results via a field-programmable gate array coupled to an embedded processor. The results may either be used directly in an on-chip application or accessed through an Ethernet connection. The system is able to detect features up to 30 frames per second (320 x 240 pixels) and has accuracy similar to a PC-based implementation. The achieved system performance is at least one order of magnitude better than a PC-based solution, a result achieved by investigating the impact of several hardware-orientated optimizations oil performance, area and accuracy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the bi-dimensional parameter space of an impact-pair system, shrimp-shaped periodic windows are embedded in chaotic regions. We show that a weak periodic forcing generates new periodic windows near the unperturbed one with its shape and periodicity. Thus, the new periodic windows are parameter range extensions for which the controlled periodic oscillations substitute the chaotic oscillations. We identify periodic and chaotic attractors by their largest Lyapunov exponents. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this Letter we present soliton solutions of two coupled nonlinear Schrodinger equations modulated in space and time. The approach allows us to obtain solitons for a large variety of solutions depending on the nonlinearity and potential profiles. As examples we show three cases with soliton solutions: a solution for the case of a potential changing from repulsive to attractive behavior, and the other two solutions corresponding to localized and delocalized nonlinearity terms, respectively. (C) 2010 Elsevier B.V. All rights reserved.