If the air density and temperature are the same above and below a wing, a naive application of the ideal gas law requires that the pressure also be the same.

If each of the features makes an independent contribution to the output, then algorithms based on linear functions ( e. g., linear regression, logistic regression, Support Vector Machines, naive Bayes ) and distance functions ( e. g., nearest neighbor methods, support vector machines with Gaussian kernels ) generally perform well.

If there are classes and if a model for each can be expressed in terms of parameters, then the corresponding naive Bayes model has ( k − 1 ) + n r k parameters.

If sets are implemented as sorted lists, for example, the naive algorithm for will take code proportional to the length m of S times the length n of T ; whereas a variant of the list merging algorithm will do the job in time proportional to m + n.

If TS ( T )< WTS ( O ), a naive approach would be to abort T because its write action conflicts with the most recent write of O and is out of timestamp order.

If the keysize is | k |, this attack uses only 2 < sup > k + 1 </ sup > encryptions ( and decryptions ) ( and O ( 2 ^ k ) memory in case a look-up table have been built for the set of forward computations ) in contrast to the naive attack, which needs 2 < sup > 2 · k </ sup > encryptions but O ( 1 ) space.

If we naively recompute the hash value for the substring, this would require Θ ( m ) time, and since this is done on each loop, the algorithm would require Ω ( mn ) time, the same as the most naive algorithms.

If the desired result is a best value from that interval then a naive approach would be to take the center of the interval as the value, which is what was specified in the original Marzullo algorithm.

' So he said, ' If you want to play naive, do it with someone else, not with me.

If a scene is to look relatively realistic and predictable under virtual lighting, the rendering software should solve the rendering equation.

If a pixel-by-pixel ( image order ) approach to rendering is impractical or too slow for some task, then a primitive-by-primitive ( object order ) approach to rendering may prove useful.

If there is little rearrangement of radiosity objects in the scene, the same radiosity data may be reused for a number of frames, making radiosity an effective way to improve on the flatness of ray casting, without seriously impacting the overall rendering time-per-frame.

If all layers of an image change regularly but a large number of layer still need to be composited ( such as in distributed rendering ), the commutativity of a compositing operator can still be exploited to speed up computation through parallelism even when there is no gain from pre-computation.

If the < code ><! DOCTYPE html ></ code > declaration is not included, various browsers will revert to " quirks mode " for rendering.

* « If the same plain text sequence is given to disparate rendering processes, there is no expectation that rendered text in each instance should have the same appearance.

If the bacterium produces the enzyme β-lactamase or the enzyme penicillinase, the enzyme will hydrolyse the β-lactam ring of the antibiotic, rendering the antibiotic ineffective.

If a responder begins rendering aid, he must not leave the scene until it is necessary to call for needed medical assistance, a rescuer of equal or higher ability takes over, or continuing to give aid is unsafe.

Referring to the enemy's power supplies he wrote ( as Axiom 3 ): " If their destruction or paralysis can be accomplished they offer a means of rendering the enemy utterly incapable of continuing to prosecute the war ".

If, for example, a scene is rendering this texture in a space of 40 × 40 pixels, then either a scaled up version of the 32 × 32 ( without trilinear interpolation ) or an interpolation of the 64 × 64 and the 32 × 32 mipmaps ( with trilinear interpolation ) would be used.

If granted, this relief could have required USL to terminate many existing licenses and destroy a huge number of copies of the BSD code, potentially including copies used in its owner AT & T's own global telephone network, until such time as it was able to comply with the University's license requirements, rendering any victory in the original case Pyrrhic at best.

If additional words are necessary to clarify the sense of the translation, the literal rendering is set forth in a footnote.

If a designer knew precisely about the display's electron beams and aperture grille, subpixel rendering might have some advantage.

If the audio hardware supports hardware mixing ( also known as hardware buffering or DirectSound hardware acceleration ), DirectSound buffers directly to the rendering device.

There is a teaching story inherent in Néel's experience as it is evocative of the English rendering of the famous instruction of Zen Master Linji Yixuan: " If you meet the Buddha on the road, kill him.

If the game map rendering could be turned off completely, all players could be seen moving around in what appears to be empty space.

If the same team wins both the Taça Guanabara and the Taça Rio, it is automatically crowned tournament champion rendering Finals unnecessary.

If Jiāozhǐ was intended to characterise " opposite pillar " because this was what people of the Northern directions called the people of the Southern directions, then the feet of the North side " chân phía Bắc " and feet of the South side " chân phía Nam " must oppose each other, therefore rendering it impossible for the feet of a person to cross or intersect each other " không phải thực là chân người " giao " nhau ".

If one makes the analogy of taking a photograph to rendering a 3D image, the surface of the film is the image plane.

If true, this may mean that dapina is an ( also unattested ) Macedonian rendering of what would be written " ταπεινή ", tapeinē ( humble, lowly, brought low ), in standard Attic.

If it is not " apparent from the four corners ” of the opinion that the judgment rests on an independent state law rule, then, unless it is “ necessary or desirable ” to obtain clarification from the state court itself, the Supreme Court will presume that the decision rested in part on federal law, thereby rendering it reviewable.

If the behavior is not modeled correctly then the unit tests may register a pass even though a failure would occur at run time under the same conditions that the unit test is exercising, thus rendering the unit test inaccurate.

If they don't then for the algorithm to be effective it must provide a set of rules for extracting a square root.

If a polynomial time algorithm calls as a subroutine polynomially many polynomial time algorithms, the resulting algorithm is still polynomial time.

If a " weak " character is followed by another " weak " character, the algorithm will look at the first neighbouring " strong " character.

If the algorithm is symmetric, the key must be known to the recipient and sender and to no one else.

If the algorithm is an asymmetric one, the enciphering key is different from, but closely related to, the deciphering key.

If one key cannot be deduced from the other, the asymmetric key algorithm has the public / private key property and one of the keys may be made public without loss of confidentiality.

If a suitably sized quantum computer capable of running Grover's algorithm reliably becomes available, it would reduce a 128-bit key down to 64-bit security, roughly a DES equivalent.

If implemented using remainders of Euclidean division rather than subtractions, Euclid's algorithm computes the GCD of large numbers efficiently: it never requires more division steps than five times the number of digits ( base 10 ) of the smaller integer.

If a is smaller than b, the first step of the algorithm swaps the numbers.

If the arguments are both greater than zero then the algorithm can be written in more elementary terms as follows:

If R is a Euclidean domain in which euclidean division is given algorithmically ( as is the case for instance when R = F where F is a field, or when R is the ring of Gaussian integers ), then greatest common divisors can be computed using a form of the Euclidean algorithm based on the division procedure.

If the algorithm is unable to reduce A to triangular form, then A is not invertible.

If a large, b-bit number is the product of two primes that are roughly the same size, then no algorithm has been published that can factor in polynomial time, i. e., that can factor it in time O ( b < sup > k </ sup >) for some constant k. There are published algorithms that are faster than O (( 1 + ε )< sup > b </ sup >) for all positive ε, i. e., sub-exponential.

If the true function is simple, then an " inflexible " learning algorithm with high bias and low variance will be able to learn it from a small amount of data.

If the desired output values are often incorrect ( because of human error or sensor errors ), then the learning algorithm should not attempt to find a function that exactly matches the training examples.

* Robustness: If the model, cost function and learning algorithm are selected appropriately the resulting ANN can be extremely robust.

If using efficient sorting such as mergesort or heapsort this is an O ( n log n ) average and worst-case algorithm.

The algorithm for deciding this is conceptually simple: it constructs ( the description of ) a new program t taking an argument n which ( 1 ) first executes program a on input i ( both a and i being hard-coded into the definition of t ), and ( 2 ) then returns the square of n. If a ( i ) runs forever, then t will never get to step ( 2 ), regardless of n. Then clearly, t is a function for computing squares if and only if step ( 1 ) terminates.

If we apply the run-length encoding ( RLE ) data compression algorithm to the above hypothetical scan line, we get the following:

If not, is there an algorithm to determine how many are required?

If the user wanted to see a font at another size, the Font Manager would find the closest match and apply a basic scaling algorithm.

If a particle visits every point on its trajectory then the motion is an algorithm for each point.

If two processes attempt to enter a critical section at the same time, the algorithm will allow only one process in, based on whose turn it is.