Flag

(redirected from Mutex)
Also found in: Dictionary, Thesaurus, Medical, Legal, Acronyms, Encyclopedia.
Related to Mutex: semaphore, Mutex lock

Flag

A pattern reflecting price fluctuations within a narrow range, generating a rectangular area on a graph both prior to and after sharp rises or declines.

Flag

In technical analysis, a situation on a chart in which a security's price undergoes a steep rise or fall, then trades within a narrow price range. When a steep rise proceeds the narrow trading, it looks somewhat like a flag raised on a pole. Many analysts believe that when a flag occurs, the narrow trading is only temporary and will soon be followed by another steep rise or fall. That is, a rise will follow a rise and a fall will follow a fall.

flag

See triangle.
References in periodicals archive ?
LCGP reduces the number of levels in the planning graph by allowing more parallelism; mutex actions can appear in the same level if there is a feasible serialization.
The explicit proposition layers can aid mutex propagation, allowing TPSys to compute more mutexes than Temporal GraphPlan (Garrido, Onaindia, and Barber 2001).
Consequently, the measure of interaction can be seen as a continuous mutex.
output-only/input-only linear channels and output ends of mutex channels cannot be transmitted along mutex channels).
The second additional condition means that a channel containing some obligation cannot be put into a mutex channel.
The following process, which represents a counter object, shows typical use of a mutex channel.
The mutex channel st is used for keeping the internal state of the object, so the process st
The rule (T-MIN) for input prefixes on mutex channels is identical to (T-IN), except for the condition O [an element of] p, which ensures that a value is put into x in the body of the input expression:
Suppose that GRAPHPLAN is trying to generate a plan for a goal with n subgoal conjuncts, and (as in our example) it has extended the planning graph to an even level, i, in which all goal propositions are present, and none are pairwise mutex.
Thus, GRAPHPLAN must consider two sets of actions at level one--{carry; cook; wrap} and {dolly; cook; wrap}--but unfortunately, neither of these sets is consistent because carry is mutex with cook, and dolly is mutex with wrap.
Although there are no new literals present at level four, there are fewer mutex relations.
The set of constraints is defined by the mutex relations.