402 resultados para speculative prefetching


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Includes bibliography

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The semiotics of C S. Peirce presents fundamental concepts to discover aspects of the indexing process, including representation and classes of signs. However, we still know little of its theoretical potential for subject indexing. We believe that the main difficulty in the proposals to understand the process of subject indexing based on Peircean semiotics stems from an incomplete interpretation of his semiotic system. This paper attempts to describe the contributions of Peircean semiotics to subject indexing. First, we analyze some of the concepts of the branches of semiotics, after which, we discuss strategies for conceptual approximation. Secondly, and aiming to raise the level of interlocution between the areas, we intend to argue that subject indexing is an inferential process, as explained by the second branch of semiotics. Thus, we seek to go beyond the level of speculative grammar, the first branch of semiotics, to forge a closer link with pure or critical logic, the second branch. We conclude that the indexer's work does not produce a mere reflection of what already exists in documents, but involves an instigating action to discover, through the inferential matrix, the meaning of a text in order to find the subject and the most appropriate subject added entry to the information system.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Basilar artery occlusion (BAO) is one of the most devastating forms of stroke and few patients have good outcomes without recanalization. Most centers apply recanalization therapies for BAO up to 12-24 hours after symptom onset, which is a substantially longer time window than the 4.5 hours used in anterior circulation stroke. In this speculative synthesis, we discuss recent advances in BAO treatment in order to understand why and under which circumstances longer symptom duration might not necrotize the brainstem and turn therapeutic attempts futile. We raise the possibility that distinct features of the posterior circulation, e.g., highly developed, persistent collateral arterial network, reverse filling of the distal basilar artery, and delicate plasma flow siding the clot, might sustain brittle patency of brainstem perforators in the face of stepwise growth of the thrombus. Meanwhile, the tissue clock characterizing the rapid necrosis of a typical anterior circulation penumbra will not start. During this perilous time period, recanalization at any point would salvage the brainstem from eventual necrosis caused by imminent reinforcement and further building up of the clot.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

hrsg. von Schelling

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This report addresses speculative parallelism (the assignment of spare processing resources to tasks which are not known to be strictly required for the successful completion of a computation) at the user and application level. At this level, the execution of a program is seen as a (dynamic) tree —a graph, in general. A solution for a problem is a traversal of this graph from the initial state to a node known to be the answer. Speculative parallelism then represents the assignment of resources to múltiple branches of this graph even if they are not positively known to be on the path to a solution. In highly non-deterministic programs the branching factor can be very high and a naive assignment will very soon use up all the resources. This report presents work assignment strategies other than the usual depth-first and breadth-first. Instead, best-first strategies are used. Since their definition is application-dependent, the application language contains primitives that allow the user (or application programmer) to a) indícate when intelligent OR-parallelism should be used; b) provide the functions that define "best," and c) indícate when to use them. An abstract architecture enables those primitives to perform the search in a "speculative" way, using several processors, synchronizing them, killing the siblings of the path leading to the answer, etc. The user is freed from worrying about these interactions. Several search strategies are proposed and their implementation issues are addressed. "Armageddon," a global pruning method, is introduced, together with both a software and a hardware implementation for it. The concepts exposed are applicable to áreas of Artificial Intelligence such as extensive expert systems, planning, game playing, and in general to large search problems. The proposed strategies, although showing promise, have not been evaluated by simulation or experimentation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cover title.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.