30 resultados para Search Engine Indexing

em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"


Relevância:

80.00% 80.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Ciência da Informação - FFC

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The present article aims at reflecting about the discursive practices of writing and reading on the net, more specifically about the writing and reading methods used by the undergraduate and graduated teachers, based on an internet search engine. It’s of interest to investigate: i) the (hyper) textual relations established in the context thought as permitted by the electronic resources; ii) the discursive marks that arise (are arisen) in a singular way of reading (and/or writing). The set of material was produced during a university extension course about reading and cyberspace, whose context consisted of a drawing production of the reading process on an internet search engine, on the basis of the signifier “apple”. Based on the French Discourse Analysis and assumptions from the New Literacy Studies, we intended to discuss the operating procedures of the internet search and the effects of meanings produced by the subject during his/her reading/writing process.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Studies on ethics in information organization have deeply contributed to the recognition of the social dimension of Information Science. The subject approach to information is linked to an ethical dimension because one of its major concerns is related to its reliability and usefulness in a specific discursive community or knowledge domain. In this direction, we propose, through an exploratory research design with qualitative and inductive characteristics, to identify the specific terminology that Brazilian indexing languages allow for terms relating to male homosexuality. We also analyzed the terms assigned to papers published in the Journal of Homosexuality, Sexualities and Journal of Gay & Lesbian Mental Health between the years 2005 to 2009. From this analysis of terms and the Brazilian indexing languages, we see (1) the Brazilian context, (2) imprecision in the terminology, (3) indications of prejudices disseminated by political correctness, (4) biased representation of the subject matter, (5) and the presence of figures of speech.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.