Each node dynamically chose its own node number, according to a protocol ( originally the LocalTalk Link Access Protocol LLAP and later the AppleTalk Address Resolution Protocol, AARP ) which handled contention between different nodes accidentally choosing the same number.

Each receiving node checks the destination address of each frame, and simply ignores any frame not addressed to its own MAC.

Each node or leaf in the tree has zero or more resource records, which hold information associated with the domain name.

Each node knows only about some number of other nodes that it can reach directly ( its conceptual " neighbors "), but any node can be a neighbor to any other ; no hierarchy or other structure is intended.

Each node maintains a data store containing documents associated with keys, and a routing table associating nodes with records of their performance in retrieving different keys.

Each node is a regular computer user ; as such, they are constantly connecting and disconnecting, so the network is never completely stable.

Each node represents a concept and arcs are used to define relations between the concepts.

Each computer in the network is referred to as a node.

) Each node, on a regular basis, sends to each neighbour its own current idea of the total cost to get to all the destinations it knows of.

Each node forwards messages on behalf of the other nodes.

Each end-user gets a private line ( or leased line ) to a Frame Relay node.

Each node in the tree holds information associated with the domain name.

Each node in the structure knows of its own children and its parent.

Each node in a DQDB network maintains a pair of state variables which represent its position in the distributed queue and the size of the queue.

) Each node in the network having a specific fixed number, of nodes connected to it at the next lower level in the hierarchy, the number, being referred to as the ' branching factor ' of the hierarchical tree. This tree has individual peripheral nodes.

Each node has a set of attributes encoded with it.

Each saros series starts with a partial eclipse ( Sun first enters the end of the node ), and each successive saros the path of the Moon is shifted either northward ( when near the descending node ) or southward ( when near the ascending node ).

Each node of the tree denotes a construct occurring in the source code.

Each user of I2P runs an I2P router on their computer ( node ).

Each node only transmits loudly enough for the message to hop to the nearest node in that direction, reducing near-far problem and reducing interference to others.

Each man had a bubble to himself, privacy after the long period of enforced intimacy on board the ship.

Each player draws a tile and places it on the board.

Each side of the board has a track of 12 long triangles, called points.

Each civilian tile also has a Chinese name ( and common rough translation to English ): The 6-6 is tin ( 天 heaven ), 1-1 is dei ( 地 earth ), 4-4 is yan ( 人 man ), 1-3 is ngo ( 鵝 goose or 和 harmony ), 5-5 is mui ( 梅 plum flower ), 3-3 is cheung ( 長 long ), 2-2 is ban ( 板 board ), 5-6 is fu ( 斧 hatchet ), 4-6 is ping ( 屏 partition ), 1-6 is tsat ( 七 ) ( long leg seven ), and 1-5 is luk ( 六 ) ( big head six ).

Each article to be voted on is directed by the Board of Selectmen to an appropriate board or committee to hear and provide the original motion at Town Meeting.

Each regional office is led by a regional executive director elected by the regional board of directors.

Each subject was presented with the evidence of guilt and offered a choice between facing an academic ethics board and potentially a heavy penalty in terms of extra courses and other forfeits, or admitting guilt and accepting a lighter " sentence ".

Each player takes it in turns to send their ball at least half way round the curved board until it drops down into one of the 9 indents of the 3 x 3 grid.

Each player takes turns to mark " x " or " o " on the board.

Each faculty has a faculty board and is headed by a dean ( dekanus ).

Each player has seven letters and tries to place these down on the board to make words that link up with other words on the grid, like a crossword puzzle, so that they score as many points as possible.

Each GDX board serves 32 lines, 16 A links and 32 B links.

Each truck has one wheel that is connected to the board in such a way that each wheel can rotate independently.

Each level of government could also have an advisory board or council.

Each district also had its own board as well.

Each board has a paid district manager who acts as an interlocutor with city agencies.

Each player starts the game with two rooks, one in each of the corner squares on his own side of the board.

Each local church is governed by a body of elected elders usually called the session or consistory, though other terms, such as church board, may apply.

Each area has an identical business structure and one management team that is led by an Area Managing Partner is part of the Global Executive board.

Each edition contained a game board with a plastic stand, two game booklets ( one with instructions ) with material for 92 complete games ( 368 Main Game Questions and 92 " Audience Match " and " Head-to-Head Match " questions ), two magic slates and styli ( only of the Head-to-Head portion ), and play money.

Each town is governed by a board of selectmen elected by town voters, along with annual and periodic town meetings.

Each character design can be traced by a stylus on a digitizing board, or modified from a scanned drawing of somewhat smaller size than that once used for the pantograph, or composed entirely within the computer graphics program itself.

Each of these neighbourhoods is controlled by a Comité Consultatif ( Consultative Committee ), comprising directly elected officials and a team of municipal members, similar to a New England board of selectmen.

Each printed circuit board contained 32 chips.