Knowledge Representation and Orthophemism: A Reflection Aiming to a Concept

Characteristics of speech, especially figures of speech, are used by specific communities or domains, and, in this way, reflect their identities through their choice of vocabulary. This topic should be an object of study in the context of knowledge representation once it deals with different contexts of production of documents. This study aims to explore the dimensions of the concepts of euphemism, dysphemism, and orthophemism, focusing on the latter with the goal of extracting a concept which can be included in discussions about subject analysis and indexing. Euphemism is used as an alternative to a non-preferred expression or as an alternative to an offensive attribution-to avoid potential offense taken by the listener or by other persons, for instance, pass away. Dysphemism, on the other hand, is used by speakers to talk about people and things that frustrate and annoy them-their choice of language indicates disapproval and the topic is therefore denigrated, humiliated, or degraded, for instance, kick the bucket. While euphemism tries to make something sound better, dysphemism tries to make something sound worse. Orthophemism (Allan and Burridge 2006) is also used as an alternative to expressions, but it is a preferred, formal, and direct language of expression when representing an object or a situation, for instance, die. This paper suggests that the comprehension and use of such concepts could support the following issues: possible contributions from linguistics and terminology to subject analysis as demonstrated by Talamo et al. (1992); decrease of polysemy and ambiguity of terms used to represent certain topics of documents; and construction and evaluation of indexing languages. The concept of orthophemism can also serves to support associative relationships in the context of subject analysis, indexing, and even information retrieval related to more specific requests.

On a moment problem associated with Chebyshev polynomials

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the number of critical periods for planar polynomial systems

In this paper we get some lower bounds for the number of critical periods of families of centers which are perturbations of the linear one. We give a method which lets us prove that there are planar polynomial centers of degree l with at least 2[(l - 2)/2] critical periods as well as study concrete families of potential, reversible and Lienard centers. This last case is studied in more detail and we prove that the number of critical periods obtained with our approach does not. increases with the order of the perturbation. (C) 2007 Elsevier Ltd. All rights reserved.

Toda lattice field theories, discrete W algebras, Toda lattice hierarchies and quantum groups

In analogy with the Liouville case we study the sl3 Toda theory on the lattice and define the relevant quadratic algebra and out of it we recover the discrete W3 algebra. We define an integrable system with respect to the latter and establish the relation with the Toda lattice hierarchy. We compute the relevant continuum limits. Finally we find the quantum version of the quadratic algebra.

Orthogonal polynomials associated with related measures and Sobolev orthogonal polynomials

Connection between two sequences of orthogonal polynomials, where the associated measures are related to each other by a first degree polynomial multiplication (or division), are looked at. The results are applied to obtain information regarding Sobolev orthogonal polynomials associated with certain pairs of measures.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

Radial basis function networks with quantized parameters

A RBFN implemented with quantized parameters is proposed and the relative or limited approximation property is presented. Simulation results for sinusoidal function approximation with various quantization levels are shown. The results indicate that the network presents good approximation capability even with severe quantization. The parameter quantization decreases the memory size and circuit complexity required to store the network parameters leading to compact mixed-signal circuits proper for low-power applications. ©2008 IEEE.

Enzyme effects on extruded diets for dogs with soybean meal as a substitute for poultry by-product meal

The effects of exogenous enzymes supplementation on kibble diets for dogs formulated with soybean meal (SBM) as a substitute for poultry by-product meal (PM) was investigated on nutrient digestibility, fermentation products formation, post-prandial urea response and selected faecal bacteria counts. Two kibble diets with similar compositions were used in two trials: PM-based diet (28.9% of PM; soybean hulls as a fibre source) and SBM-based diet (29.9% of SBM). In experiment 1, the SBM diet was divided into three diets: SBM-0, without enzyme addition; SBM-1, covered after extrusion with 7500U protease/kg and 45U cellulase/kg; and SBM-2, covered with 15000U protease/kg and 90U cellulase/kg. In experiment 2, the SBM diet was divided into three diets: SBM-0; SBM-1, covered with 140U protease/kg; 8U cellulase/kg, 800U pectinase/kg, 60U phytase/kg, 40U betaglucanase/kg and 20U xylanase/kg; and SMB-2, covered with 700U protease/kg, 40U cellulase/kg, 4000U pectinase/kg, 300U phytase/kg, 200U betaglucanase/kg and 100U xylanase/kg. Each experiment followed a block design with six dogs per diet. Data were submitted to analysis of variance and means compared by orthogonal and polynomial contrasts (p<0.05). In both experiments, nutrients and energy digestibility did not differ between diets (p>0.05). SBM consumption resulted in increased faecal moisture and production (p<0.05), without effect on faecal score. Higher concentration of propionate, acetate and lactate, and lower ammonia and pH were found in the faeces of dogs fed SBM (p<0.05). Higher post-prandial urea was verified in dogs fed SBM (p<0.05). In experiment 2, the addition of enzymes increased faecal concentration of propionate, acetate and total short-chain fatty acid (p<0.05) and tended to reduce post-prandial urea concentration (p=0.06). Although with similar digestibility, SBM shows a worse utilization of absorbed amino acids than the PM. Soybean oligosaccharides can beneficially change gut fermentation product formation. Enzymes can increase the gut fermentation activity and improve the SBM proteic value. © 2013 Blackwell Verlag GmbH.

Classification of masses in mammographic image using wavelet domain features and polynomial classifier

Breast cancer is the most common cancer among women. In CAD systems, several studies have investigated the use of wavelet transform as a multiresolution analysis tool for texture analysis and could be interpreted as inputs to a classifier. In classification, polynomial classifier has been used due to the advantages of providing only one model for optimal separation of classes and to consider this as the solution of the problem. In this paper, a system is proposed for texture analysis and classification of lesions in mammographic images. Multiresolution analysis features were extracted from the region of interest of a given image. These features were computed based on three different wavelet functions, Daubechies 8, Symlet 8 and bi-orthogonal 3.7. For classification, we used the polynomial classification algorithm to define the mammogram images as normal or abnormal. We also made a comparison with other artificial intelligence algorithms (Decision Tree, SVM, K-NN). A Receiver Operating Characteristics (ROC) curve is used to evaluate the performance of the proposed system. Our system is evaluated using 360 digitized mammograms from DDSM database and the result shows that the algorithm has an area under the ROC curve Az of 0.98 ± 0.03. The performance of the polynomial classifier has proved to be better in comparison to other classification algorithms. © 2013 Elsevier Ltd. All rights reserved.

The enzymatic recalcitrance of internodes of sugar cane hybrids with contrasting lignin contents

The recalcitrance in grasses varies according to cell type and maturation. The origin of the recalcitrance in different regions from sugar cane internodes with varied lignin contents was evaluated. The efficiency of enzymatic hydrolysis was correlated with the chemical, micromorphological and microspectrophotometric characteristics of the samples. The internodes of three sugar cane hybrids were dissected into four different fractions. The outermost fraction and the rind were the most recalcitrant regions, whereas the pith-rind interface and the pith were less recalcitrant. Cellulose conversion reached 86% after 72h of enzymatic digestion of the pith from the hybrid with the lowest lignin content. There was an inversely proportional correlation between the area occupied by vascular bundles and the efficiency of cellulose hydrolysis. High cellulose and low lignin or hemicellulose contents enhanced the efficiency of enzymatic hydrolysis of the polysaccharides. The critical evaluation of the results permitted to propose an empirical parameter for predicting cellulose conversion levels that accounts for the positive effect of high cellulose and low lignin plus hemicellulose and the detrimental effect of abundant vascular bundles. The cellulose conversion levels fit well to this calculated parameter, following a second order polynomial with an r2 value of 0.96. © 2013 Elsevier B.V.

Improving face recognition with multispectral fusion and support vector machines

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Limit Cycles for a Class of Continuous and Discontinuous Cubic Polynomial Differential Systems

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Production lot sizing and scheduling with non-triangular sequence-dependent setup times

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Darboux invariants for planar polynomial differential systems having an invariant conic

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Local classification of singular hexagonal 3-webs with holomorphic Chern connection form and infinitesimal symmetries

Implicit ODE, cubic in derivative, generically has no infinitesimal symmetries even at regular points with distinct roots. Cartan showed that at regular points, ODEs with hexagonal 3-web of solutions have symmetry algebras of the maximal possible dimension 3. At singular points such a web can lose all its symmetries. In this paper we study hexagonal 3-webs having at least one infinitesimal symmetry at singular points. In particular, we establish sufficient conditions for the existence of non-trivial symmetries and show that under natural assumptions such a symmetry is semi-simple, i.e. is a scaling in some coordinates. Using the obtained results, we provide a complete classification of hexagonal singular 3-web germs in the complex plane, satisfying the following two conditions: 1) the Chern connection form is holomorphic at the singular point, 2) the web admits at least one infinitesimal symmetry at this point. As a by-product, a classification of hexagonal weighted homogeneous 3-webs is obtained.