A good example is a local area network ( LAN ): Any given node in the LAN has one or more physical links to other devices in the network ; graphically mapping these links results in a geometric shape that can be used to describe the physical topology of the network.

Any such change will be detected by the reachability protocol which each node runs with its neighbors.

Any packet headed to that destination arriving at either node will loop between the two, hence the name.

Any other client can then retrieve the contents of the file by again hashing to produce and asking any DHT node to find the data associated with with a message.

Any set of sequences can be represented as paths in a tree, by forming a tree node for every prefix of a sequence and making the parent of one of these nodes represent the sequence with one fewer element ; the tree formed in this way for a set of strings is called a trie.

Any node whose lower bound is greater than can be discarded.

* Any unique node is a potential bottleneck

Any other node receiving the RTS or CTS frame should refrain from sending data for a given time ( solving the hidden node problem ).

Any node that does not receive a prepare message before the timeout expires aborts the commit.

Any node that has more cannibals than missionaries on either bank is in an invalid state, and is therefore removed from further consideration.

Any node can be a publisher, subscriber, or both simultaneously.

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 can launch a process and have that process migrate to the node with the best performance characteristics for executing that particular process.

# 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 Digimon that receives a fatal wound will dissolve into infinitesimal bits of data.

Any data not relevant to a receiving device is ignored.

The blitter's block copying mode takes zero to three data sources in memory, called A, B and C, performs a programmable boolean function on the data sources and writes the result to a destination area, D. Any of these four areas can overlap.

* Extensibility: Any database system has its own predefined set of data types which we can use to build new types ( see Complex Objects ), but a purely extensible system is designed such that there are no logical differences between built-in ( or ' primitive ') data types and ' custom ' data types, though there may be strong differences in the way the two are implemented.

Any input / output equipment may be considered data storage equipment if it writes to and reads from a data storage medium.

Any type of communications or information technology wiring will be considered premises wiring, including telephone, computer / data, intercom, closed-circuit television, etc.

Any digital modulation scheme uses a finite number of distinct signals to represent digital data.

Any input or output device that is used to transmit or receive data can be classified as a terminal component.

Any drive failure destroys the array, and the likelihood of failure increases with more drives in the array ( at a minimum, catastrophic data loss is almost twice as likely compared to single drives without RAID ).

Any data written to the database must be valid according to all defined rules, including but not limited to constraints, cascades, triggers, and any combination thereof.

Any time that 5 consecutive 1-bits appear in the transmitted data, the data is paused and a 0-bit is transmitted.

Any data not included between the whiskers should be plotted as an outlier with a dot, small circle, or star, but occasionally this is not done.

Any mechanism by which tektites are created must explain chemical data that suggest that parent material from which tektites were created came from near-surface rocks and sediments at an extraterrestrial impact site.

Any statement that is not within an RCU read-side critical section is said to be a quiescent state, and such statements are not permitted to hold references to RCU-protected data structures.

Any programming tool can be used to write programs that link data from internal variables and nodes for external data files.

Any claims must be backed up by " readily available data.

Any set of data can be represented by a string of symbols from a finite ( say, binary ) alphabet.

# Any experience which is inconsistent with the organization of the structure of the self may be perceived as a threat, and the more of these perceptions there are, the more rigidly the self structure is organized to maintain itself.

Any market structure characterized by a downward sloping demand curve has market power – monopoly, monopolistic competition and oligopoly.

Eugene Odum, a founder of ecology, stated: " Any unit that includes all of the organisms ( ie: the " community ") in a given area interacting with the physical environment so that a flow of energy leads to clearly defined trophic structure, biotic diversity, and material cycles ( i. e.: exchange of materials between living and nonliving parts ) within the system is an ecosystem.

Any linear-chain heteropolymer can be said to have a " primary structure " by analogy to the usage of the term for proteins, but this usage is rare compared to the extremely common usage in reference to proteins.

Any document element could be given new " methods " ( capabilities ), and could respond to changes in the content or structure of the document itself.

# Any human-made structure used or intended for supporting or sheltering any use or continuous occupancy, or

Any monoid ( any algebraic structure with a single associative binary operation and an identity element ) forms a small category with a single object x.

Any body or structure that is capable of being charged, either with static electricity or by an electric current exhibits capacitance.

Any structure — an instance of a particular species — is associated with some set, and there are often many possible structures for the same set.

Any error can cause the structure to fail and break apart.

Any such structure imposes some precedent ideas of the subject matter, since ' existing discourses ' are being imported and can continue within the conference, e. g. two people who agree on a matter strongly can all attend the same sub-circles and continue to back each other up, reducing the chance that either of them will learn anything, or that anyone can learn anything from them.

Any one of these three lengths can be written in terms of any other using the fine structure constant:

Any structure implicit in the finite entropy against a quantum description could then be totally washed out by the huge injection of uncertainty this projection represents.

Any application that isn ’ t signed by a reputable author and attempts to modify other application ’ s structure ’ s is usually classified as ‘ potentially malicious ’.

Any number of dimensions can be added to the structure such as Store, Cashier, or Customer by adding a foreign key column to the fact table.

Any covering space of a differentiable manifold may be equipped with a ( natural ) differentiable structure that turns p ( the covering map in question ) into a local diffeomorphism – a map with constant rank n.

Any series of graphics calls to QuickDraw can be recorded in a structure called a Picture.

* Any principal bundle with structure group G gives a groupoid, namely over M, where G acts on the pairs componentwise.

Any given atom will vibrate around some mean or average position within a crystalline structure, surrounded by its nearest neighbors.

Any church, regardless of denominational affiliation, may participate in the clusters and affinity groups under the new structure.

Any other ordered pair of symbols may be used instead of 0 and 1 ; the logical structure of the Thue – Morse sequence does not depend on the symbols that are used to represent it.

Any of these conditions implies the existence of a unique compatible complex structure.

Any data in a structure after a buffer is impossible to protect with canaries ; thus, programmers must be very careful about how they organize their variables and use their structures.