For the family is the simplest example of just such a unit, composed of people, which gives us both some immunity from, and a way of dealing with, other people.

For example, suppose a man wearing a $200 watch, driving a 1959 Rolls Royce, stops to ask a man on the sidewalk, `` What time is it ''??

For example, there are persons who are in physical science, in the field of mineralogy, trained in crystallography, who use only X-rays, applying only the powder technique of X-ray diffraction, to clay minerals only, and who have spent the last fifteen years concentrating on the montmorillonites ; ;

For example, No. 56 printed the patent giving the Electoral Prince the title of Duke of Cambridge.

For example, he captured some persons from York County, who with teams were taking to Philadelphia the furniture of a man who had just been released from prison through the efforts of his wife, and who apparently was helpless to prevent the theft of his household goods.

For example, even the most successful executive lives in a two-room apartment while ordinary people rent space in the stairwells of office buildings in which to sleep at night ; ;

For example, in the third chapter of Matthew, verses 13-16, describing the baptism of Jesus, the 1611 version reads:

For example: 1.

For example, it probably will be necessary for the Corps to have authority to pay medical expenses of volunteers.

For example, the importance of the Regulus 2, a very promising aerodynamic ship-to-surface missile designed to be launched by surfaced submarines, was greatly diminished by the successful acceleration of the much more advanced Polaris ballistic missile launched by submerged submarines.

For example, the interest of past members of the Foundation's Advisory Board remains such that they place their knowledge and judgments at our disposal much as they had done when they were, formally, members of that Board.

For example, out of the social evils of the English industrial revolution came the novels of Charles Dickens ; ;

For example, a 12-to-one engine would power a supersonic VTOL fighter.

For example: Af.

For example: Af.

For example, for the problem Af, 10 from 25 equals 15, then 6 from 15 equals 9.

For example: Af.

For example, let's consider a standard 283 cubic inch Chevy Aj.

For an example let's dream up an engine that has a final combustion chamber volume of 5 cubic inches and a cylinder volume of 45 cubic inches.

For example, a Browning trap version of the Superposed over/under, the Broadway ( from $350 up, depending on grade ), differs from standard models in that it is equipped with a full beavertail fore end, a cushion recoil pad and a barrel-wide ventilated rib for fast sighting.

For example, the Chamber of Commerce of Gatlinburg, Tennessee, sponsors special camera tours into the Great Smoky Mountains to get pictures of the profusion of wild flowers flourishing in these wooded regions.

For example, the Friday after Thanksgiving can be substituted for Washington's birthday.

For example, the officials of Poughkeepsie town ( township ) where the project is located think highly of it because it simplifies their snow clearing problem.

For example, don't pay in a truck policy for medical coverage that you may be paying for in a health and accident policy.

For example: If your bodily injury claims start payment after the first $250, a 25% premium saving is often made.

For any such square the middle corner of these will be called the vertex of the square and the corner not on the curve will be called the diagonal point of the square.

For the vertex at Af, these values will be denoted by Af.

For a uniform polyhedron, the face of the dual polyhedron may be found from the original polyhedron's vertex figure using the Dorman Luke construction.

For example, the case described in degree 4 vertex situation is the configuration consisting of a single vertex labelled as having degree 4 in G. As above, it suffices to demonstrate that if the configuration is removed and the remaining graph four-colored, then the coloring can be modified in such a way that when the configuration is re-added, the four-coloring can be extended to it as well.

For x in X, the vertex group consists of those ( g, x ) with gx = x, which is just the isotropy subgroup at x for the given action ( which is why vertex groups are also called isotropy groups ).

For example, GPUs through the 1990s were mostly non-programmable and have only recently gained limited facilities like programmable vertex shaders.

For a regular n-gon inscribed in a unit-radius circle, the product of the distances from a given vertex to all other vertices equals n.

For a given source vertex ( node ) in the graph, the algorithm finds the path with lowest cost ( i. e. the shortest path ) between that vertex and every other vertex.

: Note: For ease of understanding, this discussion uses the terms intersection, road and map — however, formally these terms are vertex, edge and graph, respectively.

* For any three vertices in a tree, the three paths between them have exactly one vertex in common.

For example, in the theory of quivers, the ( analogue of the ) unit interval is the graph whose vertex set is

For a Lipschitz continuous function, there is a double cone ( shown in white ) whose vertex can be translated along the graph, so that the graph always remains entirely outside the cone.

For each triangle edge that is intersected by the image plane ’ s edge, that is, one vertex of the edge is inside the image and another is outside, a point is inserted at the intersection and the outside point is removed.

For example, in graph theory, a connected graph is one from which we must remove at least one vertex to create a disconnected graph.

For example, given a graph G =( V, E ), the shortest path p from a vertex u to a vertex v exhibits optimal substructure: take any intermediate vertex w on this shortest path p. If p is truly the shortest path, then the path p < sub > 1 </ sub > from u to w and p < sub > 2 </ sub > from w to v are indeed the shortest paths between the corresponding vertices ( by the simple cut-and-paste argument described in CLRS ).

In this method, one determines, for each set S of vertices and each vertex v in S, whether there is a path that covers exactly the vertices in S and ends at v. For each choice of S and v, a path exists for ( S, v ) if and only if v has a neighbor w such that a path exists for ( S − v, w ), which can be looked up from already-computed information in the dynamic program.