This article proposes a new perspective on the difficulties in purchasing and contracting support of research projects public institutions Brazil, which persist even after legal innovations introduced by New Legal Framework for Science, Technology, Innovation (Law 13.243/2016), were intended to simplify streamline procurement processes goods, services, supplies smooth progress scientific resear...

A total coloring of a graph G=(V,E) is an assignment colors to vertices and edges such that neither two adjacent nor incident get the same color, and, for each edge, end-points edge itself receive different colors. Any valid induces partition elements G into matchings, which are defined as subsets can take color. In this paper, we propose Integer Linear Programming models both Total Coloring Ma...

Designing a maximum power point tracking system (MPPT) can raise many questions when it comes to choosing the best converter and algorithm for job. The number of possible solutions be overwhelming, especially MPPT algorithms. New algorithms are often tested in simulation environments only, where accuracy speed single measurement (i.e., step) usually assumed sometimes unintentionally exaggerated...

the objects do not exist alone and are material. they were produced by men, which integrates the social systems. an object can be formed by other objects but also into a broader technical ensemble. technically, they are in relationship with other data such as materials, sources and forms of energy, other objects surrounding them. historians of technology believe that making the history of produ...

We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle are partitioned into two matchings canonically. A matching defines a single step, the two matchings form a single round. Processors connected by an edge of the matching perfectly balance their loads, and, if there is an excess to...

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...