Any induced noise would be present in equal amounts and in identical polarity on each of the balanced signal conductors, so the two signals ’ difference from each other would be unchanged.

Any conductor, be it a loop, a coil or simply a piece of plate metal, that is placed in this field will have eddy currents induced in it thus creating an opposing magnetic field, in accordance with Lenz's law.

Any conductor, be it a loop, a coil or simply a piece of plate metal, that is placed in this field will have eddy currents induced in it thus creating an opposing magnetic field, in accordance with Lenz's law.

Any number of caenophidian snakes can be induced to sidewind on artificial smooth surfaces, though difficulty in getting them to do so and their proficiency at it vary greatly.

Any matrix induced norm satisfies the inequality || A || ≥ | λ | for any eigenvalue λ, because || A || ≥ || Ax ||/|| x ||

Any induced norm satisfies the inequality

Any distortion induced by the enclosure or the woofer itself is immediately corrected by the feedback loop.

Any unwanted external noise or unwanted RF energy induced on the wire from external energy sources will be induced in both wires at the same time and equally in magnitude and direction.

Any appreciable slope on the surface will have induced slumping and erosion but we have a plateau so the slopes were not originally great.

* Faraday's law of induction: Any change in the magnetic environment of a coil of wire will cause a voltage ( emf ) to be " induced " in the coil.

Any well-formed part of a graph is a subgraph.

Any subgraph P in node n may be copied into any node depending on n. Likewise, any subgraph P in node n may be erased if there exists a copy of P in some node ancestral to n ( i. e., some node on which n depends ).

# Any node in D can reach any other node in D by a path that stays entirely within D. That is, D induces a connected subgraph of G.

Any price-accounting, calculation and aggregation could not even occur without the 7 concepts of value equivalence, value comparability, value transferred, conserved value or constancy of value, value used up, depreciated or destroyed ( in general, reduction of value ), value increase and newly created value.

Any collection of objects and morphisms defines a ( possibly large ) directed graph G. If we let J be the free category generated by G, there is a universal diagram F: J → C whose image contains G. The limit ( or colimit ) of this diagram is the same as the limit ( or colimit ) of the original collection of objects and morphisms.

Any directed graph generates a small category: the objects are the vertices of the graph, and the morphisms are the paths in the graph ( augmented with loops as needed ) where composition of morphisms is concatenation of paths.

Any nonplanar graph has as minors either the complete graph, or the complete bipartite graph, but the Petersen graph has both as minors.

Any ten-vertex Hamiltonian 3-regular graph consists of a ten-vertex cycle C plus five chords.

Any undirected graph may be made into a DAG by choosing a total order for its vertices and orienting every edge from the earlier endpoint in the order to the later endpoint.

Any directed graph may be made into a DAG by removing a feedback vertex set or a feedback arc set.

Any square matrix can be viewed as the adjacency matrix of a weighted directed graph, with representing the weight of the arc from vertex i to vertex j.

Any of these equations can be plotted on a graph.

Any linear code can be represented as a graph, where there are two sets of nodes-a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy.

Any graph is homomorphically equivalent to a unique core.

A graph coloring is an assignment of one of k colors to a graph G so that the endpoints of each edge have different colors, for some number k. Any coloring corresponds to a homomorphism from G to a complete graph K < sub > k </ sub >: the vertices of K < sub > k </ sub > correspond to the colors of G, and f maps each vertex of G with color c to the vertex of K < sub > k </ sub > that corresponds to c. This is a valid homomorphism because the endpoints of each edge of G are mapped to distinct vertices of K < sub > k </ sub >, and every two distinct vertices of K < sub > k </ sub > are connected by an edge, so every edge in G is mapped to an adjacent pair of vertices in K < sub > k </ sub >.

Any finite graph has a finite ( though perhaps exponential ) number of distinct simple cycles, and if the graph is embedded into three-dimensional space then each of these cycles forms a simple closed curve.

Any closed curve within the plane bounds a disk below the plane that does not pass through any other graph feature, and any closed curve through the apex bounds a disk above the plane that does not pass through any other graph feature.

Any Bayesian network or Markov random field can be represented as a factor graph.

Any organism that falters or misperceives the signals or weakens is done.

Any information we have here in Taiwan is at your disposal ''.

Any claimant whose claim is denied, or is approved for less than the full amount of such claim, shall be entitled, under such regulations as the Commission may prescribe, to a hearing before the Commission, or its duly authorized representatives, with respect to such claim.

Any alteration of one of these factors is distortion, although we generally use that word only for effects so pronounced that they can be stated quantitatively on the basis of standard tests.

Any musician playing Beethoven here, where Beethoven was born, is likely to examine his own interpretations with special care.

Any action is understood to create " seeds " in the mind that sprout into the appropriate results ( Pāli vipaka ) when they meet the right conditions.

** Any union of countably many countable sets is itself countable.

Any information may be conveyed by an analog signal ; often such a signal is a measured response to changes in physical phenomena, such as sound, light, temperature, position, or pressure.

Any quantity of energy absorbed by the electron in excess of this amount is converted to kinetic energy according to the conservation of energy.

Any breach of these laws is a criminal offence and can lead to fine of up to £ 5, 000 or six months in prison.

The prohibition against retaliation or coercion applies broadly to any individual or entity that seeks to prevent an individual from exercising his or her rights or to retaliate against him or her for having exercised those rights ... Any form of retaliation or coercion, including threats, intimidation, or interference, is prohibited if it is intended to interfere.

Any word or phrase that exactly reproduces the letters in another order is an anagram.

Any work ( δW ) done must be done at the expense of internal energy U, since no heat δQ is being supplied from the surroundings.

" Any threat of war Clovis could make would only be effective if they were neighbors ; " it is nowhere written that Syagrius was handed over in 486 or 487.

Any player may declare the game over at any time during his turn if either of two conditions is true: one chain has 41 or more tiles, or there is at least one chain on the board and every chain on the board has 11 or more tiles.

Any person who is seen as a threat to civil aviation is banned from flying.

* Any ring of characteristic n is a ( Z / nZ )- algebra in the same way.

* Any ring A is an algebra over its center Z ( A ), or over any subring of its center.

* Any commutative ring R is an algebra over itself, or any subring of R.

Any form of intelligent life would do ; so, specifying carbon-based life, per se, is irrelevant.

* Any base that is water-soluble and forms hydroxide ions or the solution of a base in water.