131,403 research outputs found
Isolement de Salmonella nairobi d\u27un zébu Indu-Brasil en République du Zaïre
No full textSee PDF file of the article.Vaya al archivo pdf del artículo.Une entérobactérie ayant les caractéristiques d\u27une salmonelle est isolée en culture pure des prélèvements provenant d\u27un taurillon de race Indu-Brasil, mort quinze jours après le déclenchement d\u27une entérite aiguë. L\u27identification révèle qu\u27il s\u27agit de Salmonella nairobi. La seule salmonelle isolée jusque là dans cette région était S. dublin. Il s\u27agit du premier isolement de S. nairobi au Zaïre et du second isolement en Afrique à partir de l\u27espèce bovin
Independent strong domination number of indu-bala product of graphs
No full textA set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical methods, we determine the independent strong domination number of Indu-Bala product of simple connected graphs and null graphs
Independent strong domination number of indu-bala product of graphs
No full textA set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical methods, we determine the independent strong domination number of Indu-Bala product of simple connected graphs and null graphs
MeSH term explosion and author rank improve expert recommendations
No full textInformation overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
Desafios na implementação do modelo MPS-BR: a percepção de um gestor da área de qualidade
No full textEste Trabalho de Conclusão de Curso foi julgado aprovado para a obtenção do Título de “Bacharel em Tecnologias da Informação e Comunicaçao”, e aprovado em sua forma final pelo Curso de Graduação em Tecnologias da Informação e Comunicação.O software é um produto muito importante na era da informação e comunicação. A oferta e o sucesso deste produto no mercado está diretamente relacionado à sua qualidade. Neste sentido, empresas buscam por meio da certificação uma forma de demonstrar sua qualidade. A avaliação do processo de desenvolvimento certifica que o software está de acordo com um conjunto de critérios básicos essenciais. No Brasil e no mundo a maior parte das empresas do setor de software são de pequeno e médio porte. No país existe o Programa MPS-B R (Melhoria de Processos do Software Brasileiro) com modelos de referência voltado para a realidade das industrias de software nacionais. Neste contexto, o objetivo deste trabalho é identificar os principais desafios enfrentados pelas empresas de pequeno e médio porte que buscam a certificação MPS-BR. Um estudo de pesquisa qualitativa e de caráter descritivo foi realizado por meio de uma entrevista para verificar a percepção de um gestor da área de qualidade. Os dados obtidos foram analisados a partir de outros estudos sobre o tema. Entre os principais resultados destacam-se: melhorias no produto final obtidas por meio da certificação, a resistência das equipes de trabalho ao processo de normatização, a relação custo-benefício da certificação para pequenas e médias empresas
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Distance spectrum of Indu–Bala product of graphs
No full textAbstractThe D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by G1▾G2 and is obtained from two disjoint copies of the join G1∨G2 of G1 and G2 by joining the corresponding vertices in the two copies of G2. In this paper we obtain the distance spectrum of G1▾G2 in terms of the adjacency spectra of G1 and G2. We use this result to obtain a new class of distance equienergetic graphs of diameter 3. We also prove that the class of graphs Kn¯▾Kn+1¯ has integral distance spectrum
"Closing the R&D Gap, Evaluating the Sources of R&D Spending"
No full textBoth spending and tax policies have been implemented in the United States with the goal of stimulating private sector research and development (R&D). Karier questions whether current R&D policy, especially the research and experimentation tax credit, can contribute to closing the gap between nondefense expenditures on R&D in the United States and such expenditures in other countries, such as Japan and Germany. He also explores possible changes to our current R&D policy to make it more effective.
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
