814 resultados para product feature taxonomy
Resumo:
Flies of the tribe Muscini (Diptera, Muscidae) are worldwide in distribution and are represented by some 350 species in 18 genera. The present study provides an identification key and diagnoses for all the genera of world Muscini: Biopyrellia Townsend, Curranosia Paterson, Dasyphora Robineau-Desvoidy, Deltotus Seguy, Hennigmyia Peris, Mesembrina Meigen, Mitroplatia Enderlein, Morellia Robineau-Desvoidy, Musca Linnaeus, Myiophaea Enderlein, Neomyia Walker, Neorypellia Pont, Polietes Rondani, Polietina Schnabl & Dziedzicki, Pyrellia Robineau-Desvoidy, Pyrellina Malloch, Sarcopromusca Townsend, Ziminellia Nihei & de Carvalho. Most infrageneric taxa are also represented, namely, the sub-genera of Dasyphora and Morellia. Comments on phylogeny support (whenever pertinent) and the major references containing revisions and regional identification keys to species are provided for each genus and subgenus.
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.
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.
Indecomposable and noncrossed product division algebras over function fields of smooth p-adic curves
Resumo:
We construct indecomposable and noncrossed product division algebras over function fields of connected smooth curves X over Z(p). This is done by defining an index preserving morphism s: Br(<(K(X))over cap>)` --> Br(K(X))` which splits res : Br(K (X)) --> Br(<(K(X))over cap>), where <(K(X))over cap> is the completion of K (X) at the special fiber, and using it to lift indecomposable and noncrossed product division algebras over <(K(X))over cap>. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
We introduce a flexible technique for interactive exploration of vector field data through classification derived from user-specified feature templates. Our method is founded on the observation that, while similar features within the vector field may be spatially disparate, they share similar neighborhood characteristics. Users generate feature-based visualizations by interactively highlighting well-accepted and domain specific representative feature points. Feature exploration begins with the computation of attributes that describe the neighborhood of each sample within the input vector field. Compilation of these attributes forms a representation of the vector field samples in the attribute space. We project the attribute points onto the canonical 2D plane to enable interactive exploration of the vector field using a painting interface. The projection encodes the similarities between vector field points within the distances computed between their associated attribute points. The proposed method is performed at interactive rates for enhanced user experience and is completely flexible as showcased by the simultaneous identification of diverse feature types.
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.
Resumo:
Neutron multiplicities for several targets and spallation products of proton-induced reactions in thin targets of interest to an accelerator-driven system obtained with the CRISP code have been reported. This code is a Monte Carlo calculation that simulates the intranuclear cascade and evaporationl fission competition processes. Results are compared with experimental data, and agreement between each other can be considered quite satisfactory in a very broad energy range of incitant particles and different targets.
Resumo:
We provide necessary and sufficient conditions for states to have an arbitrarily small uncertainty product of the azimuthal angle phi and its canonical moment L(z). We illustrate our results with analytical examples.
Resumo:
The Sznajd model (SM) has been employed with success in the last years to describe opinion propagation in a community. In particular, it has been claimed that its transient is able to reproduce some scale properties observed in data of proportional elections, in different countries, if the community structure (the network) is scale-free. In this work, we investigate the properties of the transient of a particular version of the SM, introduced by Bernardes and co-authors in 2002. We studied the behavior of the model in networks of different topologies through the time evolution of an order parameter known as interface density, and concluded that regular lattices with high dimensionality also leads to a power-law distribution of the number of candidates with v votes. Also, we show that the particular absorbing state achieved in the stationary state (or else, the winner candidate), is related to a particular feature of the model, that may not be realistic in all situations.
Resumo:
In this article dedicated to Professor V. Lakshmikantham on the occasion of the celebration of his 84th birthday, we announce new results concerning the existence and various properties of an evolution system UA+B(t, s)(0 <= s <= t <= T) generated by the sum -(A(t)+B(t)) of two linear, time-dependent and generally unbounded operators defined on time-dependent domains in a complex and separable Banach space B. In particular, writing G(B) for the algebra of all linear bounded operators on B, we can express UA+B(t, s)(0 <= s <= t <= T) as the strong limit in L(B) of a product of the holomorphic contraction semigroups generated by -A(t) and -B(t), thereby getting a product formula of the Trotter-Kato type under very general conditions which allow the domain D(A(t)+B(t)) to evolve with time provided there exists a fixed set D subset of boolean AND D-t epsilon[0,D-T](A(t)+B(t)) everywhere dense in B. We then mention several possible applications of our product formula to various classes of non-autonomous parabolic initial-boundary value problems, as well as to evolution problems of Schrodinger type related to the theory of time-dependent singular perturbations of self-adjoint operators in quantum mechanics. We defer all the proofs and all the details of the applications to a separate publication. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
This study presents the syntheses and characterization of 2-mercaptopyridine (pyS(-)) complexes containing ruthenium(II) with the following general formula [Ru(pyS)(2)(P-P)], P-P = (c-dppen) = cis-1,2-bis(diphenylphosphino)ethylene) (1); (dppe)=1,2-bis(diphenylphosphino)ethane (2); (dppp)=1,3-bis(diphenylphosphino)propane (3) and (dppb) = 1,4-bis(diphenylphosphino)butane (4). The complexes were synthesized from the mer- or fac-[RuCl(3)(NO)(P-P)] precursors in the presence of triethylamine in methanol solution with dependence of the product on the P-P ligand. The reaction of pyS- with a ruthenium complex containing a bulky aromatic diphosphine dppb disclosed a major product with a dangling coordinated dppbO-P, the [Ru(pyS)(2)(NO)(eta(1)-dppbO-P)]PF(6) (5). In addition, this work also presents and discusses the spectroscopic and electrochemical behavior of 1-5. and report the X-ray structures for I and S. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
The Early Cretaceous alkaline magmatism in the northeastern region of Paraguay (Amambay Province) is represented by stocks, plugs, dikes, and dike swarms emplaced into Carboniferous to Triassic-Jurassic sediments and Precambrian rocks. This magmatism is tectonically related to the Ponta Pora Arch, a NE-trending structural feature, and has the Cerro Sarambi and Cerro Chiriguelo carbonatite complexes as its most significant expressions. Other alkaline occurrences found in the area are the Cerro Guazu and the small bodies of Cerro Apua, Arroyo Gasory, Cerro Jhu, Cerro Tayay, and Cerro Teyu. The alkaline rocks comprise ultramafic-mafic, syenitic, and carbonatitic petrographic associations in addition to lithologies of variable composition and texture occurring as dikes; fenites are described in both carbonatite complexes. Alkali feldspar and clinopyroxene, ranging from diopside to aegirine, are the most abundant minerals, with feldspathoids (nepheline, analcime), biotite, and subordinate Ti-rich garnet; minor constituents are Fe-Ti oxides and cancrinite as the main alteration product from nepheline. Chemically, the Amambay silicate rocks are potassic to highly potassic and have miaskitic affinity, with the non-cumulate intrusive types concentrated mainly in the saturated to undersaturated areas in silica syenitic fields. Fine-grained rocks are also of syenitic affiliation or represent more mafic varieties. The carbonatitic rocks consist dominantly of calciocarbonatites. Variation diagrams plotting major and trace elements vs. SiO(2) concentration for the Cerro Sarambi rocks show positive correlations for Al(2)O(3), K(2)O, and Rb, and negative ones for TiO(2), MgO, Fe(2)O(3), CaO, P(2)O(5), and Sr, indicating that fractional crystallization played an important role in the formation of the complex. Incompatible elements normalized to primitive mantle display positive spikes for Rb, La, Pb, Sr, and Sm, and negative for Nb-Ta, P, and Ti, as these negative anomalies are considerably more pronounced in the carbonatites. Chondrite-normalized REE patterns point to the high concentration of these elements and to the strong LRE/HRE fractionation. The Amambay rocks are highly enriched in radiogenic Sr and have T(DM) model ages that vary from 1.6 to 1.1 Ga. suggesting a mantle source enriched in incompatible elements by metasomatic events in Paleo-Mesoproterozoic times. Data are consistent with the derivation of the Cerro Sarambi rocks from a parental magma of lamprophyric (minette) composition and suggest an origin by liquid immiscibility processes for the carbonatites. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
Using invariance by fixed-endpoints homotopies and a generalized notion of symplectic Cayley transform, we prove a product formula for the Conley-Zehnder index of continuous paths with arbitrary endpoints in the symplectic group. We discuss two applications of the formula, to the metaplectic group and to periodic solutions of Hamiltonian systems.
Resumo:
In the present work, the thermal behavior of prednicarbate was studied using DSC and TG/DTG. The solid product remaining at the first decomposition step of the drug was isolated by TG, in air and N(2) atmospheres and was characterized using LC-MS/MS, NMR, and IR spectroscopy. It was found that the product at the first thermal decomposition step of prednicarbate corresponds to the elimination of the carbonate group bonding to C(17), and a consequent formation of double bond between C(17) and C(16). Structure elucidation of this degradation product by spectral data has been discussed in detail.