text:
|Publication number
|Publication type
|Application number
|Publication date
|Dec 6, 1988
|Filing date
|Dec 31, 1985
|Priority date
|Dec 31, 1985
|Fee status
|Publication number
|Donald B. Gennery, Brian Wilcox
|Original Assignee
|The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (8), Non-Patent Citations (6), Referenced by (32), Classifications (16), Legal Events (5)
|External Links: USPTO, USPTO Assignment, Espacenet
The invention described herein was made in the performance of work under a NASA contract, and is subject to the provisions of Public Law 96-517 (35 USC 202) in which the Contractor has elected not to retain title.
This invention relates to a video image processor, and more particularly to a programmable pipelined image processor for feature extraction (PIFEX).
Computerized vision systems require an enormous amount of data processing. This seems to be especially true for the low-level tasks in which the data are still in the form of an image. Often thousands of fundamental operations must be performed for each pixel (picture element), and typically there are around a hundred thousand pixels per image frame. Real time processing at a rate of 30 or 60 images per second therefore may require a processing speed of around 1010 operations per second. Conventional computer architectures (of the Von Neumann type) are not currently capable of approaching these speeds. The fastest Von Neumann computers are two or more orders of magnitude too slow for typical problems in real-time computer vision. There is therefore a need for a real-time image processor capable of feature extraction and other low-level vision analysis.
The solution to this large data processing need is generally thought to be some form of parallel processing, so that a large number of computational elements operating simultaneously can achieve the necessary rates. (For reviews of parallel processors see D. Etchells, "A Study of Parallel Architectures for Image Understanding Algorithms," in ISG Report 104 (R. Nevatia, Editor), pp. 133-176, University of Southern California, Oct. 19, 1983, and A. P. Reeves, "Parallel Computer Architectures for Image Processing," Computer Vision, Graphics, and Image Processing 25 (1984), pp. 68-88.) There are several ways in which the necessary parallelism can be achieved.
One way is to use a multiple-instruction stream multiple-data-stream (MIMD) system, which consists of many Von Neumann machines operating on different parts of the same problem and communicating their results to each other. Such a multiprocessor system may be appropriate for the high-level portion of powerful future vision programs. However, for the low-level portions of the vision task, such a system is not cost-effective. This is because low-level vision tasks contain computations that are performed almost identically over the entire image, and it is wasteful to use the full power of general-purpose processors to do these repetitive tasks.
Another type of parallel computer is the single-instruction stream multiple-data-stream (SIMD) system. In such a system arithmetic units for each portion of the image frame (perhaps each pixel) perform the same operations simultaneously under the control of a master processor. If there is an arithmetic unit for each pixel, such a system is fairly convenient to use and is very fast. However, the cost is high. For example, a parallel processor described by J. Strong, "NASA End to End Data System, Massively Parallel Processor," Goddard Space Flight Center, May 30, 1980, was built for NASA by Goodyear Aerospace and is possibly the most powerful computer of this type so far. It contains 16,384 arithmetic units, which occupy 2048 chips, and costs several million dollars. It is arranged as a 128-by-128 array, and can add the elements of one 12-bit array to those of another 12-bit array in 3.7 microseconds, which corresponds to 4.4�109 operations per second.
Another approach is a pipelined-image processor, which processes the pixels sequentially as they are scanned usually, but not necessarily, at the normal video rate. The parallelism can then be built into the device so that it performs more than one arithmetic operation for each pixel. Some of these operations can be done simultaneously on corresponding pixels in parallel data paths, and some can be done in a pipelined fashion in which one operation is being done on one pixel while the next operation is being done on the previous pixel, which already has had the first operation performed on it. Also no time is spent decoding instructions while this processing is going on, because the same operations are performed over and over, at least for one frame interval, and no access time for the data is needed.
This pipelined type of system can be far less expensive than an SIMD system, because it requires a number of processing elements depending on the number of steps in the algorithm instead of depending on the size of the image, and the former is usually a few orders of magnitude less than the latter. It usually is not as fast as an SIMD system, but it can process an entire image in one frame interval (normally 1/30 second or 1/60 second), and is thus suitable for real-time applications. If the number of steps in the algorithm exceeds the number of processing elements, separate passes can be made to complete the algorithm. This requires extra frame intervals and perhaps additional time for reprogramming the device.
Pipelined-image processors have been built in the past. However, they are very restricted in the kind of computations that they can do. They do not include the full range of desired computations, and what they do include often is not fully programmable. Furthermore, their computational power falls short of what is needed for many tasks. What is desired is a programmable system that will perform elaborate computations whose exact nature is not fixed in the hardware and that can handle multiple images in parallel.
The main problems in designing such a programmable pipelined system are in choosing a set of fundamental operations that are sufficiently general and that can be implemented in the desired quantity at a reasonable cost, and finding a practical way of interconnecting these operators that allows sufficiently general programability.
In accordance with this invention, image-pipelining processing of the data is accomplished using an array of identical programmable computing modules interconnected in a two-dimensional toroidal arrangement; the computing elements employing convolvers, neighborhood comparison operators, binary function operators using look-up tables with interpolation, input selectors, and output selectors. The input and output selectors are used for selectively cascading computing elements from column to column in the array, selecting up to two of a plurality of rows for the input data so that data may be selectively routed through paths in the array involving different computing elements programmed to perform different operations. Although all of the computing elements in the arrays are identical, they may operate differently because of programming in the input selectors, the two convolvers that receive separate data inputs, a binary function operator that receives as many as two arguments of the binary function to be performed by the table look-up operator, a neighborhood comparison operator receiving its input from the binary function operator, and a selector which may select as the output of the computing element the output of any one of the included components, with appropriate delays. The binary function generator is implemented with limited memory capacity, and is therefore limited to fewer addressing bits than present in the convolver outputs. Therefore only the most significant bits are used to address the memory, and the less significant bits are used to interpolate the output of the look-up table. Each output includes the slopes of the function stored in the table for the two arguments (independent variables), and the least significant bits of the two arguments are multiplied by the respective slopes, and the products are added to function value read from the table.
The novel features that are considered characteristic of this invention are set forth with particularly in the appended claims. The invention will best be understood from the following description when read in connection with the accompanying drawings.
FIG. 1 illustrates a pipelined image processor in accordance with the present embodiment utilizing an array of identical modules configured as shown in FIG. 2.
FIG. 2 is a block diagram of each module in FIG. 1.
FIG. 3 illustrates a preferred embodiment for each module (having two 12-bit outputs A and B) fanned out to modules of the next column in the array.
FIG. 4 illustrates the two-dimensional toroidal interconnection topology of the modules of an array.
FIG. 5 illustrates one example of the use of a single module as a Sobel Operator with thinning.
FIG. 6 illustrates an example of an array of modules used for computation of zero crossings of Laplacian (the trace of the determinant of the matrix of second derivatives) and the Hessian (the determinant of the matrix of second derivatives, sometimes called the Gaussian curvature).
FIG. 7 illustrates the organization of the programmable binary function generator in the modules based on look-up tables with as many as two arguments and linear interpolation of the arguments.
In accordance with the concept of the invention in its broadest aspects, a pipelined image processor shown in FIG. 1 is provided with an array of programmable modules for functions that may be applied to neighbor pixels of each pixel on each pass through the processor. The new value of each pixel is determined by a process carried out by modules selectively connected in cascade under program control of a host computer (not shown). Successive ones of selected modules 1,1 through N,M (where the first digit of a pair of digits used to identify a module signifies a column number and the second digit signifies a row number in the matrix of NM modules) perform successive iterations in one pass. Central to the concept is the use of programmable modules in a two-dimensional array. For greatest flexibility in programming the system, all modules are alike.
Thus the pipelined image processor is comprised of a plurality of modules interconnected in two-dimensional toroidal form, i.e., interconnected from module to module in the horizontal dimension (as viewed in FIG. 1) back to the input, and interconnected from a module in a given row and column of the array to a module in another row of the next column for the second toroidal dimension. The modules are implemented as shown in FIG. 2.
Each module has two input selectors 10, 11, two convolvers 12, 13, a nonlinear neighborhood comparison operator 14, a binary function generator 15 implemented as an interpolated look-up table coupling the convolvers 12, 13 to the neighborhood comparison operator 14, and an output selector 16 to select, as an alternative to the output A of the neighborhood comparison operator, a second output B which may be the output of any component in the module, including the neighborhood comparison operator, as shown in FIG. 2. Thus, each module includes: two outputs, a first output A from the neighborhood comparison operator, and a second output B from a selector which may be programmed to select the output of any component within the module, including two input selectors, a first input selector 10 for selecting as an input A the output A of any one of eight modules, and the second input selector for selecting as an input B the output B any one of several modules, as illustrated in FIG. 3. Each module of a column in the array may thus feed a number of modules in the next column.
For convenience in implementing the selectors using standard logic gates, and to constrain the number of electrical contacts on each module, the fan out capability is limited to eight, i.e., each module may feed eight modules in the next column as shown in FIG. 3. The direction of main data flow is thus from left to right in FIG. 1 and back through the left column from the right column in a toroidal configuration as shown by the solid arrows for the two topologically equivalent forms illustrated in FIG. 4, where the dotted line shown represents input-output switches. Note that the flow of data is always advanced from one column to the next in the same or different row(s), but in general more to an upper (or lower) row to effectively define a helical path around the torus. Although such is not necessary conceptually, it is advanced in this way (column to column) in order to aid in fitting an algorithm into the available modules as it wraps around the torus, i.e., for convenience in programming.
The system, shown in FIG. 1 receives one or more video images as they are scanned, already in digital form, from external image buffers (not shown) or through A/D converters from TV cameras (not shown), and processes them in one or more modules. It performs pipelined operations on them as specified by a host computer (not shown) which presets the modules and feeds the results back into the image buffers. In principle, the operations include convolving with various specified functions; arithmetic functions such as addition, subtraction, multiplication, division, square root, maxima, and minima; unary table look-ups to map pixel values to new values; and nonlinear neighborhood operations to do such things as finding local maxima, minima, zero-crossings, directional maxima and minima, thinning, and growing. The delays caused by the processing are taken into account upon reloading the buffers. If sufficient processing cannot be done in one pass, the results stored in a buffer from a previous pass can be used again, but it is expected that most desired computations can be done in one pass (one frame interval plus additional pipeline delays) through the array of modules.
Although it would be desirable for some applications to have the ability to convolve the images with fairly large functions, it is impractical at present to fit such a convolver on one VLSI chip. Therefore, the present invention employs only 3-by-3 convolvers (all identical, but with individually programmable weights), as disclosed in a copending application Ser. No. 06/815,106 titled CONVOLVER filed concurrently. However, using several of these in various series and parallel combinations can produce the effect of using larger convolvers. This is practical because of the fact that the desired functions usually are one of two types: small functions (3-by-3) used for such purposes as differentiation, and large functions used for smoothing. The best smoothing function normally is some approximation to the Gaussian function, and the Gaussian function has the advantages that it can be factored into one-dimensional functions and that it can be approximated by convolving several small functions in series. Either fact (especially the latter) allows a good approximation to the two-dimensional Gaussian function of moderate size to be produced by using a plurality of 3-by-3 convolvers in cascade. Any one-dimensional function can be produced easily from these small convolvers. (Although any two-dimensional function can be produced in principle, it is impractical for large functions that do not have special properties such as the Gaussian function.) It should be noted that the precision of digitized images usually is only 8 bits, but that more precision can be created by smoothing. For this reason and because of the increase in dynamic range produced by some computations, 12 bits are used in the input and output of the convolvers (as described in detail in the aforesaid copending patent application).
One approach to the arithmetic functions is to have separate hardware adders, multipliers, etc. Another approach is to use a table look-up which can be programmed for any particular function desired. Each of these approaches has its advantages. The advantages of the separate hardware functions are that they require less circuitry and that they can be reprogrammed quickly by changing the switches that connect them. Several of the functions could fit on one VLSI chip, whereas one look-up table requires many chips (far too many if high precision is needed). The advantages of the look-up table are its uniformity, its greater ease of design (it uses standard memory chips, which are becoming quite cheap), and the fact that any possible function can be programmed into it, whereas with the other approach any function not included in the design (such as trigonometric functions, for example) would have to be approximated by using a considerable number of simpler functions. Another advantage is that the unary (single argument) look-up table is not needed, since its purpose is subsumed by the binary (two argument) look-up table. The precision needed in the final results of these functions for typical images is about 8 bits. Because of the greater dynamic range produced by such operations as multiplying, intermediate results need greater precision (preferably 16 bits) since only fixed-point computations are practical. However, the table look-up approach allows a compression of the dynamic range with such operations (perhaps by using the square root or logarithm), so that 12 bits are adequate. A direct binary 12-bit table look-up is impractical, but doing a binary 8-bit look-up with linear interpolation for the low-order 4 bits is reasonable, as described in detail hereinafter with reference to FIG. 7.
The nonlinear neighborhood operations are performed by a neighborhood comparison operator described in more detail in a copending application Ser. No. 06/815,099 titled NEIGHBORHOOD COMPARISON OPERATOR filed concurrently, which compares the nine pixels in the neighborhood to a fixed threshold or (for the surrounding eight pixels) to the center pixel to produce nine bits of information. Two more bits are appended to indicate the odd-even pixel/line position of each central pixel in a 3�3 window. A function of these eleven bits is then used to determine whether the 12-bit output of the operator is to be (1) the center pixel, (2) the bit-wise logical OR of the surrounding eight pixels, or (3) a function of these eleven bits of information. By suitably programming the operator, a variety of operations (some of which are mentioned above) can be performed.
The economic advantages of having many identical units connected in a regular way outweights (in the near term, at least) the inefficient use of extra hardware on each unit. Thus, it is desirable to have general, programmable elements of each basic type (convolvers, binary functions, and neighborhood comparison operators) on each module. Since the binary function needs two data paths, the smallest module would have two inputs feeding a binary function, which in turn feeds a convolver and then a neighborhood operator. However, examination of simple algorithms (e.g., edge detection) suggests that two convolvers (one on each input) ahead of the binary function is much more useful than having a convolver after the function. This is especially true since the convolvers are relatively inexpensive compared to the amount of memory needed for the large look-up table used in the current approach to the binary functions, so that adding a convolver does not greatly increase the cost of the modular unit. The two inputs to the binary function via convolvers are denoted AC and BC in FIG. 2.
The interconnection of the modular units requires some flexibility in the routing from one stage of the pipeline to the next. If one visualizes columns of modular units, all synchronized, as being a stage of the pipeline, then a flexible interconnection scheme to the next column requires that the output of a module in some row be selectively routable to some other row in the next column. A connection to all possible rows need not be provided, only enough to allow a rich interconnection architecture for a wide variety of possible algorithms. Assuming that the modules are plugged into a passive backplane which provides only connecting wires (as is the common practice in both general-purpose and special purpose electronic equipment and computers), then some input selectors must be added to the modules. Since it was deduced above that each card should have two input channels (to the two convolvers), a different selector should choose which of several inputs should be fed to each of the two convolvers. Selectors built from standard logic circuits are available for 2, 4, 8 or 16 alternatives. Since a 12-bit data path has been chosen, the number of wires to be selected is 12 times 2 inputs times the number of alternative inputs to the selector. For 8 alternatives, this is 192 wires, which is a reasonable maximum for single input to a single circuit board. Furthermore, examination of possible algorithms indicates that a choice among 8 inputs provides sufficient flexibility to make efficient use of each module in the array. Note that the outputs of the two selectors 10 and 11 may be selected as the output B by the selector 16.
The outputs of the two convolvers 12, 13 are hardwired to the two inputs of the binary function 15, its output is hardwired to the input of the neighborhood comparison operator 14, and its output forms the output A of the module. (The convolvers and the neighborhood comparison operator include the line buffers needed to enable them to operate on 3-by-3 windows.) To allow a significant increase in programming flexibility at a minor cost in terms of increased hardware, an additional selector 16 provides the B output. This output selector 16 passes any one of the intermediate values produced in the module (inputs to the convolvers as selected by the input switches, the convolver outputs, the binary function output, or the neighborhood comparison operator output). The pipeline delay (including extra line buffers) is equalized on this output to match the A output which passes through delay in a convolver and delay in a neighborhood operator. (This is an important feature of the invention; there is automatic delay equalization as the signals propagate through the stages of the pipeline.)
All data paths between modules and between operators and functions within a module, consist of 12 bits each. In order to have one more bit of precision when negative numbers are not needed, each operator on each module can treat these quantities either as unsigned integers or as positive or negative two's-complement integers, as specified by the programming information. Since the binary functions are completely programmable, the representation in these integers is up to the programmer.
In cases where not all of the operations in a particular module are needed, it is, of course, possible to program any of them to be identity operations. For a convolver, this means using unity for the center weight and zero for the others, for the binary function it means having the contents of the table look-up be the same as one of its inputs (with unity slope for interpolation), and for the neighborhood comparison operator it means passing the center value in all cases.
The present system is capable of pipeline processing data at rates of up to 8,000,000 pixels per second (in each of the parallel paths through the module interconnection network). It will handle images with up to slightly more than 2000 pixels per line. (The latter limit is determined by the size of the line buffers. There is no limit on the number of lines in a frame.)
The system is programmed from a host computer (not shown) through a direct memory access (DMA) interface (also not shown). This will permit each binary function (which uses a quarter-megabyte look-up table) to be programmed in under 200 milliseconds. The binary functions on all system modules which are to be loaded with the same function can be programmed simultaneously in two 64K 16-bit DMA transfers. This is a great benefit, since a system array with several hundred modules would likely only have a dozen or two different binary functions, so that the programming time is a few seconds rather than many tens of seconds. The look-up table for each different neighborhood comparison operator is similarly programmed in a 2K DMA transfer. The convolver weights, input selection, and other miscellaneous data are programmed in an 80-word DMA burst for each module needing reprogramming.
The system modules are connected in a two-dimensional pattern chosen so that the switch selections inside the modules produce flexibility in programming. The outputs from the modules in each column in the pattern are connected to the inputs of modules in the next column, so that the main data flow is considered to be from left to right. In this way, synchronism is achieved, since all of the modules in a given column (except for the wrap-around of rows discussed below) are processing corresponding pixels at the same time. Different rows of modules correspond to parallel data paths, but these different paths can communicate with each other because of the branching of the connections from one column to the next.
In the branching patterns considered, the A outputs from modules in one column connect only to A inputs in the next column, and B outputs connect only to B inputs, as shown in FIG. 3. (Although this restriction is not necessary, it seems to be convenient.) A fanout of four has been tried, with the number of rows upwards from output to input being -1, 0, 2, 7 for A and -5, 0, 1, 3 for B. An alternate pattern considered was -1, 0, 2, 6 for A and -2, 0, 1, 2 for B. The former of these, at least, works fairly well for simple algorithms, but a fanout of only four is quite restrictive for more complicated algorithms. Therefore, a fanout of eight is preferred. That is, each A or B output branches to eight different inputs, and thus the A and B inputs on a module each receive eight signals, one of which is selected in the module, as described above. The fanout pattern chosen, at least initially, is -3, -1, 0, 1, 2, 3, 4, 8 for A and -2, -1, 0, 1, 2, 3, 5, 9 for B. This pattern is shown in FIG. 3. (It should be noted that the fanout pattern has more connections going to upper rows than lower rows. This helps to take advantage of the two-dimensional toroidal topology referred to hereinbefore and described in more detail below.)
Each column may be considered to wrap around a toroid of either form shown in FIG. 4 to form a loop, and the fanout pattern shown in FIG. 3 is cycled invariantly around the loops. This feature is convenient for algorithms that just barely fit, since crossing the boundary that otherwise would exist at the top and bottom may help in making the necessary connections. More importantly, each row also wraps around to form a loop in the direction of the main data flow along rows of modules. The fanout pattern continues cyclically around these loops also, except that after one particular column there are switches that can break each connection between the output of a module and the fanout to the next column, so that outputs can be extracted from the particular column and inputs can be inserted in the next column of the two-dimensional toroidal array. This row wrap-around feature is important for efficient coding of algorithms that vary greatly in the width and length of data paths that they require, since an algorithm that requires a long path can spiral around several times, using only as many parallel data paths at any point as it needs. The upward bias of the fanout helps in spiraling the paths in one direction in order to avoid collisions. A simple example of this is shown in FIG. 6. (Since, on different passes around, the pixels have been delayed by different amounts, ordinarily data from these different paths should not be combined with each other.)
The two wrap-around features combined cause the interconnections of the modules to have the topology of a torus as noted hereinbefore and shown in FIG. 4. In practice, there is a cut around the torus at one place (shown by dotted line) to allow inputs (from image buffers or TV cameras) and outputs (to image buffers) to be selectively connected, under control of the host computer.
A typical system has five columns and about 16 rows. Thus, it is possible to code algorithms that vary from requiring a data path 16 modules wide and 5 modules long to requiring a data path one module wide and 80 modules long, without having to use separate passes through the system on separate frame times.
In all of the examples shown in this section, details of the programming--such as the scale factors of quantities--are omitted for simplicity. For example, the weights in the convolvers are assumed to be integers and the shifts for scaling are omitted. In practice, appropriate shifts must be included to prevent fixed-point overflow and to prevent excessive loss of significance in the 12-bit data. (The figures in this section all illustrate the components in each module according to FIG. 2.)
Many low-level vision and image-processing algorithms can be performed. These include such things as filtering, detection of edges by various methods, detection of corners and vertices, bridging gaps in lines, shrinking lines, detection of the intersections of lines, comparison of different images to detect changes or motion, simple texture measurement, stereo area correlation, and estimation of surface color. Some of these, such as complicated vertex detectors or stereo correlation, would require many modules. However, for simplicity only a few algorithms that can be done in a small number of modules will be given as examples here.
The first example is the Sobel edge detector plus thinning, which requires only one module, as shown in FIG. 5. The two convolvers 12 and 13 compute the two components of the gradient (different weights are possible here, the ones shown are for the true Sobel operator), the binary function 15 then computes the magnitude of the gradient, and the neighborhood comparison operator 14 finds the ridges (one-dimensional maxima), so that the resulting nonzero values are only one pixel wide. If the direction of the edge also is wanted, another module in parallel with this one could be used, with the same convolver weights but with the double-argument arc-tangent as the binary function. Note that the same input is selected for the two convolvers, i.e., inputs A and B are made the same. This is done in a preceding module (not shown) where the output selector selects as the output B the output A.
The next example is the computation of the zero crossings of the Laplacian (the trace of the determinant of the matrix of second derivatives) often used in edge detection and stereo correlation and the Hessian (the determinant of the matrix of second derivatives, sometimes called the Gaussian curvature) often used in corner and vertex detection. These operators are ordinarily applied to smoothed data. FIG. 6 shows six iterations of convolving with the averaging function for smoothing, which results in a fairly good approximation to smoothing with a Gaussian function with a standard deviation of 2 pixels. The Laplacian (L) and the Hessian (H) of the result are then computed, and two neighborhood comparison operators and one arithmetic function are used to find the zero crossings of the Laplacian. Letters are used to represent the following:
I Identify operator
A Upper input to function (output of A convolver)
B Lower input to function (output of B convolver)
Z If at least one neighbor tests opposite to the center pixel on the <0 test, output is the center pixel; otherwise, output is the maximum possible positive value (211 -1)
V Valley operator: If any of the patterns shown or their rotations exists: where > means "greater than center" and blank means "don't care," output is a constant; otherwise, output is zero
(The first neighborhood comparison operator produces approximate zero-crossings; the other two steps force them to be only one pixel wide, by choosing the pixels closest to zero.)
Several variations are possible in this example. Better 3-by-3 approximations to the derivative operators are available than the simple ones shown here, and different smoothing operators could be used. Slightly more smoothing could be done without using more than two rows, since the extra two columns on the second time around could be used. Considerably heavier smoothing could be done by using more rows. If sufficient modules are not available, it is, of course, possible to perform some of the computations on one pass through the system, to save the results in an image buffer, and then to perform the remaining computations on a subsequent frame time. However, if substantial reprogramming of the system is needed to do this, considerably more time than one frame time may be needed. If the computations to be performed on subsequent passes are identical, as they would be in this example for the smoothing, no reprogramming is needed.
The various binary and unary arithmetic functions indicated in the examples are carried out by a binary function implemented as a look-up table with linear interpolation, which will now be described with reference to FIG. 7. It is designed to handle 12-bit A and B inputs with a memory having a 16-bit address input for the two inputs.
The need for a 12-bit data path was discussed above. Given this, the design of the linear interpolation hardware is constrained by commercially available components. There is only one type of memory chip which offers the 120-nanosecond cycle times needed for real-time pipeline processing and the density which makes a single circuit card for the module feasible--the 64K CMOS static memory chip. These are organized as 8K by 8; thus blocks of memory using these chips must have an output which is a multiple of 8 bits. Since a 12-bit function value plus two slopes for interpolating both arguments must be looked up in this memory, one has a reasonable choice between a 24-bit-wide table (12 plus two 6-bit slopes), a 32-bit-wide table (12 plus two 10-bit slopes), or 40-bit-wide table (12 plus two 14-bit slopes). A reasonable compromise between the size of the table and the precision of the result for nonlinear functions calls for interpolating the least significant 4 bits of each argument, requiring a total of 16 bits to address the table. A 16-bit value can take on 64K possibilities, so the table must be organized as 64K by 24, 32, or 40. The choice between these three possibilities is determined by the maximum slope which one wants to allow for the stored function. To maintain 1-bit accuracy over the 4-bit interpolation range (16 values), the slope in the look-up table must be able to take on values as low as 1/16 (a change of one bit over the interpolation range). This means 4 bits to the right of the binary point. Thus, the remaining bits in the slope are to the left of the binary point and represent slopes greater than unity. One of these remaining bits must be reserved for the sign of the slope. A 6-bit slope will then have one significant bit to the left of the binary point, for a maximum slope of 2 (actually 1 15/16, all ones). A 10-bit slope can represent slopes as high as 32, and a 14-bit slope can represent values as high as 512. Since mapping 12-bit values onto 12-bit values implies average slopes of about 1 for monotonic functions and 2 for symmetric functions, a maximum of 4 seems very limiting. On the other hand, a slope of 512 would allow the entire 4096 value range of the 12-bit output to be overflowed well within a single interpolation interval, which seems rather excessive. Thus, a 32-bit-wide table is chosen.
These considerations lead to the unique table-look-up design of FIG. 7. The eight most significant bits of each function argument are used to address a 64K by 32 look-up table 20. Twelve of the output bits represent the function value at each of the 64K values. The remaining twenty bits represent two slopes, each ten-bit signed (two's complement for negative) values, with 4 bits to the right of the binary point. Each of these slopes is multiplied in multipliers 21 and 22 by the four least significant bits of the appropriate function argument, and the two products are added in a binary adder 23. The four least significant bits of the result are discarded, and the remaining portion (ten significant bits plus duplicated sign bit for two's-complement arithmetic) are added in a binary adder 24 to the 12-bit function value looked up in the table to produce the final interpolated output.
Although particular embodiments of the invention have been described and illustrated herein, it is recognized that modifications and variations may readily occur to those skilled in the art. Consequently, it is intended that the claims be interpreted to cover such modifications and variations.
|Cited Patent
|Filing date
|Publication date
|May 19, 1980
|Jan 18, 1983
|Environmental Research Institute Of Michigan
|Image analyzer with cyclical neighborhood processing pipeline
|Sep 28, 1981
|Mar 27, 1984
|Hughes Aircraft Company
|Real-time ordinal-value filters utilizing partial intra-data comparisons
|May 14, 1982
|Aug 7, 1984
|Environmental Research Institute Of Michigan
|Image analyzer for processing multiple frames of image data
|Aug 29, 1983
|Aug 14, 1984
|U.S. Philips Corporation
|Multiprocessor computer system for executing a splittable algorithm, notably a recursive algorithm
|Oct 14, 1982
|Oct 23, 1984
|Kokusai Denshin Denwa Kabushiki Kaisha
|Echo control system
|Apr 28, 1983
|Nov 20, 1984
|Sternberg Stanley R
|Neighborhood transformation logic circuitry for an image analyzer system
|Mar 11, 1982
|Nov 20, 1984
|Environmental Research Institute Of Michigan
|Parallel pipeline image processor
|Jan 26, 1982
|Feb 5, 1985
|Hughes Aircraft Company
|Segregator functional plane for use in a modular array processor
|Etchells, D., "A Study of Parallel Architectures for Image Understanding Algorithms", ISG Report, pp. 133-176, USC, 10/19/83.
|Etchells, D., A Study of Parallel Architectures for Image Understanding Algorithms , ISG Report, pp. 133 176, USC, 10/19/83.
|Reeves, A. P., "Parallel Computer Architectures for Image Processing", Comp. Vis., Gra., and Img. Proc., 25, 1984, pp. 68-88.
|Reeves, A. P., Parallel Computer Architectures for Image Processing , Comp. Vis., Gra., and Img. Proc., 25, 1984, pp. 68 88.
|Strong, J., "NASA End to End Data System, Massively Parallel Processor", Goddard Space Flight Center Report, 5/30/80.
|Strong, J., NASA End to End Data System, Massively Parallel Processor , Goddard Space Flight Center Report, 5/30/80.
|Citing Patent
|Filing date
|Publication date
|Sep 5, 1989
|Jul 3, 1990
|Texas Instruments Incorporated
|Fault-tolerant serial video processor device
|Nov 3, 1988
|Jan 1, 1991
|Kabushiki Kaisha Toyota Chuo Kenkyusho
|Image processor system having multifunction look-up table units
|Jul 19, 1990
|Dec 31, 1991
|Eastman Kodak Company
|Distributed digital signal processing system using standard resolution processors for a high resolution sensor
|Dec 23, 1988
|Mar 31, 1992
|Hardy Tyrone L
|Method and apparatus for video presentation from a variety of scanner imaging sources
|Oct 1, 1990
|Apr 7, 1992
|U.S. Philips Corporation
|Data processing module and video processing system incorporating same
|Dec 17, 1990
|Aug 25, 1992
|Moler Keith E
|Method and apparatus for detection of parallel edges in image processing
|Sep 21, 1989
|Feb 16, 1993
|Loral Aerospace Corp.
|Multi-function pre-processor for target tracking
|Oct 31, 1989
|Mar 22, 1994
|Rockwell International Corporation
|System which cooperatively uses a systolic array processor and auxiliary processor for pixel signal enhancement
|Jun 5, 1992
|Jun 14, 1994
|Texas Instruments Incorporated
|Serial video processor
|Dec 14, 1992
|Aug 23, 1994
|Medical Instrumentation And Diagnostic Corporation
|Three-dimensional computer graphics simulation and computerized numerical optimization for dose delivery and treatment planning
|Aug 28, 1992
|Oct 11, 1994
|Medical Instrumentation And Diagnostics Corporation
|Three-dimensional beam localization apparatus and microscope for stereotactic diagnoses or surgery mounted on robotic type arm
|Mar 31, 1992
|Mar 21, 1995
|Hardy; Tyrone L.
|Method and apparatus for video presentation from scanner imaging sources
|May 12, 1993
|Oct 17, 1995
|Intel Corporation
|System and method of pattern recognition employing a multiprocessing pipelined apparatus with private pattern memory
|Jan 2, 1996
|Sep 24, 1996
|Intel Corporation
|Apparatus and method for a four address arithmetic unit
|Jan 13, 1994
|Feb 11, 1997
|Sony Corporation
|Image processor
|Feb 4, 1991
|Jun 17, 1997
|Medical Instrumentation And Diagnostics Corp. (Midco)
|Method and apparatus for management of image data by linked lists of pixel values
|Jul 18, 1996
|Nov 18, 1997
|Fujitsu Limited
|Reconfigurable torus network having switches between all adjacent processor elements for statically or dynamically splitting the network into a plurality of subsystems
|Nov 15, 1991
|Feb 3, 1998
|International Business Machines Corporation
|Modular and infinitely extendable three dimensional torus packaging scheme for parallel processing
|Oct 7, 1994
|Feb 10, 1998
|Intel Corporation
|Pattern recognition system using a four address arithmetic logic unit
|May 2, 1996
|Mar 17, 1998
|Fujitsu Limited
|Torus networking method and apparatus having a switch for performing an I/O operation with an external device and changing torus size
|Oct 23, 1995
|Oct 20, 1998
|Intel Corporation
|Memory transfer apparatus and method useful within a pattern recognition system
|Dec 9, 1996
|Mar 9, 1999
|Intel Corporation
|Memory transfer apparatus and method useful within a pattern recognition system
|Feb 19, 1998
|Mar 21, 2000
|Acuity Imaging, Llc
|System and method for extracting image data
|Mar 22, 1996
|May 29, 2001
|Tyrone L. Hardy
|Method and apparatus for archiving and displaying anatomico-physiological data in a normalized whole brain mapping and imaging system
|Nov 13, 2002
|Jan 2, 2007
|Nagaoka & Co., Ltd.
|Optical bio-discs and fluidic circuits for analysis of cells and methods relating thereto
|Jan 16, 2001
|Oct 3, 2002
|Sharp Laboratories Of America, Inc.
|Method of three dimensional color vector determinant for automatic kanji and chinese character detection and enhancement
|Apr 30, 2003
|Oct 23, 2003
|Venolia Daniel Scott
|Zooming controller
|Nov 13, 2002
|Nov 27, 2003
|Valencia Ramoncito Magpantay
|Optical bio-discs and fluidic circuits for analysis of cells and methods relating thereto
|Feb 27, 2007
|Sep 20, 2007
|Seiko Epson Corporation
|Color correction circuit, image display apparatus including the same, and color correction method
|Jun 30, 2014
|Oct 23, 2014
|Yong Zhang
|Optimized fast hessian matrix computation architecture
|Jan 18, 1994
|Aug 17, 1994
|Sony Corporation
|Image processor
|Jan 18, 1994
|Oct 26, 1994
|Sony Corp
|Image processor.
|U.S. Classification
|382/303, 382/307, 382/279, 700/2
|International Classification
|Cooperative Classification
|European Classification
|Dec 31, 1985
Owner name: CALIFORNIA INSTITUTE OF TECHNOLOGY THE, PASADENA,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:GENNERY, DONALD B.;WILCOX, BRIAN;REEL/FRAME:004508/0713
Effective date: 19851204
Owner name: UNITED STATES OF AMERICA AS REPRESENTED BY THE ADM
Free format text: ASSIGNS THE ENTIRE INTEREST SUBJECT TO LICENSE RECITED;ASSIGNOR:CALIFORNIA INSTITUTE OF TECHNOLOGY;REEL/FRAME:004508/0711
Effective date: 19851204
|May 28, 1992
|Fee payment
Year of fee payment: 4
|Jul 16, 1996
|Maintenance fee reminder mailed
|Dec 8, 1996
|Lapse for failure to pay maintenance fees
|Feb 18, 1997
|Expired due to failure to pay maintenance fee
Effective date: 19961211


text:
Build web apps that scale, create engaging mobile apps, and integrate simply. All app types rely on the scalable and flexible Web App platform which allows developers an optimized full life cycle experience from app design to app maintenance. The App Service capabilities allow developers to focus on their code and reach a stable, highly scalable production state quickly. With the API and Logic App features, developers can build real-world enterprise applications bridging barriers between business solutions as well as on premise to cloud integration.Sponsored Listing
- OSI-Approved Open Source (13)
- Creative Commons Attribution License (1)
- Linux (14)
- Modern (14)
- Mac (11)
- Windows (10)
- Solaris (8)
Grouping and Descriptive Categories (7)
- All BSD Platforms (6)
- All POSIX (6)
- 32-bit MS Windows (3)
- 64-bit MS Windows (3)
- All 32-bit MS Windows (3)
- 32-bit MS Windows (2)
- OS Independent (2)
- Classic 8-bit Operating Systems (1)
- OS Portable (1)
- Project is OS Distribution-Specific (1)
- Project is an Operating System Distribution (1)
- Project is an Operating System Kernel (1)
Top Apps
- Audio & Video
- Business & Enterprise
- Communications
- Development
- Home & Education
- Games
- Graphics
- Science & Engineering
- Security & Utilities
- System Administration
Tux Paint
An award-winning drawing program for children ages 3 to 1216,487 weekly downloads
fre:ac - free audio converter
Audio converter and CD ripper for various formats6,566 weekly downloads
Dolibarr ERP - CRM
Open source erp and crm web software for business4,915 weekly downloads
Upgrade your business phone system and save. Our Hosted VoIP service empowers businesses like yours with over 40 built-in features, customizable to your business need. Enhance your productivity and communications easily and effectively. Activation and on boarding is simple, and our support teams and tools are available 24/7. Ready to move to the reliable Vonage Cloud? Speak to a VoIP specialist today.Sponsored Listing
gPhoto is a program and library framework that lets users download pictures from their digital cameras. The libgphoto2 library gives you access to hundreds of models of digital cameras on several platforms. GIT repo and Issue tracker lives at https://github.com/gphoto/ these days.1,387 weekly downloads
GTK+ comic book viewer.609 weekly downloads
It's time to re-imagine backup and recovery. Protect your business in the cloud or on premise with powerful backup software that assures recovery of your virtual, physical and cloud data, systems and applications. Experience the difference. Start your free trial today.Sponsored Listing
As your employees increasingly use a mix of applications from the office or the road, measuring and quantifying end user experience has become nearly impossible. Endpoint Agents track performance and user experience of browser-based internal and external apps, including SaaS applications such as Salesforce and Office 365. You can even monitor virtual desktops in your environment. Sign up for a free trial to see Endpoint Agent in action.Sponsored Listing
Enigma is a puzzle game193 weekly downloads
Read, write and edit metadata805 weekly downloads
Building High Quality ERP and Accounting Software for SMB & SME171 weekly downloads
Comix is a user-friendly, customizable image viewer. It is specifically designed to handle comic books, but also serves as a generic viewer. It reads images in ZIP, RAR or tar archives (also gzip or bzip2 compressed) as well as plain image files.88 weekly downloads
Library and GUI for Apple's iPod
gtkpod is a platform independent GUI for Apple's iPod using GTK. It allows you to import your existing iTunes database, add songs, podcasts, videos and cover art, and to edit ID3 tags. libgpod is a library allowing direct access to the iPod's conte94 weekly downloads
doorGets CMS - Responsive/Bootstrap PHP
doorGets CMS PHP offers a free, Open-source Website solution183 weekly downloads
PXell - Online project management.19 weekly downloads
ttyrpld - tty capturing daemon
ttyrpld is a multi-OS kernel-level TTY keylogger and screenlogger with (a)synchronous replay support. It runs on Linux, Solaris, FreeBSD, NetBSD and OpenBSD.3 weekly downloads

subset: commoncrawl


text:
NFL Game Day- You're the coach, playing against your toughest rivals, selecting offensive, defensive, and special team plays. The game board features end zone magnets of all 32 teams, allowing rival coaches to battle within and across divisions and conferences, creating your own dream playoff and Super Bowl matchups. The game board resembles a realistic NFL stadium including: fans, goal posts, yardage markers, hash marks, scoreboard, and down markers. Instructions are simple and easy to learn for players of all ages.
For Ages: 9+
WARNING: CHOKING HAZARD - Small parts. Not for children under 3 years.
Product Details
- 0023245901017
- Manufacturer:
- Fremont Die
- Publication date:
- 08/01/2013
Customer Reviews
Average Review:
Most Helpful Customer Reviews
See all customer reviews


text:
Leipzig Pub Crawl of the Most Popular Locations
Discover the most popular party areas in Leipzig on this fun pub crawl. Enjoy a Guinness at the most popular pub in the city or an absinthe in the…
Duration: 2 hours
From $17
Likely to sell out
LeipzigSee all 53 tickets & tours
Want to discover all there is to do in Leipzig? Click here for a full list.


text: A 16 million pixel camera takes some of the sharpest galaxy pictures you've ever seenCharlie Jane Anders7/26/12 5:59pmFiled to: space pornSpaceDiscovery channel telescopelowell observatoryGalaxiesLarge monolithic imager541EditPromoteDismissUndismissHideShare to KinjaToggle Conversation toolsGo to permalink The Lowell Observatory's newest toy, the Discovery Channel Telescope, has finally gone online — and they've released super-snazzy pictures of three of our favorite galaxies to celebrate. Above is M109, a barred spiral galaxy 84 million light years from Earth. Advertisement The 16-million-pixel camera is already taking some pretty sweet images — but it'll be even better when they add the impressive-sounding Large Monolithic Imager (LMI) from the National Science Foundation, which will add a 36-million-pixel capability.Here are the other two great galaxy pictures, showing the Sombrero Galaxy and the Whirlpool Galaxy respectively: [Discovery News, via MSNBC]Gear from Kinja DealsThe Best External Hard Drives For Your Wii UBestsellers: PlayStation PlusSave $13 On the Bluetooth-Enabled Xbox One S ControllerReply54 repliesLeave a reply


text:
Successfully running a continuing education or lifelong learning program is getting more complex. There is much more to do, thus more projects. Having good project management skills is becoming critical.
Every continuing education and lifelong learning program should set Annual Goals - 3 to 7 of the most important accomplishments that need to be completed during the year.
Each year LERN and many other business shifts from one fiscal year to the next. FY17 starts for LERN on July 1, so we are wrapping up FY16.
The LERN Best Practices Summit at Kirkwood Community College this past week was a great success. The Continuing Education & Training Services Team did a great job presenting.
For the last six years, LERN has provided The George Washington University School of Business in-house service support by managing their Event Management Certificate Program. LERN handles registration, course scheduling, marketing, and other tasks.
There are 119 OLLI (Osher Lifelong Learning Institute) programs represented in all the United States 50 states and are part of a college or university.
I joined Katie Lynch-Morin and Brendan Marsello as they presented on Integrated Marketing, highlighting Social and Digital Media, for the CAACE Team in Connecticut. Lots of great information and a good job presenting.
The Operations Institute this past week in San Diego was lots of fun.
The need for fresh and new programs has never been greater and developing and bringing on new programs is difficult work.


text:
Love Rings
Strap ons
Sex Furniture
Bondage Toys
Sensual Massage
See All Products
Products are shipped in plain boxes or envelopes with a nondescript return address.
Charges appear as CNV, Inc. You may not recognize this name after checkout as it does not match the name of this site, so please make a note of it.
Under no circumstance will we sell or share your personal information beyond what is necessary to complete your order.
Please review our Privacy Policy for more information
Smooth and Slick Water Based Lubricant 8 oz
Sue Johanson's Super Head Honcho


text:
16H 6 yr. old TB Gelding. Excellent Show Prospect! Hunter or Jump. Nice moving & shows great potential in jumping. Recent Clean Vetting. Free jumped over…SOLD
15H 2011 Palomino AQHA Mare Beautiful young girl with Sweet temperament and kind heart. Excellent training foundation on her. Safe, great mindset,…SOLD
16+H 7 yr. old Dun Andalusian X. RARE Colored. Very Gracious! Amazing mover, Smooth Gaits. Natural mover & well balanced. Started 1st Level Dressage…SOLD
Crisma is FANCY and FLASHY! Excellent mover with a ground covering walk, swing in the trot and a lovely canter. She has horse-sized rideable gaits in…SOLD
Offering for sale: JT Double Shot "Cash" 15h 2007 Bay Arabian Gelding. Full blooded Russian/Crabbet/Spanish Arabian. English and Western foundation: Dressage…SOLD
Athletic pony mare with exceptional movement. Very attractive dapple grey. She would make an awesome dressage mount or jumper for a rider on a budget.…SOLD
Bon Bon is a sweet approx. 13.3 hand welsh type pony. She is a mature (20 + year old) pony, athletic, willing and can help school your youth beginner…SOLD
Here's what you've been waiting for! By "Tivitos Sugar Bar" an NRHA earner of over $59,000 and 2001 Reining World Show Qualifier, 2x Performance ROM earner…SOLD


text:
Policing bill gets panel's support
Tribe's proposal faces obstacles in full House
BOISE – Controversial legislation proposed by the Coeur d'Alene Tribe on state-tribal law enforcement won a unanimous vote in committee Tuesday, clearing a key first hurdle.
The Idaho House Judiciary Committee voted to introduce the bill, which would set the stage for tribal police to enforce state law against nontribal members on tribal land, although some panel members said they may not support it after it goes through a full hearing.
The tribe's Boise lobbyist, Bill Roden, told lawmakers there's been much misinformation spread about the issue and the proposed legislation, and he urged the committee to introduce the bill to set the record straight and allow informed discussion about it.
The appeal worked.
"I'm in the dark here on how all this works, and I would like to know more about that," said Rep. Pete Nielsen, R-Mountain Home.
The Coeur d'Alene Tribe contends criminals are going free because its officers on the Benewah County portion of its reservation can't arrest nontribal members, and that sheriff's officers aren't showing up to make the arrests for them.
The tribe had a cross-deputization agreement with Benewah County until Sheriff Bob Kirts revoked it in 2007. The tribe's agreement with Kootenai County stands.
Chief Allan, chairman of the Coeur d'Alene Tribe, was watching from the audience as the committee voted.
"I know there has been a lot of misinformation out there, and now we have a chance to really separate the facts from the fiction," Allan said after the vote. "I think … at the end of the day, they'll do the right thing."
Although the issue started with the dispute between the tribe and the Benewah County Sheriff's Office, Roden said the bill would apply to any tribe and would "end jurisdictional gaps in law enforcement within the boundaries of Indian reservations in the state."
The legislation encourages Idaho tribes and county sheriffs to reach cooperative agreements for law enforcement within reservations. If an agreement isn't reached after six months of negotiations, tribal police officers could begin enforcing state laws on the reservation if they meet certain requirements, including being state-certified and sending all cases to state courts. Additionally, the tribe must carry liability insurance and waive its sovereign immunity so it can be sued in cases of officer wrongdoing.
Opponents have bombarded lawmakers with messages saying the move would subject nontribal members to tribal courts and remove sheriffs' authority; Roden said it wouldn't do either. The measure doesn't require cross-deputization, and it also provides that tribal police agencies bear all their own costs and don't collect a share of fines from their arrests of nontribal members for state offenses.


text:
Added to Shopping Bag
Theory Dress - Abstract Print Jewelia Cotton Sz 10
Listed by Penny Lane
Size: 10 (M)
Price: $109.00
Returnable for Site Credit.
You can request a return for Tradesy Site Credit within 4 days of delivery. FREE return shipping.
If your item was misrepresented in any way, you can file a misrepresentation claim. Tradesy will investigate and you'll be eligible for a Full Refund.
Shopping Bag :
Reserved for -:--
Dress - Abstract Print Jewelia Cotton Sz 10
Shipping Included Shipping & packaging provided by seller. Learn More
Ships Next Day. Order today. Ships tomorrow.
Pay with Credit Card, PayPal, or Affirm.
This item may have been worn but has no visible signs of wear.
* Size 10
* Abstract print Jewelia dress
* Retails for $295.00
* 100% Cotton
* Concealed side zip
* Satin belt at waist
* Subtle pleat details
* Very small area of discoloration near zipper
* Has original tag
* Underarm to underarm 17"
* Waist 27.5"
* Roomy hip area
* Total length 36.5"
Item #:
Style Tags:
Have a similar item? Sell Yours
Return this item for any reason and get Tradesy Site Credit. Submit a simple return request within 4 days of delivery. Free return shipping included.See Return Policy
Our Guarantee
Get what you ordered, or your money back. Open a claim within 4 days of delivery. We'll give you a full refund if the condition, style, or authenticity of this listing are misrepresented in any way.Learn More


text:
Vt disaster group gets new leaderThe Associated Press | January 15,2014MONTPELIER The organization that oversees a private Vermont disaster relief fund has a new chairman.
The Vermont Long Term Disaster Recovery Group says that Chris Graff has succeeded David Coates, who was named to lead the panel by Gov. Peter Shumlin shortly after Tropical Storm Irene hit Vermont in August 2011.
Since Irene, the fund has raised more than $7 million to meet the unmet needs of disaster survivors after federal and state assistance, private insurance, aid from regional and local recovery groups, and private foundations.
The group provided assistance to about 400 cases from 2011 flooding and an additional 20 cases stemming from 2013 flooding. A number of Irene-related cases remain pending. The fund will remain in place for future disasters.MORE IN This Just InPolice: Drunk driver crashes
HARTFORD A Hartland man was cited for drunk driving after... Full StoryBENNINGTON A local man was charged with two felony counts of forgery on Monday in Bennington... Full StoryBENNINGTON Two Pownal residents were arraigned on a felony charge of cultivating marijuana on... Full Story
- Most Popular
- Most Emailed


text: Troodon/JW: TG < Troodon 2,360pages on this wiki Add New Page Edit Classic editor History Add New Page Talk0 This page needs serious attention! This article does not currently meet the standards set at Park Pedia: The Jurassic Park Wiki. Please feel free to edit it, and pose any questions you might have on the article's talk page. Card Troodon was added to the game on January 4, 2016, but is a limited tournament dinosaur. It is a legendary carnivore. Unlike in previous games Troodon has appeared in, it is depicted with feathers, most prominently on its arms. Retrieved from "http://jurassicpark.wikia.com/wiki/Troodon/JW:_TG?oldid=130186" Categories: Pages Needing Attention Jurassic World: The Game dinosaurs Add category Cancel Save


text:
32 CFR 310.40 - Requirement for reports.
Beta! The text on the eCFR tab represents the unofficial eCFR text at ecfr.gov.
§ 310.40 Requirement for reports.
The DPO shall establish requirements for DoD Privacy Reports and the DoD Components may be required to provide data.
The section you are viewing is cited by the following CFR sections.


text: Hey guys, looking through Google Maps, I notice that on 35L at DEN, there are old chevron markings and a threshold visible. It appears that the runway length from there is about 8000ft. I never knew DEN's runways were anything but their current length. Anyone care to explain whats going on here?


text:
Rolls Royce 103 EX Vision Next 100: Rolls Royce boldly goes where no one has gone before
Say what you will about Rolls Royce.
Say what you will about Rolls Royce.
Take for example Project Cullinan, an SUV that the British luxury brand will be launching in 2018. But Rolls-Royce will not be calling the Cullinan (or whatever the final name will be) an SUV.
Recently at the British luxury automaker's Summer Studio in Sardinia, Italy, Rolls-Royce unveiled a Dawn and Wraith that are inspired by the atmosphere and vibrancy of Porto Cervo in Italy.
The tuner revealed a customized Rolls-Royce Dawn convertible to introduce a new tuning program for the vehicle.
One of the most-anticipated car driving video games is Forza Motorsport 5, which was announced last year and launched in November.
A hundred years ago, Rolls-Royce Silver Ghosts embarked on the Austrian Alpine Trials.
The arrival of the first Rolls Royce Wraith on American soil is slated for July 13, to begin its cross-country visits to local dealerships where aficionados will have the chance to ride in
Aside from being an Oscar-winning actor, Adrien Brody is quite the car collector.
While gracefully accelerating from zero to 60-mph in a mere 4.4 seconds, the ultimate touring car utilizes Satellite Aided Transmission to incorporate GPS mapping to foresee the terrain ahead, gain
Rolls-Royce is recalling select model-year 2013 Phantom vehicles due to a possible fire risk.
Rolls-Royce Motor Cars will be debuting their all-new 2014 Rolls-Royce Wraith at the Geneva Motor Show in March.
In 1979, rock legend Freddie Mercury's managers at Goose Productions Ltd purchased a special order Rolls-Royce Silver Shadow for him to use personally.
Rolls-Royce Motor Cars has released information on the 2013 model year Ghost. The changes are small, but fitting with the times in this latest release.
This Rolls Royce, with extensive documentation of its use by the Royal Family and other UK dignitaries will be put up for bid by Volo Auto Museum next month in a no-reserve auction.
Rolls-Royce has finally made its way to South America.
Liberty Electric Cars is a vehicle design, engineering and manufacturing company specializing in clean transport solutions.


text:
- You Are Here:
- Home
- Government
- Departments
- Land Records
- Plat Book Information
Plat Book Information
2013-14 Plat Book Available
The 2013-14 edition of the Bayfield County Plat Book is available. The price for this 160+ page booklet is reduced to $10, (plus $8 for shipping if ordered online or using the mail-in order form). The plat book is also available digitally on CD for $25, plus $2 for shipping. Look for the new plat book to be out in fall of 2016.
Plat Book Overview
Starting in 2001, Bayfield County began to publish its own plat books. These plat books are unique in that they are digitally produced and contain many improvements over past booklets, including:
- Accurate assignment of road names and address numbers to reflect Bayfield County's emergency rural address numbering system
- Accurate portrayal of the correct location and configuration of parcels
- A comprehensive index to parcel ownership based on recent tax assessment roll information
- Facts about Bayfield County, road index, government directory, major lakes index, and small tract index
- Greater and more effective use of color
- More conveniently-sized booklet
The 2013-14 Bayfield County Plat Book has been updated and includes many enhancements, such as:
- 11-by-17-inch size allows maps to be 14% larger
- 50-foot interval contour lines
- Aerial photos with latitude / longitude grid and enhanced color
- All parcel owners are in the book (including cities of Bayfield and Washburn)
- Binding on the short side of the book
- Featured lakes with contours
- Forest crop land and managed forest land (open status only)
- Illustration of all parcels in the unincorporated areas of Bayfield County
- Incorporated suggested improvements received from past plat book users
- Myriad of updates to reflect property configuration and ownership
- Owners and address index in the back of the book
- Small tract index is on the same page as the map
- Updated and reformatted the small tract, roads, and owners indexes
- Updated Bayfield County government directory
Plat Book Sneak Peek
Ordering Information
The current 2013-14 Bayfield County Plat Book is available at a cost of $10. For mail and online ordering, please add $8 per book. Thus, the cost for each plat book is $18 ($10 plus $8 for shipping).
In addition to the traditional booklet, the 2013 edition of the Bayfield County Plat Book and Land Atlas will be available on CD in the popular Adobe® PDF format for a cost of $25 plus $2 for shipping.
Please note that the Bayfield County Plat Book and Land Atlas is fully protected under U.S. copyright law. Reproduction / redistribution of the CD version is expressly prohibited, as is the sale of reproductions of images.
Ways to Order
There are three ways to order:
- In Person - Land Records Department, 117 E. 5th St, Washburn, WI 54891
- By Mail - Fill out and mail the order form
- Online - Check out our online ordering service and complete the fill-in boxes with:
- State: Wisconsin
- Payment Entity: Bayfield County Clerk
- Payment Type: Plat Books
|Business Name
|Phone Number
|Bear Country
|52150 Wisconsin Ave
Drummond, WI 54832
|Book World
|301 W Main St
Ashland, WI 54806
|Cable Area Chamber of Commerce
|13380 County Hwy M
Cable, WI 54821
|Ehler's General Store
|88545 Superior Ave
Cornucopia, WI 54827
|Gateway Store of Iron River
|7990 US Hwy 2
Iron River, WI 54847
|Iron River Co-op Hardware Hank
|7840 US Hwy 2
Iron River, WI 54847
|Jim's Bait and Convenience Shop
|2995 Lake Rd
Barnes, WI 54873
|O'Brien's C-Store
|7755 US Hwy 2
Iron River, WI 54847
|PJ's Cabin Store
|1040 Lake Rd
Barnes, WI 54873
|Remax North Star Realtors
|8140 US Hwy 2, Ste. 1
Iron River, WI 54847
|River Rock Inn and Bait Shop
|1200 W Lake Shore Dr
Ashland, WI 54806
|Superieur Petrol
|407 Rittenhouse Ave
Bayfield, WI 54814


text:
Don Benge's Maximus Ruler,
runner-up behind Ron the Greek in Fair Grounds' Grade III Lecomte
Stakes Jan. 23, will not run in Saturday's Grade II Risen Star Stakes
after coming up with a slight injury following a breeze Sunday morning at the
New Orleans oval.
"He didn't want to place his right hind
foot down toe to heel when he was being walked yesterday afternoon," said
trainer Clark Hanna of Maximus Ruler Monday morning. "Usually, he walks
very forwardly, but when we took his shoe off his foot seemed to be a little
sensitive. We took some pictures and they came back clean, so we gave him some
hot water therapy and some anti-inflammatory medication to take the soreness
out, and he seems to be much, much better this morning (Monday). Now, we're
going play things by ear, and evaluate him for a few days. We'll see how he
does with no medication over the next 24 to 48 hours to make sure he's okay.
"I just don't feel comfortable running
him back this weekend," Hanna said. "This is the best horse I've had in my
lifetime and I don't want to ruin him. My best educated guess right now is it's
only a stone bruise and he'll be fine, but he'll have plenty of other
Rachel Alexandra Gallops Monday but
Her Regular Exercise Rider Injured Shortly Thereafter
Horse of the Year Rachel Alexandra
enjoyed a routine gallop at about 6:30 Monday morning in preparation for her
proposed engagement in Fair Grounds' New
Orleans Ladies March 13, but her regular
exercise rider Dominic Terry was injured less than an hour later after
completing a breeze aboard another Steve Asmussen trainee – the
3-year-old filly Wild
Terry, known for his ability to
communicate with Rachel Alexandra, had completed Wild Forest Cat's work,
accomplished in 53.80, but was unseated while galloping out following the move.
Terry, a valued member of Rachel Alexandra's team, was conscious and talking,
but complaining of neck and wrist pain before being transported to University
for x-rays.
Three-time Kentucky Derby winner Calvin Borel will...
There was a strong Saratoga flavor among the Class...
Rachel Alexandra dominated on the East Coast and ...
Saratoga week four takes place Wednesday, August 1...
Songbird and Beholder, two thirds of the three "Fa...
In advance of a second attempt at the Breeders' Cu...
The Breeders' Cup has been known to be end of year...
Breeders' Cup 2016 is November 4th & 5th! &nb...
Dortmund is a winner. He just isn't so far in 2016...
Copyright © 2010 -
Immerse!, LLC
Join 51,839
other passionate horse racing fans!


text:
Tip of the Day
Adjusting the location alert radius in iOS Reminders
Location-based alerts in the iOS Reminders app are great for letting you know to do something when you get to or leave a specific place, and now iOS 7 makes them even more useful by letting you manually set the distance at which you want to be alerted.
When setting a location-based reminder, a map will appear with your selected location, along with a circle representing how far away from the selected location that the reminder will be triggered—often referred to as a "geofence." You can hold a finger on the dot at the edge of the circle to adjust this radius from as little as 100m up to around 2,400 km. The shading of the circle also illustrates whether your reminder is for arrival or departure, with the blue shading effectively representing the zone in which the alert will be triggered.
Recent Tips
- Converting Live Photos to Still Images
- Duplicating a Photo in the iOS Photos app
- Adjusting Video Playback Quality to control data usage in iOS 10
- Choosing preferred Driving + Transit options in iOS 10 Maps
- Accessing Medical ID from the iOS 10 Lock Screen
- Enabling animations in iOS 10 Messages
- Taking pictures and saving to photo library in iOS 10 Messages
- Saving power with Face-down detection for iPhone
- Finding Frequently Visited Locations on your iPhone
- Speeding up Apple Pay at checkout
- Quickly unlocking your iPhone for Siri
- Using the iPhone as a remote camera with Apple Watch
- Using your iPhone's flash LED for alerts and notifications
- Managing iOS device backups in iTunes
- Sorting iOS Notifications Chronologically
- Bringing up Wallet from the iPhone lock screen
- Annotating PDFs and images in iOS 9 Mail
- Saving and Sharing Visual Voicemail Messages
- Adding links to Reminders in iOS 9
- Enabling iCloud Drive app in iOS 9
- Going back to a four-digit passcode in iOS 9
- Engaging Low Power Mode in iOS 9
- Adjusting video recording quality settings in iOS 9
- Saving to PDF in iOS 9
- Sending iMessages with Return in iOS 9 when using an external keyboard
- Restoring Files, Contacts, and Calendars in iCloud
- Enabling Do Not Disturb while actively using your iPhone
- Showing only Downloaded Music in iOS 8.4
- Activating Siri by voice
- Accessing a song's album in the iOS 8.4 Music app
- See all Tips. »
Recent News
- Notes from Apple's Q4 2016 earnings call
- Apple Q4 2016: $46.9B revenue, 45.5M iPhones + 9.2M iPads sold
- Apple reportedly hiring engineers from BlackBerry, developing car operating system in Canada
- Apple releases PowerBeats3 Wireless earphones
- Apple Pay launch in Japan encounters major problems
- Apple releases iOS 10.1, tvOS 10.0.1, watchOS 3.1
- New details about Apple Watch Nike+ exclusives, availability
- Apple's website hints at possible Apple Pay launch in Germany
- ConnectSense Smart Outlet adds power monitoring, reduces price
- Automatic releases new Automatic Lite version of car monitoring accessory
Recent Reviews
- Bowers & Wilkins P3 Series 2 Headphones
- Incase Icon, Pop, and Textured Snap for iPhone 7/7 Plus
- Philips Hue Motion Sensor
- Bowers & Wilkins P9 Signature Headphones
- Tech Armor FlexProtect and Shock Flex for iPhone 7/7 Plus
- SwitchEasy Flash and Fleur for iPhone 7/7 Plus
- Blue Microphones Raspberry Mobile Microphone
- Incipio Haven for iPhone 7 and Reprieve Sport for iPhone 7 Plus
- Mophie Hold Force Magnetic Case System for iPhone 7
- Speck Presidio and Tech21 Evo Tactical for iPhone 7
Recent Articles
- Instant Expert: Secrets & Features of watchOS 3
- Instant Expert: Secrets & Features of tvOS 10
- Instant Expert: Secrets & Features of iOS 10
- Inside the betas: iOS 10 Photos gets Advanced Computer Vision
- Inside the betas: iOS 10 Music app delivers 'clarity and simplicity'
- Inside the betas: iOS 10 Maps gets a major redesign
- Inside the betas: iOS 10 shakes up the user experience
- Inside the betas: watchOS 3 promises a real speed boost
- Inside the betas: A sneak peek at what's new in tvOS 10
- Filling the Gap: A look at third-party HomeKit apps


text:
(When our friends over at FanDuel.com asked me if they could do quick a guest post on the upcoming fantasy baseball season, it was an opportunity I just couldn't pass up. No one knows the sport of baseball and the fantasy implications of it all, quite like they do.
Enjoy, and when you get a moment, hop over to their site, and definitely check out the good work they're doing.
Each year, there always seems to be a mild debate over who should be the No. 1 pick in a fantasy baseball draft. Most of the time it does not get too heated, because one guy tends to stand out. In 2013, there seems to be three legitimate options that are all very close: Miguel Cabrera, Ryan Braun and Mike Trout. So with the No. 1 pick, who should you end up taking?
By now, every baseball fan is well aware of Cabrera' historic season in 2012. The American League went without a Triple Crown winner since the 1960s, but Detroit's third baseman had a hot bat nearly the entire season. His only weakness as a baseball player does not matter in fantasy baseball, as most leagues do nothing as far as defense is concerned.
Hitting wise, it is hard to argue with a .330 average, 44 home runs and 139 RBI. While those same power numbers might not happen again in 2013, his average continues to be solid each and every season.
Speaking of historic seasons, Trout started 2012 in the minor leagues and ended it in a huge American League MVP debate. While Cabrera had the nice, neat Triple Crown statistics, a very strong argument could be made that Trout was the best player in baseball. In fact, according to final 2012 fantasy rankings, he was the best.
What sets Trout apart from the other two is his ability to steal bases. Many are projecting that he won't be able to match his power and average numbers from last year (30 home runs, .326 average), but even if he doesn't he could still provide a lot of value and be worthy of the top pick. Some look at his youth as being a plus, while other see it as being a minus.
Finally, Braun quietly put up another consistent season in Milwaukee, hitting .319 with 41 home runs, 112 RBI and 30 stolen bases. He is kind of a hybrid of Cabrera and Trout in that he doesn't do anything better than both of them, but he borrows aspects from each one. As long as he has his health and his legs, he will continue to provide value as an all-around, five-tool slugger. His team might hold him back slightly in the runs and RBI department, but nothing to be too worried about.
As you can see, there are many ways to go in this situation. Trusting Trout to duplicate his performance from a year ago seems less of a sure thing, and Braun continues to be linked to PED scandals that could wear him down. For that reason, Cabrera seems like the safest pick at No. 1, but to be honest, this could be the perfect year to have the No. 3 pick and let the two owners in front of you make the tough choices.


text:
Drupal Association members fund grants that make connections all over the world.
when sitemap generates the page is includes accesskeys, so for example in my site menu I have a menu item called home linking to accesskey 1, and this is listed twice on the sitemap page that is created, once in the menu and once in the page content. This makes it fail validation on some testing sites, but not others, I don't think it's actually an accessibility issue as the access key is not conflicting (it's the same key).. but never the less as my sites primary concern is fixing the web's accessibility problems I'm getting picked up on it by my users who don't know it's not a real issue.
Ben from Fix the Web http://www.fixtheweb.net


text:
Health Law, Bioethics and Human Rights (S)
Health law, bioethics, and human rights are converging in challenging ways, especially at the national level (in both legislation and constitutional adjudication), and the international law level. This seminar will explore the convergence and its meaning for the law and society through specific case studies, including post-9/11 emergency public health declarations; bioterrorism; use of physicians in torture and death penalty; global governance of synthetic biology, genetic engineering and the new reproductive technologies; and the meaning of "the right to health" in the wake of the litigation against the Affordable Care Act. PREREQUISITE: HEALTH LAW or with permission of the instructor. OFFERING PATTERN: This class is frequently offered in alternating years. Students are advised to take this into account when planning their long-term schedule. ** A student who fails to attend the initial meeting of a seminar, or to obtain permission to be absent from either the instructor or the Registrar, will be administratively dropped from the seminar. Students who waitlist for a seminar are required to attend the first seminar meeting to be considered for enrollment.


text:
Computer Hardware
Pro Audio
Pro Gaming
Pro Video
Pro Graphics
Digital Signage
3XS Systems
Today Only
Check / Uncheck All
View Selection View All
Your Account
Your Basket
0 items - total: £0.00
Add product by LN number
Order now to receive by Mon 31st Oct
Sub Total (inc VAT)
Delivery to UK Mainland change
Enter Location
Total (inc VAT)
£16.66 Ex VAT
£19.99 Inc VAT
Scan Code:
Manufacturer Code:
Scan Rating:
Mid RangeThis product has been rated as a mid-range product
Protect against installation damage for 28 days. Click here for details
Buy Now Pay Later - After a 10% deposit pay nothing for 9 months.
Spend between £100 and £1000 and get the goods before you pay.
For further information regarding Scan's warranty procedure please click here
To tell a friend about this product please fill out your name and enter their email address.
Sort by:
Price (lowest - highest)
Price (highest - lowest)
Description (a - z)
Description (z - a)
Manufacturer (a - z)
Manufacturer (z - a)
New Products
Page style:
Edimax BR-6428nC nMAX 300M 2T2R Wireless 802.11n Broadband Router with 4P Switch, detachable antenna (9dBi)
£4.57 Next Day Delivery
£20.41 ex VAT
£24.49 inc VAT
Find similar products with the same specifications as Dynamode Bluetooth Stereo Headphones, Microphone, Multifunction LCD display, 10m range, Built-In FM Stereo, Red . Please choose from the list below.
1 x 3.5mm Jack
Play Time
Driver Size
Driver Type
Neodymium Magnets
Frequency Response (Headset)
Sensitivity (Headset)
Impedance (Headset)
Microphone Pickup Pattern
Frequency Response (Mic)
Sensitivity (Mic)
Impedance (Mic)
Signal-to-Noise Ratio
Cable Length
Add to your basket
Remove from your basket


text:
Poppy Seed Lemon Bread Recipe
A mild lemon flavor comes through in this tall loaf flecked with poppy seeds. "Slices are good spread with nutmeg butter or cream cheese," suggests Claudia Moffatt of Manchester, Missouri.
- 3/4 cup water (70° to 80°)
- 1 egg
- 3 tablespoons lemon juice
- 3 tablespoons butter, softened
- 3 tablespoons sugar
- 1 tablespoon grated lemon peel
- 3/4 teaspoon salt
- 3 cups bread flour
- 2 tablespoons poppy seeds
- 1/4 teaspoon ground nutmeg
- 2-1/4 teaspoons active dry yeast
- 1/2 cup butter, softened
- 1/2 cup confectioners' sugar
- 1/4 teaspoon ground nutmeg
- 1. In bread machine pan, place the first 11 ingredients in order suggested by manufacturer. Select basic bread setting. Choose crust color and loaf size if available.
- 2. Bake according to bread machine directions (check dough after 5 minutes of mixing; add 1 to 2 tablespoons of water or flour if needed).
- 3. In a small bowl, combine nutmeg butter ingredients; beat until blended. Refrigerate until serving. Yield: 1 loaf (1-1/2 pounds, 16 slices).
Nutritional Facts
1 slice: 181 calories, 9g fat (5g saturated fat), 34mg cholesterol, 195mg sodium, 23g carbohydrate (6g sugars, 1g fiber), 4g protein.
Reviews for Poppy Seed Lemon Bread
Reviewed Jun. 25, 2011
"This is a great breakfast bread! I was so impressed with the first loaf that I made another for a friend."
Reviewed Jan. 31, 2011
"I tried this special bread one evening so we would have a quick breakfast on a rushed morning. We ate the whole loaf in 2 days, and I immediately made another loaf to take to a church lunch. Everyone who ate it loved it, and the nutmeg butter is a lovely touch."
© 2016 RDA Enthusiast Brands, LLC


text:
We love to support and grow the nation's burgeoning class of entrepreneurs. It's why we developed and continue to maintain free documents for business use, and it's the same reason why we have developed our Scholarship Program. Moreover, our Scholarship Program is for driven, up-and-coming entrepreneurs who are ready to commit to building a better world through their business ideas. Also, by creating a unique business plan infographic for their scholarship entries young business dreamers can build upon and practice the skills that will be required of them at their jobs after college. In short, we envision our Scholarship Program as not only an award that will help students in the present, but a test that will help them hone in on their future career paths.
1. You must be a graduating senior in high school or enrolled in college. Community college, professional college, and graduate students are all eligible, in addition to undergraduates at four-year universities.
2. You may not be related to any of FormSwift's staff or our extended family.
3. International students, including students from a college or graduating from a high school outside the United States, are also eligible to apply.
4. We reserve the right to verify date of high school graduation and/or college enrollment.
1. As mentioned above, make a business plan infographic about one of the suggested topics.
2. Send your entry to jamie[at]formswift.com by October 15, 2016 with the email subject line "FormSwift Scholarship Entry"
3. Make sure to include your full name, state, and school within your submission.
Future Scholarship Deadlines:
Winter 2016: December 15, 2016
Spring 2017: March 15, 2017
Summer 2017: June 15, 2017
Fall 2017: September 15, 2017
*All submissions become the property of FormSwift
Xavier is a freshman at Georgetown University, and also the co-founder and chief marketing officer of Bites, Inc. He will be using his award to help reduce the financial cost of attending school.


text:
The Complete Imitation of Christ"There is no better edition of this classic, than this careful and insightful volume." —Michael Downey, editor, The New Dictionary of Catholic Spirituality Published in over 6,000 editions before the twentieth century, this classic work has been called "the most influential work in Christian literature," "a landmark in the history of the human mind," and "the fifth gospel." Now and for the first
The Complete Cloud of Unknowing
with the Letter of Privy CounselCentral to the Christian mystical tradition is the inspired work of the anonymous author of The Cloud of Unknowing. Rich with insights and perceptions of the obscurity and "unknowability" of God, this work reveals God as being on an entirely different plane of existence from human beings—so different that time-bound human language is inadequate to describe God exhaustively or accurately. Intellect
The Complete Introduction to the Devout LifeDe Sales' classic has been described as "a masterpiece of psychology, practical morality, and common sense" and, after The Bible and The Imitation of Christ, is the widest read spiritual book of all time. Unlike many others, Devout Life was written specifically for lay persons and it demonstrates a rare sensitivity to the demands of life in a world that is often antagonistic to spirituality. In
$2.99"What is all this contemplative prayer people are talking about these days? I never heard anything about that back in my parish. Is this really part of the Christian tradition or some New Age import from Buddhism or some other -ism?" The question came from a young man in college seriously considering a priestly vocation. The answer was a series of letters of spiritual direction that dealt — often
$15.99The most engaging and complete collection available of this 14th century English mystic The Revelations of Julian of Norwich is the first book written in English by a woman – in this case, by a 14th century recluse who recounts the poignant, subtle, and radical insights granted to her in sixteen visions of the crucified Christ as she lay on what was believed to be her deathbed. Julian's miraculous
$14.99This anonymous fourteenth-century text is the glory of English mysticism, and one of the most practical and useful guides to finding union with God ever written. Carmen Acevedo Butcher's new translation is the first to bring the text into a modern English idiom—while remaining strictly faithful to the meaning of the original Middle English.The Cloud of Unknowing consists of a series of letters
$7.99The whole problem of our time is the problem of love. How are we going to recover the ability to love ourselves and to love one another?We cannot be at peace with others because we are not at peace with ourselves, and we cannot be at peace with ourselves because we are not at peace with God.There is a distinction between a contrite sense of sin and a feeling of guilt. The former is a true and
$11.99One of the most influential and well-loved books of Christianity, The Imitation of Christ by Thomas � Kempis appears here in Penguin Classics in a new translation by Robert Jeffery, with an introduction by Max Von Habsburg, notes, a chronology and further reading. The Imitation of Christ is a passionate celebration of God's love, mercy and holiness, which has stimulated religious devotion for
The Blessed Virgin Mary In England: Vol. II
A Mary-Catechism with Pilgrimage to Her Holy Shrines"O Blessed Confidence, O Safe Refuge, Mother of God and Our Mother!" St. Anselm of Canterbury (1033?1109), Doctor of the Church "What is not generally known and only infrequently studied is the role of Our Lady over the centuries as a catechist: teacher of the faith, in a very real sense, primary teacher because she is Mother of God and Mother of the Church and faithful If any one factor might be
365 Daily Readings from the Greatest Monastic WritingsA collection of monastic readings are drawn from a full range of writings from the early and contemporary monastics of various orders and from differing denominations, and includes background information on each author.
Through the Year with the Saints
A Daily Companion for Private of Liturgical PrayerThis devotional guide commemorates the saints universally honored in the Roman Catholic Church. Father Pennington has written an insightful Introduction which illuminates the spiritual graces we can experience when meditating on and praying with the saints throughout the year.The entries are arranged chronologically, corresponding to the feasts observed at weekday liturgies. Pennington opens each
Magnificat Year of Faith CompanionA comprehensive, page-a-day booklet designed to strengthen the life of faith. Each day features one of eight cornerstones of the Catholic Faith: - Profiles of the holy men and women of the Bible - Reflections on Sacred Scripture - Short explanations on the Catechism - Devotions for deepening faith - Essays on key aspects of the Faith - Meditations from saints and spiritual masters - Prayers both


text:
Sorry, something went wrong. Please contact support .
I am working as an independent Microsoft Dynamics AX technical consultant for various organizations including VAR's and Partners having over 8 years of Dynamics AX development, customization experience. I also worked as a vendor of Microsoft on Microsoft Dynamics Rainer (upcoming release) and Dynamics AX 2009, 2012 RTM, R2 and R3 development releases from May 2007 to May 2014. I have vast expertise in all AX development frameworks like Dynamics AX general development, AIF, SSRS, WorkFlow, Enterprise portal (EP).


text:
Direct Oceanfront 1 Bedroom Condo with Pool, Tennis Court, Hot Tub
From $135 / night
Description from the owner
Description from the owner
Bedrooms: 1/
Bathrooms: 1/
Sleeps: 6/
Type: Resort
Book this 1 bedroom, 1 bathroom resort in Myrtle Beach today! A total of 6 people can sleep here comfortably. This property has been booked 12 times.
Guests can enjoy a pool, , and hot tub among other amenities offered by this rental.
Travelers are sharing their opinions on this property. It has an overall rating of 5/5 thanks to an average of 7 reviews.
Costs vary, with the average weekly rate as low as $595.00 to as high as $995.00, depending on travel dates.
The owner responds to 85% of inquiries and last updated the property's calendar 3 weeks ago.
Proximity to TripAdvisor's Top Myrtle Beach Attractions
Proximity to TripAdvisor's Top Myrtle Beach Attractions
Reviews (3)
Also consider
- FlipKey has rentals in over 11,000 destinations around the world:
- Hawaii vacation rentals- 8,158 rentals from $100/night
- Costa Rica vacation rentals- 3,632 rentals from $60/night
- New Buffalo vacation rentals- 81 rentals from $190/night
- Coronado vacation rentals- 88 rentals from $55/night
- Cabo Rojo vacation rentals- 92 rentals from $75/night