159 research outputs found
The effectiveness of intergroup contact at work: Mediators and moderators of hospital workers' prejudice towards immigrants
No full textThe present research examines the effectiveness of intergroup contact between 167 Italian hospital workers and foreign patients in reducing prejudice towards immigrants in general. The outcomes of contact at work were analysed controlling for the influence of contact outside the workplace and through mass media, and taking into account the role of empathy, anxiety and group membership salience. Results indicate that the beneficial effects of contact at work were partially mediated by increased empathy and reduced anxiety, experienced both in the work environment and towards immigrants in general. Finally, high levels of group membership salience facilitated the influence of contact on intergroup emotions. These findings show that contact at work can be a powerful means to reduce prejudice, thanks to its capacity to evoke changes in affective responses
Estudo sobre a incorporação de dados em bibliotecas digitais de teses e dissertações utilizando linked data
No full textThe aim of this research was to present a study on the possibility of using Linked Data to process information from digital libraries of theses and dissertations. Linked Data is a set of good practices proposed by Tim Berners-lee et al (2001). The digital library evaluated was the digitial library of theses and dissertations (BDTD) of UFMG. In order to do so, the work of Maculan (2011) was used, from the selection made by the author was made a new random selection of a set of 10 documents which were used for this study. The documents selected for this research were located in the Biblioiteca Digital database of theses and dissertations and identified with a URI provided by BDTD itself. The ontology created by Maculan provided the classes and terms to relate to the documents and these were used as elements to construct the triples in Linked Data. Since the triple is formed by Subject, Predicate and Object were used the URIs of the documents to identify the subject; The set of Dublin elements and their qualifiers to identify the predicate, and finally the DBpedia Project to identify URIs for the terms of the taxonomy. The use of the DBPedia Project was due to its multidisciplinary character and wide availabilityEsta pesquisa teve como objetivo norteador apresentar um estudo sobre a possibilidade de uso do Linked Data para tratamento de informação de bibliotecas digitais de teses e dissertações. Linked Data é um conjunto de boas práticas propostas por Tim Berners-lee et al (2001). A biblioteca digital avaliada foi a biblioteca digital de teses e dissertações (BDTD) da UFMG. Para tanto, fez-se uso do trabalho de Maculan (2011), a partir da seleção feita pela autora foi feita uma nova seleção aleatória de um conjunto de 10 documentos os quais foram utilizados para este estudo. Os documentos selecionados para esta pesquisa foram localizados na base de dados da Biblioteca Digital de Teses e dissertações e identificados com uma URI fornecida pela própria BDTD. A ontologia criada por Maculan forneceu as classes e termos para relacionar aos documentos e estas foram utilizadas como elementos para construção das triplas em Linked Data. Uma vez que a tripla é formada por Sujeito, Predicado e Objeto foram utilizados os URIs dos documentos para identificar o sujeito; o conjunto de elementos do Dublin e seus qualificadores para identificar o predicado e, por fim, o Projeto DBpedia para identificar URIs para os termos da taxonomia. O uso do Projeto DBPedia se deu por seu caráter multidisciplinar e ampla disponibilidad
On Suitable Orders For Discretizing Molecular Distance Geometry Problems Related To Protein Side Chains
No full textProteins are important molecules that are widely studied in biology. Their three-dimensional conformations can give clues about their function, however an optimal methodology for the identification of such conformations has not been found yet. Experiments of Nuclear Magnetic Resonance (NMR) are able to estimate distances between some pairs of atoms forming the protein, and the problem of identifying the possible conformations satisfying the available distance constraints is known in the scientific literature as the Molecular Distance Geometry Problem (MDGP). Since some years, some of us have been working on a suitable discretization for the MDGP and on an efficient Branch & Prune (BP) algorithm which is based on a tree search. In order to perform this discretization, however, some assumptions need to be satisfied. We recently hand-crafted a special order for protein backbone atoms which allows us to discretize all MDGPs concerning backbones. In this paper, we do the same for the side chains of some amino acids. Our computational experiments show that the inclusion of the side chain information allows to improve the performances of the BP algorithm. © 2012 Polish Info Processing Socit.379384Berman, H., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I., Bourne, P., The protein data bank (2000) Nucleic Acids Research, 28, pp. 235-242Crippen, G., Havel, T., (1988) Distance Geometry and Molecular Conforma-Tion, , John Wiley & Sons, New YorkLavor, C., Liberti, L., MacUlan, N., Mucherino, A., The discretizable molecular distance geometry problem (2012) Computational Optimization and Applications, 52, pp. 115-146Lavor, C., Liberti, L., MacUlan, N., Mucherino, A., Recent advances on the discretizable molecular distance geometry problem (2012) European Journal of Operational Research, 219, pp. 698-706Lavor, C., Liberti, L., Mucherino, A., The interval Branch-and-Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances (2011) To Appear in Journal of Global OptimizationLiberti, L., Lavor, C., MacUlan, N., A branch-and-prune algorithm for the molecular distance geometry problem (2008) International Transactions in Operational Research, 15, pp. 1-17Liberti, L., Lavor, C., Mucherino, A., MacUlan, N., Molecular distance geometry methods: From continuous to discrete (2010) International Transactions in Operational Research, 18, pp. 33-51Liberti, L., Masson, B., Lavor, C., Mucherino, A., Branch-and-prune trees with bounded width (2011) Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW11), pp. 189-193. , Rome, ItalyNilges, M., Gronenborn, A., Brunger, A., Clore, G., Determination of three-dimensional structures of proteins by simulated annealing with interproton distance restraints. application to crambin (1988) Potato Carboxypeptidase Inhibitor and Barley Serine Proteinase Inhibitor 2, Protein Engineering, 2, pp. 27-38More, J., Wu, Z., Distance geometry optimization for protein structures (1999) Journal of Global Optimization, 15, pp. 219-234Mucherino, A., Lavor, C., Malliavin, T., Liberti, L., Nilges, M., MacUlan, N., Influence of pruning devices on the solution of molecular distance geometry problems (2011) Lecture Notes in Computer Science 6630, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), pp. 206-217. , P.M. Pardalos and S. Rebennack (Eds.) Crete, GreeceSaxe, J., Embeddability of Weighted Graphs in k-Space is Strongly NP-hard (1979) Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480-48
Estudo sobre a incorporação de dados em bibliotecas digitais de teses e dissertações utilizando linked data
No full textThe aim of this research was to present a study on the possibility of using Linked Data to process information from digital libraries of theses and dissertations. Linked Data is a set of good practices proposed by Tim Berners-lee et al (2001). The digital library evaluated was the digitial library of theses and dissertations (BDTD) of UFMG. In order to do so, the work of Maculan (2011) was used, from the selection made by the author was made a new random selection of a set of 10 documents which were used for this study. The documents selected for this research were located in the Biblioiteca Digital database of theses and dissertations and identified with a URI provided by BDTD itself. The ontology created by Maculan provided the classes and terms to relate to the documents and these were used as elements to construct the triples in Linked Data. Since the triple is formed by Subject, Predicate and Object were used the URIs of the documents to identify the subject; The set of Dublin elements and their qualifiers to identify the predicate, and finally the DBpedia Project to identify URIs for the terms of the taxonomy. The use of the DBPedia Project was due to its multidisciplinary character and wide availabilityEsta pesquisa teve como objetivo norteador apresentar um estudo sobre a possibilidade de uso do Linked Data para tratamento de informação de bibliotecas digitais de teses e dissertações. Linked Data é um conjunto de boas práticas propostas por Tim Berners-lee et al (2001). A biblioteca digital avaliada foi a biblioteca digital de teses e dissertações (BDTD) da UFMG. Para tanto, fez-se uso do trabalho de Maculan (2011), a partir da seleção feita pela autora foi feita uma nova seleção aleatória de um conjunto de 10 documentos os quais foram utilizados para este estudo. Os documentos selecionados para esta pesquisa foram localizados na base de dados da Biblioteca Digital de Teses e dissertações e identificados com uma URI fornecida pela própria BDTD. A ontologia criada por Maculan forneceu as classes e termos para relacionar aos documentos e estas foram utilizadas como elementos para construção das triplas em Linked Data. Uma vez que a tripla é formada por Sujeito, Predicado e Objeto foram utilizados os URIs dos documentos para identificar o sujeito; o conjunto de elementos do Dublin e seus qualificadores para identificar o predicado e, por fim, o Projeto DBpedia para identificar URIs para os termos da taxonomia. O uso do Projeto DBPedia se deu por seu caráter multidisciplinar e ampla disponibilidad
Comparison between unilateral PNIF and rhinomanometry in the evaluation of nasal cycle
No full textHuman unilateral nasal airflow shows spontaneous changes over a period of hours due to the alternating congestion and decongestion of the venous sinuses within the nasal turbinates and nasal septum. The aim of the present study was to compare PNIF and unilateral PNIF with nasal resistances measured by means of AAR in the evaluation of the nasal cycle
The effect of virginiamycin supplementation in sow diet on the reproductive performance of the gilt/sow
No full textThis trial investigated the effects of virginiamycin on sow and litter performance. Virginiamycin was added to the sow diet during the period of gestation and lactation at the levels of 0, 40 and 60 mg/kg, throughout two breeding cycles. Virginiamycin did not significantly affect sow weight change during gestation or lactation, or litter size and weight; there were no significant effects on food consumption (P > 0·05). However, when added at a level of 40 mg/kg virginiamycin tended to produce a better condition of sows which resulted in a significant reduction of replacement rate (P < 0·05), even though the proportion of gilts culled in the treated and untreated groups was high. The most evident result was a significantly shorter weaning-to-conception interval for the virginiamycin group at the end of the second reproductive cycle (first period, 5·9 days less than the control group, 2·5 days less than the 60 mg/kg group; second period, -9·5 days v. control group, P < 0·05, and -7·1 days v. 60 mg/kg group, P < 0·05), allowing a numerical improvement in productivity. Piglet performance was not significantly improved by the use of virginiamycin even though there was an evident trend in favour of the 40 mg/kg group which presented a higher proportion of heavier piglets (P < 0·05) and a reduction of pre-weaning mortality. A significant quadratic regression was found for weaning-to-conception interval and numeric productivity, indicating that the dosage more efficient to improve these parameters was 32 mg/kg. The results obtained in the virginiamycin 60 group were generally inferior to those of the 40 mg/kg group and also to the control group and seem to demonstrate that the 60 mg/kg dosage was too high
Euclidean Distance Geometry And Applications
No full textEuclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consist of an incomplete set of distances and the output is a set of points in Euclidean space realizing those given distances. We survey the theory of Euclidean distance geometry and its most important applications, with special emphasis on molecular conformation problems. © 2014 Society for Industrial and Applied Mathematics.561369Alexandrov, A., (1950) Convex Polyhedra, Gosudarstv. Izdat. Tekhn.-Theor. Lit., , MoscowAlfakih, A., Khandani, A., Wolkowicz, H., Solving Euclidean distance matrix completion problems via semidefinite programming (1999) Comput. Optim. Appl., 12, pp. 13-30Alves, R., Cassioli, A., Mucherino, A., Lavor, C., Liberti, L., Adaptive branching in iBP with Clifford algebra (2013) Proceedings of the Workshop on Distance Geometry and Applications, pp. 65-69. , A. Andrioni, C. Lavor, L. Liberti, A. Mucherino, N. Maculan, and R. Rodriguez, eds., Universidade Federal do Amazonas, ManausAnderson, B., Belhumeur, P., Eren, T., Goldenberg, D., Morse, S., Whiteley, W., Yang, R., Graphical properties of easily localizable sensor networks (2009) Wireless Networks, 15, pp. 177-191Arabie, P., Was Euclid an unnecessarily sophisticated psychologist? (1991) Psychometrika, 56, pp. 567-587Asimow, L., Roth, B., The rigidity of graphs (1978) Trans. Amer. Math. Soc., 245, pp. 279-289Asimow, L., Roth, B., The rigidity of graphs II (1979) J. Math. Anal. Appl., 68, pp. 171-190Aspnes, J., Eren, T., Goldenberg, D., Morse, S., Whiteley, W., Yang, R., Anderson, B., Belhumeur, P., A theory of network localization (2006) IEEE Trans. Mobile Comput., 5, pp. 1663-1678Aspnes, J., Goldenberg, D., Yang, R., On the computational complexity of sensor network localization (2004) Algorithmic Aspects of Wireless Sensor Networks, pp. 32-44. , S. Nikoletseas and J. Rolim, eds., Lecture Notes in Comput. Sci. 3121, Springer, BerlinAuslander, L., Mackenzie, R., (1977) Introduction to Differentiable Manifolds, , Dover, New YorkBahr, A., Leonard, J., Fallon, M., Cooperative localization for autonomous underwater vehicles (2009) Internat. J. Robotics Res., 28, pp. 714-728Barvinok, A., Problems of distance geometry and convex properties of quadratic maps (1995) Discrete Comput. Geom., 13, pp. 189-202Belkin, M., Niyogi, P., Laplacian eigenmaps for dimensionality reduction and data representation (2003) Neural Comput., 15, pp. 1373-1396Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A., Branching and bounds tightening techniques for non-convex MINLP (2009) Optim. Methods Softw., 24, pp. 597-634Ben-Israel, A., Mond, B., What is invexity? (1986) J. Aust. Math. Soc. Ser. B, 28, pp. 1-9Benedetti, R., Risler, J.-J., (1990) Real Algebraic and Semi-algebraic Sets, , Hermann, ParisBerger, B., Kleinberg, J., Leighton, T., Reconstructing a three-dimensional model with arbitrary errors (1999) J. ACM, 46, pp. 212-235Berman, H., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I., Bourne, P., The protein data bank (2000) Nucleic Acid Res., 28, pp. 235-242Biggs, N., (1974) Algebraic Graph Theory, , Cambridge University Press, Cambridge, UKBiggs, N., Lloyd, E., Wilson, R., (1976) Graph Theory 1736-1936, , Oxford University Press, OxfordBiswas, P., (2007) Semidefinite Programming Approaches to Distance Geometry Problems, , Ph.D. thesis, Stanford University, Stanford, CABiswas, P., Lian, T., Wang, T., Ye, Y., Semidefinite programming based algorithms for sensor network localization (2006) ACM Trans. Sensor Networks, 2, pp. 188-220Biswas, P., Liang, T.-C., Toh, K.-C., Wang, T.-C., Ye, Y., Semidefinite programming approaches for sensor network localization with noisy distance measurements (2006) IEEE Trans. Automation Sci. Engrg., 3, pp. 360-371Biswas, P., Toh, K.-C., Ye, Y., A distributed SDP approach for large-scale noisy anchorfree graph realization with applications to molecular conformation (2008) SIAM J. Sci. Comput., 30, pp. 1251-1277Biswas, P., Ye, Y., Semidefinite programming for ad hoc wireless sensor network localization (2004) Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN04), pp. 46-54. , ACM, New YorkBiswas, P., Ye, Y., A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization (2006) Multiscale Optimization Methods and Applications, pp. 69-84. , W. Hager et al., eds., Nonconvex Optim. Appl. 82, Springer, New YorkBjörner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G., (1993) Oriented Matroids, , Cambridge University Press, Cambridge, UKBlumenthal, L., (1953) Theory and Applications of Distance Geometry, , Oxford University Press, OxfordBohr, H., Brunak, S., (1996) Protein Folds: A Distance Based Approach, , CRC Press, Boca Raton, FLBokowski, J., Sturmfels, B., On the coordinatization of oriented matroids (1986) Discrete Comput. Geom., 1, pp. 293-306Borg, I., Groenen, P., (2010) Modern Multidimensional Scaling, , 2nd ed., Springer, New YorkBoyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V., (1994) Linear Matrix Inequalities in System and Control Theory, , SIAM, PhiladelphiaBreu, H., Kirkpatrick, D., Unit disk graph recognition is NP-hard (1998) Comput. Geom., 9, pp. 3-24Canny, J., Emiris, I., A subdivision-based algorithm for the sparse resultant (2000) J. ACM, 47, pp. 417-451Carroll, J., Chang, J., Analysis of individual differences in multidimensional scaling via an n-way generalization of "eckart-Young" decomposition (1970) Psychometrika, 35, pp. 283-319Carvalho, R., Lavor, C., Protti, F., Extending the geometric build-up algorithm for the molecular distance geometry problem (2008) Inform. Process. Lett., 108, pp. 234-237Cauchy, A.-L., Sur les polygones et les polyèdres (1813) J. Ecole Polytechnique, 16, pp. 87-99Cayley, A., A theorem in the geometry of position (1841) Cambridge Math. J., 2, pp. 267-271Chen, H., (2012) Distance Geometry for Kissing Balls, , preprint, arXiv:1203.2131v2Chevalley, C., (1955) The Construction and Study of Certain Important Algebras, , The Mathematical Society of Japan, TokyoClark, B., Colburn, C., Johnson, D., Unit disk graphs (1990) Discrete Math., 86, pp. 165-177Clore, G., Gronenborn, A., Determination of three-dimensional structures of proteins and nucleic acids in solution by nuclear magnetic resonance spectroscopy (1989) Critical Reviews in Biochemistry and Molecular Biology, 24, pp. 479-564Connelly, R., A counterexample to the rigidity conjecture for polyhedra (1978) Inst. Hautes Études Sci. Publ. Math., 47, pp. 333-338Connelly, R., On generic global rigidity (1991) Applied Geometry and Discrete Mathematics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 4, pp. 147-155. , AMS, Providence, RIConnelly, R., Generic global rigidity (2005) Discrete Comput. Geom., 33, pp. 549-563Conway, J., Sloane, N., (1993) Sphere Packings, , Lattices and Groups, Springer, BerlinCoope, I., Reliable computation of the points of intersection of n spheres in Rn (2000) Aust. N. Z. Indust. Appl. Math. J., 42, pp. C461-C477Costa, V., Lavor, C., Mucherino, A., Cassioli, A., Carvalho, L., Maculan, N., Discretization orders for protein side chains J. Global Optim., , to appearCremona, L., (1872) Le Figure Reciproche Nella Statica Grafica, , G. Bernardoni, MilanoCremona, L., (1874) Elementi di Calcolo Grafico, , Paravia, TorinoCrippen, G., Distance geometry for realistic molecular conformations (2013) Distance Geometry: Theory, Methods, and Applications, pp. 315-328. , A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New YorkCrippen, G., Havel, T., (1988) Distance Geometry and Molecular Conformation, , Wiley, New YorkCrum Brown, A., On the theory of isomeric compounds (1864) Trans. Roy. Soc. Edinburgh, 23, pp. 707-719Cucuringu, M., Lipman, Y., Singer, A., Sensor network localization by eigenvector synchronization over the Euclidean group (2012) ACM Trans. Sensor Networks, 8, pp. 1-42Cucuringu, M., Singer, A., Cowburn, D., Eigenvector synchronization, graph rigidity and the molecule problem (2012) Inform. Inference, 1, pp. 21-67Dattorro, J., (2005) Convex Optimization and Euclidean Distance Geometry, , Mß oo, Palo AltoDattorro, J., Equality relating Euclidean distance cone to positive semidefinite cone (2008) Linear Algebra Appl., 428, pp. 2597-2600De Leeuw, J., Heiser, W., Theory of multidimensional scaling (1982) Classification Pattern Recognition and Reduction of Dimensionality, pp. 285-316. , P. Krishnaiah and L. Kanal, eds., Handbook of Statist. 2, ElsevierDemaine, E., Gomez-Martin, F., Meijer, H., Rappaport, D., Taslakian, P., Toussaint, G., Winograd, T., Wood, D., The distance geometry of music (2009) Comput. Geom., 42, pp. 429-454Deza, M., Deza, E., (2009) Encyclopedia of Distances, , Springer, BerlinDiestel, R., (2005) Graph Theory, , Springer, New YorkDirac, G., On rigid circuit graphs (1961) Abh. Math. Sem. Univ. Hamburg, 25, pp. 71-76Doherty, L., Pister, K., El Ghaoui, L., Convex position estimation in wireless sensor networks (2001) Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 of INFOCOM, IEEE, pp. 1655-1663Donald, B., (2011) Algorithms in Structural Molecular Biology, , MIT Press, BostonDong, Q., Wu, Z., A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances (2002) J. Global Optim., 22, pp. 365-375Dong, Q., Wu, Z., A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data (2003) J. Global Optim., 26, pp. 321-333Dress, A., Havel, T., Distance geometry and geometric algebra (1993) Found. Phys., 23, pp. 1357-1374Dzemyda, G., Kurasova, O., Žilinskas, J., (2013) Multidimensional Data Visualiation: Methods and Applications, , Springer, New YorkDzhafarov, E., Colonius, H., Reconstructing distances among objects from their discriminability (2006) Psychometrika, 71, pp. 365-386Eaton, J., (2002) GNU Octave Manual, , Network Theory LimitedEckart, C., Young, G., The approximation of one matrix by another of lower rank (1936) Psychometrika, 1, pp. 211-218Emiris, I., Mourrain, B., Computer algebra methods for studying and computing molecular conformations (1999) Algorithmica, 25, pp. 372-402Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P., Rigidity, computation, and randomization in network localization (2004) IEEE Infocom Proc., 4, pp. 2673-2684Everitt, B., Rabe-Hesketh, S., (1997) The Analysis of Proximity Data, , Arnold, LondonFeferman, S., Dawson, J., Kleene, S., Moore, G., Solovay, R., Van Heijenoort, J., (1986) Kurt Gödel: Collected Works, 1. , Oxford University Press, OxfordFekete, Z., Jordán, T., Uniquely localizable networks with few anchors (2006) Algorithmic Aspects of Wireless Sensor Networks, pp. 176-183. , S. Nikoletseas and J. Rolim, eds., Lecture Notes in Comput. Sci. 4240, Springer, BerlinForman, G., Zahorjan, J., The challenges of mobile computing (1994) IEEE Comput., 27, pp. 38-47Fudos, I., Hoffmann, C., A graph-constructive approach to solving systems of geometric constraints (1997) ACM Trans. Graphics, 16, pp. 179-216Garey, M., Johnson, D., (1979) Computers and Intractability: A Guide to the Theory of NPCompleteness, , Freeman and Company, New YorkGibson, K., Scheraga, H., Energy minimization of rigid-geometry polypeptides with exactly closed disulfide loops (1997) J. Comput. Chem., 18, pp. 403-415Gluck, H., Almost all simply connected closed surfaces are rigid (1975) Geometric Topology, pp. 225-239. , A. Dold and B. Eckmann, eds., Lecture Notes in Math. 438, Springer, BerlinGlunt, W., Hayden, T.L., Hong, S., Wells, J., An alternating projection algorithm for computing the nearest Euclidean distance matrix (1990) SIAM J. Matrix Anal. Appl., 11, pp. 589-600Gortler, S., Healy, A., Thurston, D., Characterizing generic global rigidity (2010) Amer. J. Math., 132, pp. 897-939Gower, J., Some distance properties of latent root and vector methods in multivariate analysis (1966) Biometrika, 53, pp. 325-338Gower, J., Euclidean distance geometry (1982) Math. Sci., 7, pp. 1-14Gramacho, W., Mucherino, A., Lavor, C., Maculan, N., A parallel BP algorithm for the discretizable distance geometry problem (2012) Proceedings of the Workshop on Parallel Computing and Optimization, Shanghai, pp. 1756-1762. , IEEEGraver, J., Rigidity matroids (1991) SIAM J. Discrete Math., 4, pp. 355-368Graver, J., Servatius, B., Servatius, H., (1993) Combinatorial Rigidity, , AMS, Providence, RIGrippo, L., Sciandrone, M., On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (2000) Oper. Res. Lett., 26, pp. 127-136Grone, R., Johnson, C., De Sá, E., Wolkowicz, H., Positive definite completions of partial Hermitian matrices (1984) Linear Algebra Appl., 58, pp. 109-124Grosso, A., Locatelli, M., Schoen, F., Solving molecular distance geometry problems by global optimization algorithms (2009) Comput. Optim. Appl., 43, pp. 23-27Havel, T., Metric matrix embedding in protein structure calculations (2003) Magnetic Resonance Chem., 41, pp. 537-550Havel, T., Kuntz, I., Crippen, G., The theory and practice of distance geometry (1983) Bull. Math. Biol., 45, pp. 665-720Hendrickson, B., Conditions for unique graph realizations (1992) SIAM J. Comput., 21, pp. 65-84Hendrickson, B., The molecule problem: Exploiting structure in global optimization (1995) SIAM J. Optim., 5, pp. 835-857Henneberg, L., (1886) Statik der Starren Systeme, , Bergstræsser, DarmstadtHenneberg, L., (1911) Die Graphische Statik der Starren Systeme, , Teubner, LeipzigHoai An, L., Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. Programming (2003) J. Global Optim., 27, pp. 375-397Hoai An, L.T., Dinh Tao, P., Large-scale molecular optimization from distance matrices by a d.c. Optimization approach (2003) SIAM J. Optim., 14, pp. 77-114Huang, H.-X., Liang, Z.-A., Pardalos, P., Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (2003) J. Global Optim., 25, pp. 3-21Hunt, K., (1990) Kinematic Geometry of Mechanisms, , Oxford University Press, OxfordIzrailev, S., Zhu, F., Agrafiotis, D., A distance geometry heuristic for expanding the range of geometries sampled during conformational search (2006) J. Comput. Chem., 26, pp. 1962-1969Jackson, B., Jordán, T., Connected rigidity matroids and unique realization of graphs (2005) J. Combin. Theory Ser. B, 94, pp. 1-29Jackson, B., Jordán, T., On the rigidity of molecular graphs (2008) Combinatorica, 28, pp. 645-658Jackson, B., Jordán, T., Graph theoretic techniques in the analysis of uniquely localizable sensor networks (2009) Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking, pp. 146-173. , G. Mao and B. Fidan, eds., IGI GlobalJohnson, C., Kroschel, B., Wolkowicz, H., An interior-point method for approximate positive semidefinite completions (1998) Comput. Optim. Appl., 9, pp. 175-190Jolliffe, I., (2010) Principal Component Analysis, , 2nd ed., Springer, BerlinKostrowicki, J., Piela, L., Diffusion equation method of global minimization: Performance for standard test functions (1991) J. Optim. Theory Appl., 69, pp. 269-284Krishnaiah, P., Kanal, L., (1982) Theory of Multidimensional Scaling, 2. , North-HollandKrislock, N., (2010) Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion, , Ph.D. thesis, University of WaterlooKrislock, N., Wolkowicz, H., Explicit sensor network localization using semidefinite representations and facial reductions (2010) SIAM J. Optim., 20, pp. 2679-2708Kruskal, J., Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis (1964) Psychometrika, 29, pp. 1-27Kruskal, J., Nonmetric multidimensional scaling: A numerical method (1964) Psychometrika, 29, pp. 115-129Kucherenko, S., Belotti, P., Liberti, L., Maculan, N., New formulations for the kissing number problem (2007) Discrete Appl. Math., 155, pp. 1837-1841Kucherenko, S., Sytsko, Y., Application of deterministic low-discrepancy sequences in global optimization (2004) Comput. Optim. Appl., 30, pp. 297-318Laman, G., On graphs and rigidity of plane skeletal structures (1970) J. Engrg. Math., 4, pp. 331-340Laurent, M., Cuts, matrix completions and graph rigidity (1997) Math. Program., 79, pp. 255-283Laurent, M., Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (2000) SIAM J. Matrix Anal. Appl., 22, pp. 874-894Laurent, M., Matrix completion problems (2009) Encyclopedia of Optimization, pp. 1967-1975. , 2nd ed., C. Floudas and P. Pardalos, eds., Springer, New YorkLavor, C., On generating instances for the molecular distance geometry problem (2006) Global Optimization: From Theory to Implementation, pp. 405-414. , L. Liberti and N.Maculan, eds., Springer, BerlinLavor, C., Lee, J., Lee-St. John, A., Liberti, L., Mucherino, A., Sviridenko, M., Discretization orders for distance geometry problems (2012) Optim. Lett., 6, pp. 783-796Lavor, C., Liberti, L., Maculan, N., Grover's algorithm applied to the molecular distance geometry problem (2005) Proceedings of the 7th Brazilian Congress of Neural Networks, Natal, BrazilLavor, C., Liberti, L., Maculan, N., Computational experience with the molecular distance geometry problem (2006) Global Optimization: Scientific and Engineering Case Studies, pp. 213-225. , J. Pintér, ed., Springer, BerlinLavor, C., Liberti, L., Maculan, N., (2006) The Discretizable Molecular Distance Geometry Problem, , preprint, arXiv:q-bio/0608012Lavor, C., Liberti, L., Maculan, N., Molecular distance geometry problem (2009) Encyclopedia of Optimization, pp. 2305-2311. , 2nd ed., C. Floudas and P. Pardalos, eds., Springer, New YorkLavor, C., Liberti, L., Maculan, N., A note on "a Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem" (2011) Internat. Trans. Oper. Res., 18, pp. 751-752Lavor, C., Liberti, L., Maculan, N., Mucherino, A., The discretizable molecular distance geometry problem (2012) Comput. Optim. Appl., 52, pp. 115-146Lavor, C., Liberti, L., Maculan, N., Mucherino, A., Recent advances on the discretizable molecular distance geometry problem (2012) European J. Oper. Res., 219, pp. 698-706Lavor, C., Liberti, L., Mucherino, A., The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (2013) J. Global Optim., 56, pp. 855-871Lavor, C., Liberti, L., Mucherino, A., Maculan, N., On a discretizable subclass of instances of the molecular distance geometry problem (2009) Proceedings of the 24th Annual ACM Symposium on Applied Computing, pp. 804-805. , D. Shin, ed., ACM, New YorkLavor, C., Mucherino, A., Liberti, L., Maculan, N., An artificial backbone of hydrogens for finding the conformation of protein molecules (2009) Proceedings of the Computational Structural Bioinformatics Workshop, pp. 152-155. , Washington D.C., IEEELavor, C., Mucherino, A., Liberti, L., Maculan, N., Computing artificial backbones of hydrogen atoms in order to discover protein backbones (2009) Proceedings of the International Multiconference on Computer Science and Information Technology, Mragowo, Poland, IEEE, pp. 751-756Lavor, C., Mucherino, A., Liberti, L., Maculan, N., Discrete approaches for solving molecular distance geometry problems using NMR data (2010) Internat. J. Comput. Biosci., 1, pp. 88-94Lavor, C., Mucherino, A., Liberti, L., Maculan, N., On the solution of molecular distance geometry problems with interval data (2010) Proceedings of the International Workshop on Computational Proteomics, Hong Kong, IEEE, pp. 77-82Lavor, C., Mucherino, A., Liberti, L., Maculan, N., On the computation of protein backbones by using artificial backbones of hydrogens (2011) J. Global Optim., 50, pp. 329-344Lavor, C., Mucherino, A., Liberti, L., Maculan, N., Finding low-energy homopolymer conformations by a discrete approach (2012) Proceedings of the Global Optimization Workshop, , D. Aloise, P. Hansen, and C. Rocha, eds., Universidade Federal do Rio Grande do Norte, NatalLe Grand, S., Elofsson, A., Eisenberg, D., The effect of distance-cutoff on the performance of the distance matrix error when used as a potential function to drive conformational search (1996) Protein Folds: A Distance Based Approach, pp. 105-113. , H. Bohr and S. Brunak, eds., CRC Press, Boca Raton, FLLee, J., Verleysen, M., (2010) Nonlinear Dimensionality Reduction, , Springer, BerlinLeung, N.-H.Z., Toh, K.-C., An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization (2009) SIAM J. Sci. Comput., 31, pp. 4351-4372Liberti, L., (2004) Reformulation and Convex Relaxation Techniques for Global Optimization, , Ph.D. thesis, Imperial College London, LondonLiberti, L., Reformulations in mathematical programming: Definitions and systematics (2009) RAIRO Oper. Res., 43, pp. 55-85Liberti, L., Dražic, M., Variable neighbourhood search for the global optimization of constrained NLPs (2005) Proceedings of GO Workshop, Almeria, SpainLiberti, L., Kucherenko, S., (2004) Comparison of Deterministic and Stochastic Approaches to Global Optimization, , Tech. Rep. 2004.25, DEI, Politecnico di MilanoLiberti, L., Lavor, C., On a relationship between graph realizability and distance matrix completion (2013) Optimization Theory, Decision Making, and Operational Research Applications, pp. 39-48. , A. Migdalas, A. Sifaleras, C. Georgiadis, J. Papathanaiou, and E. Stiakakis, eds., Proc. Math. Statist. 31, Springer, BerlinLiberti, L., Lavor, C., Maculan, N., A branch-and-prune algorithm for the molecular distance geometry problem (200
A Branch-and-cut Algorithm For Equitable Coloring Based On A Formulation By Representatives
No full text[No abstract available]35C347352Bahiense, L., Jurkiewicz, S., Lozano, A., Pimenta, M., Waga, C., Valladares, C., An integer programming approach to equitable coloring problems (2007) Proceedings of the XXXIX Brazilian Symposium on Operations Research, 1, pp. 1795-1801. , FortalezaCampêlo, M., Campos, V., Corrêa, R., On the asymmetric representatives formulation for the vertex coloring problem (2005) Electronic Notes in Discrete Mathematics, 19, pp. 337-343Campêlo, M., Corrêa, R.C., Frota, Y., Cliques, holes and the vertex coloring polytope (2004) Information Processing Letters, 89, pp. 159-164Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C., A branch-and-cut algorithm for partition coloring (2009) Networks, , to appearFurmańczyk, H., Kubale, M., The Complexity of Equitable Vertex Coloring of Graphs (2005) Journal of Applied Computer Science, 13, pp. 95-107Méndez-Díaz, I., Nasini, G., Severin, D., A polyhedral approach for the graph equitable coloring problem (2008) Proceedings of the VI ALIO/EURO Workshop on Applied Combinatorial Optimization, , Buenos AiresMeyer, W., Equitable coloring (1973) American Mathematical Monthly, 80, pp. 143-149Touhami, S., (2004) Optimization problems in cellular Networks, , PhD thesis, John Molson School of Business, Concordia University, MontrealTucker, A., Perfect graphs and an application to optimizing municipal services (1973) SIAM Review, 15, pp. 585-59
Production of subject-verb agreement, tense, mood, and negation in Italian agrammatic aphasia
No full textImpaired (morpho)syntactic production is the hallmark of agrammatic aphasia. Several hypotheses have been proposed to account for agrammatic production, which often make different predictions. The Distributed Morphology Hypothesis (DMH) (Wang et al., 2014) posits that categories involving inflectional alternations are impaired in agrammatism. The Tense Underspecification Hypothesis (TUH) (Wenzlaff & Clahsen, 2004, 2005) states that what is impaired (“underspecified”) is tense; subject-verb agreement and mood are well-preserved. The Interpretable Features’ Impairment Hypothesis (IFIH) (Fyndanis et al., 2012) predicts categories involving integration processes (e.g., tense, mood, negation) to be more impaired than categories that do not involve integration processes (e.g., agreement). The Tree Pruning Hypothesis (TPH) (Friedmann & Grodzinsky, 1997) states that the syntactic tree is pruned at a specific node, usually tense, with all nodes/categories above the pruning site deleted/inaccessible and all nodes below intact. To reliably test these accounts, one should test agrammatic speakers on a wide range of (morpho)syntactic phenomena/categories. In this study, we investigate the ability of Italian-speaking agrammatic individuals to produce subject-verb agreement, tense, mood, and sentential negation. A sentence completion task (SCT) tapping agreement and tense, a SCT assessing mood, and a constituent ordering task tapping negation were administered to eight native speakers of Italian with chronic agrammatic aphasia and eight controls. Results are presented in Table 1. The control group performed better than the aphasic group on all four conditions. Both groups showed similar patterns of performance, with better performance on agreement and tense than on mood. Negation was better preserved than agreement, tense, and mood in the aphasic group, but in the control group negation was not different from any other category. At the individual level, five agrammatic participants exhibited the same pattern of performance (agreement/tense/negation>mood). At the group level, the results of the agrammatic participants are not consistent with any of the hypotheses discussed here. Contrary to the TUH, participants performed better on tense than on mood. The DMH cannot explain the observed, selective impairment of categories involving inflectional alternations (tense/agreement>mood). Results do not support the TPH, as the higher the category in the syntactic hierarchy (Neg>T(future/past)>M) (Cinque, 1999; Zanuttini, 2001), the better the performance of agrammatic participants. Lastly, results are at odds with the IFIH, because negation (+integration processes) is better preserved than agreement (-integration processes). Analogous results are observed at the individual level. None of the available hypotheses can account for the patterns of performance of all the agrammatic participants. Their results, together with the production results of other agrammatic speakers in the literature, show that all possible patterns can be observed in agrammatism, and that a unitary account of the disorder is unlikely to succeed. We suggest that subject-specific characteristics (e.g., site/type/volume of brain damage, type/severity of language impairment, education, age) and language-specific properties of functional categories (e.g., syntactic hierarchy, interpretability/involvement of integration processes, frequency) may interact in determining the way in which (morpho)syntactic impairments manifest themselves across agrammatic speakers and languages
Nasal function before and after rapid maxillary expansion in children: A randomized, prospective, controlled study.
No full textObjectives: Children can well detect and respond to odours in order to have information about food and environment. Rapid Maxillary Expansion seems to improve dental and skeletal crossbite and increase nasal patency correcting oral respiration in children. A previous pilot study suggested that Rapid Maxillary Expansion may lead to improved N-Butanol olfactory thresholds, and peak nasal inspiratory flow values (PNIF). The aim of the present study was to prospectively evaluate olfactory threshold, nasal flows and nasal resistances in children aged from 6 to 11 years before and after Rapid Maxillary Expansion, comparing treated children with a control group of similar age, growth stage (prepubertal) and transversal skeletal deficiency.
Methods: N-butanol olfactory thresholds, anterior active rhinomanometry (AAR) and PNIF were measured in 11 children (6-11 years) before (T0), immediately and 6 months after Rapid Maxillary Expansion application (T1 and T2 respectively), and in a control group of 11 children (6-11 years) whose members remained under observation for the period of the study.
Results: Considering the study group, PNIF values improved at T1 respect to the T0 values (p = 0.003), while T2 values were significantly higher than T0 ones (p = 0.0002). N-Butanol Olfactory Threshold significantly improved at each control (p = 0.01, p = 0,01 and p = 0.0003, for T1 vs T0, T2 vs T1, T2 vs T0 respectively). No differences on AAR values were found during the six months follow-up in this group. Considering the control group, no significant differences were found for any of the considered variables during the time of the study. Comparing the two groups, there was a significant increase of PNIF values in the study group compared to the control group (p = 0.003) at T1, which was even more evident six months after Rapid Maxillary Expansion (p = 0.0005). This improvement was not shown by AAR values. N-Butanol Olfactory Threshold showed a significant improvement at T2 respect to T1 (p = 0.002) and T0 (p = 0.0005).
Conclusion: Rapid Maxillary Expansion seems to significantly improve the respiratory capacity of treated patients, at least in terms of PNIF, and their olfactory function, measured by N-Butanol Olfactory Threshold Test. Further studies should be performed to evaluate if also changes in nasal resistances, measured by AAR, could occur, maybe considering a larger group of subjects and possibly using 4-phase rhinomanometry in order to evaluate the effective resistances during the entire breath
- …
