Sequencing of a 9.9 kb segment on the right arm of yeast chromosome VII reveals four open reading frames, including PFK1, the gene coding for succinyl-CoA synthetase (beta-chain) and two ORFs sharing homology with ORFs of the yeast chromosome VIII

A 9.9 kb DNA fragment from the right arm of chromosome VII of Saccharomyces cerevisiae has been sequenced and analysed. The sequence contains four open reading frames (ORFs) longer than 100 amino acids. One gene, PFK1, has already been cloned and sequenced and the other one is the probable yeast gene coding for the beta-subunit of the succinyl-CoA synthetase. The two remaining ORFs share homology with the deduced amino acid sequence (and their physical arrangement is similar to that) of the YHR161c and YHR162w ORFs from chromosome VIII.

Seven invertebrates new for the marine fauna of Madeira Archipelago

Ocaña and den Hartog (2002) recorded 18 species of sea anemones from Madeira archipelago. During SCUBA dives along the coasts of Madeira and Porto Santo, the present author encountered a further three sea anemone species and several other marine invertebrates not yet recorded for the marine fauna of Madeira Island. Similar to previous publications (e.g. Wirtz 1998, Wirtz 2007, Ocaña & Wirtz 2009), these findings are reported here.

Culicídeos em bromélias: diversidade de fauna segundo influência antrópica, litoral de São Paulo

OBJETIVO: Comparar a diversidade da fauna de culicídeos em bromélias de solo segundo ambientes urbano, periurbano e mata primitiva. MÉTODOS: O estudo foi realizado no município de Ilhabela, litoral norte do estado de São Paulo, em tanques de bromélias de ambientes urbano, periurbano e mata. Realizaram-se coletas de imaturos quinzenalmente, de março de 1998 a julho de 1999. A presença e freqüência de espécies nos diferentes ambientes foram comparadas com base em estimativas da diversidade para medir a riqueza, dominância e análise de variância (ANOVA). RESULTADOS: Coletaram-se 31.134 formas imaturas de mosquitos nas bromélias, distribuídas em sete gêneros e 37 espécies. O ambiente urbano registrou maior abundância, 14.575 indivíduos, seguido do periurbano com 10.987, e a mata, com o menor número de exemplares, 5.572. Foram coletadas 30 espécies no habitat urbano, 32 no periurbano e 33 na mata. As espécies dominantes foram Culex (Microculex) pleuristriatus nos ambientes urbano e periurbano, e Culex ocellatus na mata. De acordo com teste ANOVA a freqüência de mosquitos em bromélias não foi diferente entre os ambientes pesquisados (F=0,5564; p=0,5769). A diversidade de espécies na mata foi maior, e semelhante entre periurbano e urbano. CONCLUSÕES: A composição específica de culicídeos em bromélias de solo mostrou-se diversificada, sendo maior naquelas de ambiente de mata. As espécies dominantes foram Cx. (Mcx.) pleuristriatus e Cx. ocellatus.

E-sharing: development and use of learning objects repository

— In the new learning environments, built width digital technologies, the need to promote quality of education resources, commonly known as Learning Objects, which can support formal and informal distance learning, emerge as one of the biggest challenge that educational institutions will have to face. Due to the fact that is expensive, the reuse and sharing became very important issue. This article presents a Learning Object Repository which aims to store, to disseminate and maintain accessible Learning Objects.

Capacity sharing and stealing in serverbased real-time systems

A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Provably good multiprocessor scheduling with resource sharing

We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

A capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

Miocene catfishes (Ariidae,Bagridae) from Lisbon: a Nilotic (or Sudanian) type fauna

Miocene catfishes from Lisbon are dealt with. Two distinct sets of pectoral and dorsal pterygiophores are described. That from the Langhian V-b is referred to Arius sp. probably close to A. heudeloti. Another ser from the uppermost Burdigalian V-a may be ascribed to a bagrid, cf. Chrysichthys sp., identified for the first time in this region. The catfish and Lates association is sctrikingly similar to African, nilotic or sudanian ones as far as freshwaters are concerned. In marine, coastal environments, stenotherm warm-water forms (Polynemids, large barracudas and several sharks) indicate, as a model, faunas like chose from Cape Verde to northern Angola. There is some gradation for brackish waters (fig. 1). Catfishes and Lates probably migrated into the Iberian Peninsule in the lower Miocene. They are unknown after Langhian V-b except for a reappearance of Arius in the middle Tortonian VII-b. Decreasing temperatures and aridity account for local extinction at least in freshwaters. Expansion of these fishes have been made easier owing to the displacement of land masses chat narrowed or closed the marine waterway between Europe and Africa. Salinity tolerance is not necessarily the sole explanation for migration. Catfishes plus Lates associations colonized inland waters from both sides of the Paleomediterranean. Local extinction may have weighed more in the development of modern distribution patterns than migration.

Capacity sharing and stealing in dynamic server-based real-time systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

On international cost-sharing of pharmaceutical R&D

Ramsey pricing has been proposed in the pharmaceutical industry as a principle to price discriminate among markets while allowing to recover the (fixed) R&D cost. However, such analyses neglect the presence of insurance or the fund raising costs for most of drug reimbursement. By incorporating these new elements, we aim at providing some building blocks towards an economic theory incorporating Ramsey pricing and insurance coverage. We show how coinsurance affects the optimal prices to pay for the R&D investment. We also show that under certain conditions, there is no strategic incentive by governments to set coinsurance rates in order to shift the financial burden of R&D. This will have important implications to the application of Ramsey pricing principles to pharmaceutical products across countries.