Morphology of terebelliform polychaetes (Annelida: Polychaeta: Terebelliformia), with a focus on Terebellidae

The morphology of terebelliform polychaetes was investigated for a phylogenetic study focused on Terebellidae. For this study, specimens belonging to 147 taxa, preferably type material or specimens from type localities or areas close to them, were examined under stereo, light and scanning electron microscopes. The taxa examined were 1 Pectinariidae, 2 Ampharetidae, 2 Alvinellidae, 8 Trichobranchidae, and 134 Terebellidae, which included 8 Polycirrinae, 15 Thelepodinae, and 111 Terebellinae. A comparison of the morphology, including prostomium, peristomium, anterior segments and lobes, branchiae, glandular venter, nephridial and genital papillae, notopodia and notochaetae, neuropodia and neurochaetae, and posterior end, was made of all the currently recognized families of terebelliform polychaetes, with special emphasis on Terebellidae. A discussion of the characters useful to distinguish between genera is given. This character set will be used in a subsequent phylogenetic study (Nogueira & Hutchings in prep.)

Gevrey solvability near the characteristic set for a class of planar complex vector fields of infinite type

We study the Gevrey solvability of a class of complex vector fields, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), given by L = partial derivative/partial derivative t + (a(x) + ib(x))partial derivative/partial derivative x, b not equivalent to 0, near the characteristic set Sigma = {0} x S(1). We show that the interplay between the order of vanishing of the functions a and b at x = 0 plays a role in the Gevrey solvability. (C) 2008 Elsevier Inc. All rights reserved.

TOWARD UNDERSTANDING THE B[e] PHENOMENON. IV. MODELING OF IRAS 00470+6429

FS CMa type stars are a recently described group of objects with the B[e] phenomenon which exhibits strong emission-line spectra and strong IR excesses. In this paper, we report the first attempt for a detailed modeling of IRAS 00470+6429, for which we have the best set of observations. Our modeling is based on two key assumptions: the star has a main-sequence luminosity for its spectral type (B2) and the circumstellar (CS) envelope is bimodal, composed of a slowly outflowing disklike wind and a fast polar wind. Both outflows are assumed to be purely radial. We adopt a novel approach to describe the dust formation site in the wind that employs timescale arguments for grain condensation and a self-consistent solution for the dust destruction surface. With the above assumptions we were able to satisfactorily reproduce many observational properties of IRAS 00470+6429, including the Hi line profiles and the overall shape of the spectral energy distribution. Our adopted recipe for dust formation proved successful in reproducing the correct amount of dust formed in the CS envelope. Possible shortcomings of our model, as well as suggestions for future improvements, are discussed.

Partitions selection strategy for set of clustering solutions

Clustering is a difficult task: there is no single cluster definition and the data can have more than one underlying structure. Pareto-based multi-objective genetic algorithms (e.g., MOCK Multi-Objective Clustering with automatic K-determination and MOCLE-Multi-Objective Clustering Ensemble) were proposed to tackle these problems. However, the output of such algorithms can often contains a high number of partitions, becoming difficult for an expert to manually analyze all of them. In order to deal with this problem, we present two selection strategies, which are based on the corrected Rand, to choose a subset of solutions. To test them, they are applied to the set of solutions produced by MOCK and MOCLE in the context of several datasets. The study was also extended to select a reduced set of partitions from the initial population of MOCLE. These analysis show that both versions of selection strategy proposed are very effective. They can significantly reduce the number of solutions and, at the same time, keep the quality and the diversity of the partitions in the original set of solutions. (C) 2010 Elsevier B.V. All rights reserved.

Generalized external indexes for comparing data partitions with overlapping categories

There is a family of well-known external clustering validity indexes to measure the degree of compatibility or similarity between two hard partitions of a given data set, including partitions with different numbers of categories. A unified, fully equivalent set-theoretic formulation for an important class of such indexes was derived and extended to the fuzzy domain in a previous work by the author [Campello, R.J.G.B., 2007. A fuzzy extension of the Rand index and other related indexes for clustering and classification assessment. Pattern Recognition Lett., 28, 833-841]. However, the proposed fuzzy set-theoretic formulation is not valid as a general approach for comparing two fuzzy partitions of data. Instead, it is an approach for comparing a fuzzy partition against a hard referential partition of the data into mutually disjoint categories. In this paper, generalized external indexes for comparing two data partitions with overlapping categories are introduced. These indexes can be used as general measures for comparing two partitions of the same data set into overlapping categories. An important issue that is seldom touched in the literature is also addressed in the paper, namely, how to compare two partitions of different subsamples of data. A number of pedagogical examples and three simulation experiments are presented and analyzed in details. A review of recent related work compiled from the literature is also provided. (c) 2010 Elsevier B.V. All rights reserved.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

A hybrid case adaptation approach for case-based reasoning

Case-Based Reasoning is a methodology for problem solving based on past experiences. This methodology tries to solve a new problem by retrieving and adapting previously known solutions of similar problems. However, retrieved solutions, in general, require adaptations in order to be applied to new contexts. One of the major challenges in Case-Based Reasoning is the development of an efficient methodology for case adaptation. The most widely used form of adaptation employs hand coded adaptation rules, which demands a significant knowledge acquisition and engineering effort. An alternative to overcome the difficulties associated with the acquisition of knowledge for case adaptation has been the use of hybrid approaches and automatic learning algorithms for the acquisition of the knowledge used for the adaptation. We investigate the use of hybrid approaches for case adaptation employing Machine Learning algorithms. The approaches investigated how to automatically learn adaptation knowledge from a case base and apply it to adapt retrieved solutions. In order to verify the potential of the proposed approaches, they are experimentally compared with individual Machine Learning techniques. The results obtained indicate the potential of these approaches as an efficient approach for acquiring case adaptation knowledge. They show that the combination of Instance-Based Learning and Inductive Learning paradigms and the use of a data set of adaptation patterns yield adaptations of the retrieved solutions with high predictive accuracy.

C(k)-solvability near the characteristic set for a class of planar complex vector fields of infinite type

This paper deals with semi-global C(k)-solvability of complex vector fields of the form L = partial derivative/partial derivative t + x(r) (a(x) + ib(x))partial derivative/partial derivative x, r >= 1, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), epsilon > 0, where a and b are C(infinity) real-valued functions in (-epsilon, epsilon). It is shown that the interplay between the order of vanishing of the functions a and b at x = 0 influences the C(k)-solvability at Sigma = {0} x S(1). When r = 1, it is permitted that the functions a and b of L depend on the x and t variables, that is, L = partial derivative/partial derivative t + x(a(x, t) + ib(x, t))partial derivative/partial derivative x, where (x, t) is an element of Omega(epsilon).

Synthesis and magnetic characterization of TmCo(2)B(2)C

A new quaternary intermetallic borocarbide TmCo(2)B(2)C has been synthesized via rapid-quench of an arc-melted ingot. Elemental and powder-diffraction analyses established its correct stoichiometry and single-phase character. The crystal structure is isomorphous with that of TmNi(2)B(2)C (I4/mmm) and is stable over the studied temperature range. Above 7 K, the paramagnetic state follows modified Curie-Weiss behavior (chi = C/(T - theta) + chi(0)) wherein chi(0) = 0.008(1) emu mol(-1) with the temperature-dependent term reflecting the paramagnetism of the Tm subsystem: mu(eff) = 7.6(2) mu(B) (in agreement with the expected value for a free Tm(3+) ion) and theta = -4.5(3) K. Long-range ferromagnetic order of the Tm sublattice is observed to develop around similar to 1 K. No superconductivity is detected in TmCo(2)B(2)C down to 20 mK, a feature which is consistent with the general trend in the RCo(2)B(2)C series. Finally, the influence of the rapid-quench process on the magnetism (and superconductivity) of TmNi(2)B(2)C will be discussed and compared to that of TmCo(2)B(2)C.

Geology and geochronology of the Betara region in south-southeastern Brazil: Evidence for possible Statherian (1.80-1.75 Ga) and Calymmian (1.50-1.45 Ga) extension events

The results of geological mapping, chemical analysis and radiometric dating of metabasic rocks of Betara Formation, and mapping and dating of those present in the Betara basement nucleus together with mylonitic granodiorite and syenogranite are reported here. U-Pb analysis of bulk zircon fractions from the metabasic rocks of the basement nucleus yielded a Statherian age of 1790 +/- 22 Ma, while the metabasic rocks from the upper part of the Betara Formation yielded a Calymmian age between 1500 and 1450 Ma. This age is a minimum for the deposition of the Betara Formation. The older metabasic rocks are associated with post-tectonic, possibly anorogenic syenogranite, while the younger ones are gabbro or very porphyritic ankaramite whose REE patterns are consistent with crystallization from an N-MORB parent magma. The observations and data point to the probable events associated with extensional processes of the end of Paleoproterozoic and early Mesoproterozoic. Similar registers of Statherian (1.80-1.75 Ga) and Calymmian (1.50-1.45 Ga) extensional events are recorded in other parts of the South American and African continents. The Neoproterozoic witnessed the formation and junction of the tectonic slices which formed the Apiai domain during the assemblage of western Gondwana. (C) 2010 International Association for Gondwana Research. Published by Elsevier B.V. All rights reserved.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

An extension of the generalized Birnbaum-Saunders distribution

In this paper we present an extension of the generalized Birnbaum-Saunders distribution family introduced in [Diaz-Garcia, J.A., Leiva-Sanchez, V., 2005. A new family of life distributions based on the contoured elliptically distributions. Journal of Statistical Planning and Inference 128 (2), 445-457] with a view to make it even more flexible in terms of its kurtosis coefficient. Properties involving moments and asymmetry and kurtosis indexes are studied for some special members of this family such as the slash Birnbaum-Saunders and slash-t Birnbaum-Saunders. Simulation studies for some particular cases and a real data analysis are also reported, illustrating the usefulness of the extension considered. (C) 2008 Elsevier B.V. All rights reserved.

Influence Diagnostics for a Skew Extension of the Grubbs Measurement Error Model

Influence diagnostics methods are extended in this article to the Grubbs model when the unknown quantity x (latent variable) follows a skew-normal distribution. Diagnostic measures are derived from the case-deletion approach and the local influence approach under several perturbation schemes. The observed information matrix to the postulated model and Delta matrices to the corresponding perturbed models are derived. Results obtained for one real data set are reported, illustrating the usefulness of the proposed methodology.

Towards a maximal extension of Pelczynski`s decomposition method in Banach spaces

l Suppose that X, Y. A and B are Banach spaces such that X is isomorphic to Y E) A and Y is isomorphic to X circle plus B. Are X and Y necessarily isomorphic? In this generality. the answer is no, as proved by W.T. Cowers in 1996. In the present paper, we provide a very simple necessary and sufficient condition on the 10-tuples (k, l, m, n. p, q, r, s, u, v) in N with p+q+u >= 3, r+s+v >= 3, uv >= 1, (p,q)$(0,0), (r,s)not equal(0,0) and u=1 or v=1 or (p. q) = (1, 0) or (r, s) = (0, 1), which guarantees that X is isomorphic to Y whenever these Banach spaces satisfy X(u) similar to X(p)circle plus Y(q), Y(u) similar to X(r)circle plus Y(s), and A(k) circle plus B(l) similar to A(m) circle plus B(n). Namely, delta = +/- 1 or lozenge not equal 0, gcd(lozenge, delta (p + q - u)) divides p + q - u and gcd(lozenge, delta(r + s - v)) divides r + s - v, where 3 = k - I - in + n is the characteristic number of the 4-tuple (k, l, m, n) and lozenge = (p - u)(s - v) - rq is the discriminant of the 6-tuple (p, q, r, s, U, v). We conjecture that this result is in some sense a maximal extension of the classical Pelczynski`s decomposition method in Banach spaces: the case (1, 0. 1, 0, 2. 0, 0, 2. 1. 1). (C) 2009 Elsevier Inc. All rights reserved.

The bound quiver of a split extension

In this paper, we give a sufficient (which is also necessary under a compatibility hypothesis) condition on a set of arrows in the quiver of an algebra A so that A is a split extension of A/M, where M is the ideal of A generated by the classes of these arrows. We also compare the notion of split extension with that of semiconvex extension of algebras.