Boolean value

In a conventional expert system, the only rules to fire are those for which the condition is met. In a fuzzy system, all of the rules fire because all are expressed in terms of membership, not the Boolean values of true and false. Some rules may involve membership values only of zero, so have no effect, but they must still be inspected. Implicitly, we assume an or between every pair of rules, so the whole rule base is... 

We regard as objects primitive concepts such as dates, numbers, and the two Boolean values. You can alter an attribute (such as maxSize) to refer to a different number, but the number itself does not change. Useful basic and immutable attributes of numbers include next and previous, so that, for example, 5. next = 6. (Many tools and languages like to separate primitives from objects in some fundamental way. The separation is useful for the practicalities of databases and the like, but for most modeling there is no point in this extra complication.)... 

A Boolean value indicating if a given Source has already been observed or not... 

Another Boolean value to indicate if attacks on multiple virtual machines were performed in sequence or simultaneously. 

When other numeric data types are converted to Boolean values, 0 becomes False while all other values become True. When Boolean values are converted to other data types. False becomes 0 while True becomes -1. 

A partial listing of the methods operating on the class atom is also shown in Table II. Methods with the compute prefix (e.g., compute-parent-groups, compute-hybridization, and compute-formal-charge) are used to evaluate attribute values. Predicate methods (i.e., methods returning a Boolean value) are represented by the -p suffix. These methods are... 

K, to transform a set of potential reaction sites, utilizing instances (e.g., Kj,i) of ab-initio-operator. Successful applications of operators generate new instances of atom-bond-configuration. Kf, to return a Boolean value of true, when the encoded set of prespecified conditions are achieved, and false, otherwise. 

V, the verifier s algorithm, is a probabilistic interactive algorithm with one input-output port. Its initial input is a pair (par, K) with par as above, and it outputs a Boolean value acc. It has to work in time polynomial in the input par alone. (Hence it is polynomial-time when regarded as an interactive algorithm where only par is the initial input and K may be sent by the attacker.)... 

The whole initialization is successful iff the signer has never been caught cheating and at least one of the risk bearers has taken part successfully. For this, define Boolean values idssig out,i be TRUE iff the signer was not caught cheating in the i-th phase, i.e.,... 

We will not go into all details of this C++ code but will focus on the evaluation part. The function Molecule AromaticRing requires an input of the ring atoms (ring) and returns a Boolean value (bool) of true or false. The first statement checks whether the Hiickel rule applies or not the system returns false (and leaves the function) if the modulus of n-electrons - 2 divided by 4 is not zero. The second and third... 

Returns a boolean value true if an expression is normal-ordered and false otherwise. 

The voxel model is comparable with a three-dimensional bitmap. The name is an artificial word for volume element or volumetric pixel. The geometric object is represented by a number of cubes of the same size. The cubes are located on an equidistant three-dimensional matrix (Fig. 1). The actual structure for representation of this model is an array of Boolean values, indexed by integers for x-, y-, and z-position. If 0 is considered no material and 1 as material, the... 

Sensors are available as either "level transmitters" that send a proportional analog signal or "level switches" that send a Boolean value. Both types of products are available with a two wire 4-20 mA interface. Level switches are also available with contact switch output. 

A model M for C is given by the tuple < T, To, S, So, >. T is a sequence of timepoints with initial time To. Similarly, S is a sequence of states with initial state So- T isa set of mappings, r/ij where each riij is a valuation function assigning Boolean values to the elements of A at time i and state j. 

Given the set IB containing the Boolean values 0,1, and a finite set A of elements, then each junction / B" -> A is a pseudo Boolean function. 

Arithmetic decision diagrams are mappings from boolean values into the integer domain. They can be used to model bit-level (boolean) functionality as well as word-level (arithmetic) circuit specifications. Examples of arithmetic decision diagrams are BMD (Bryant et al. 1995), MTBDD (McMillan el al. 1993), EVBDD(Sastry et al. 1992), HDD (Zhao et al. 1995) or K BMD (Drechsler et al 1996). Arithmetic decision diagrams have been successfully applied where (vectors of) boolean decision diagrams fail, e.g. for verification of the multiplier function (Chen et al 1994) or in word-level model checking (Zhao et al 1996). 

A boolean value indicating whether the Change has been vahdated by a user. 

Typically one is not interested in generating all graphs, but just certain subsets, often denoted as classes of graphs. Such a class of graphs is characterized by one or more constraints or restrictions (see e.g. [47]). In mathematical terms a constraint is a mapping R from the set of graphs on n nodes onto the set of Boolean values true, false ... 

The super class Safety Related Element adds a boolean value for safety relevance to the inheriting instance. The dependence and derivation between the safety requirements can be tracked by the associated requirement link. 

A C-observer (more precisely a commitment observer) is a small C function that evaluates some property of the system under test. It returns a boolean value indicating whether the observed property is valid or invalid. C-observer code can check conditions on interface objects of the system under test, i.e., inputs, outputs, calibration variables and display variables. An example of an observer is shown here ... 

The platform model was extended with an Agent layer in order to be able to relate a threat with the agent that initiates the attack. The node associated with an agent is very simple, it contains an event T initiate that represents attack initialisation. Whenever an attack is initiated, the output of the agent node is set to the Boolean value true and this value is propagated to the items located in the zone where the agent is located. 

Each event is associated with a Boolean value. For a model element, the OK mode is defined as true if no event model dysfunction is true. 

If there are only a few variants of entering information the value should be selected from a preset list (by a mouse) rather than typed through a text box (from the keyboard). We did it by asking the user to choose one of three units, m, inin, and cm, but not type from the keyboard. If a list contain only two choices (yes or no, the alternative question) we can use a check box (entering the Boolean value), for... 

The entries of the ansa-existence matrix are Boolean values ... 

Each of the 15 functions computes a Boolean value using consecutive data points. A given function will compute TRUE (i.e. output a 1 in the current network coding) if there exists at least one set of such consecutive points that satisfy the geometric relation specified. That is, (xi,yi), (x2,j/2), (a 3,J/3) are x,y coordinate points, which can be labelled data points A, B and C. Having consecutive data points reflects the temporality of the input. Note that (xi,yi) and (x3,j/3) would not constitute consecutive data points. 

---