text:
|Eddey et al.
|Shore et al.
|Meade et al.
|Schuenemann et al.
|Smith et al.
|Anacker et al.
|Associative memory system for sequential retrieval of data
|Singleton et al.
|Orthogonal computer
|Orthogonal write system for magnetic memories
|MacIntyre et al.
This is a continuation-in-part of U.S. Pat. Application Ser. No. 270,903 filed July 12, 1972 and now abandoned.
a memory array comprised of a plurality of address line encoded binary solid state memory modules and containing data bit storage elements wherein data may be stored as bit-comprised words with bit B of module M containing bit B of word W in accordance with the formula M = B ♁ W and wherein B, M, and W are n-element binary vectors, respectively unique for each bit, module, and word, and where n is an integer greater than 1;
a logic circuit means connected to the memory array for simultaneously performing logic and arithmetic operations on all accessed data bits;
a coding circuit; and
permuting circuit means connected to the coding circuit and between the memory array and logic circuit means for ordering the lineal order of data into and out of the memory array in accordance with the output of the coding circuit.
Heretofore it has been known that the apparatus of a digital computer might be arranged in a manner such as to allow accessing to the data storage bits of the computer memory in either of two distinct modes. That is, it has been taught that a system might be developed whereby data can be written into the memory in a word-oriented mode and read from the memory in a bit-oriented mode or vice-versa. That is, data might be written into the memory such that all bits of one word are written simultaneously and one bit of all words are read simultaneously or conversely, one bit of all words are written simultaneously and all bits of one word are read simultaneously. However, "corner-turning" problems have been inherent in prior techniques. These "corner-turning" problems are well understood by those skilled in the art. An oft-used example of such problems is the acquisition, storage, and accessing of radar data. It can be readily understood that if a radar system acquires a plurality of data at various ranges on one azimuth and stores that data in an azimuth-oriented manner and does this for several azimuths it must then devise a unique method to access this stored data if it later desires to access all data at the same range but different azimuths. In other words, if data is acquired and stored in an azimuth-oriented mode and is later to be accessed in a range-oriented mode then unique apparatus or methods must be utilized to make such accessing. In the past, systems have required either complex logic circuitry, redundancy of circuitry or an increased number of memory access lines so as to be above to "turn the corner" from a bit-oriented access to a word-oriented access or vice-versa. Particular approaches toward circumventing the "corner-turning" problem have been numerous. A typical approach to the solution has been shown in U.S. Letter Pat. 3,277,449 for the Orthogonal Computer designed by William Shooman. Certain articles by Mr. Shooman further define and enhance the teachings of this patent. Particularly, chapter 15, entitled "Orthogonal Processing" of the book Parallel Processor Systems, Technologies and Applications edited by L. C. Hobbs and published by Spartan Books in 1970 basically outlines the teachings of the patent. It is readily observable from an understanding of the Shooman Patent that the invention described therein requires both vertical and horizontal accessing means, and vertical and horizontal arithmetical means. In other words, the Shooman invention, and others which have sought to circumvent the "corner-turning" problem, fundamentally teach two separate computers operating upon the same memory. Such systems are extremely expensive due to the requirements of the duplication of access circuitry and arithmetic units.
Further, it has been known that computer systems known as associative processors might be designed whereby arithmetic, search, or other logical operations might be performed upon a plurality of data simultaneously. Such systems have proven themselves to be quite effective in the rapid processing of data. However, heretofore such systems have generally been quite inflexible as to mode of operation; that is, such systems have been capable of simultaneously processing all bits of one word, or one bit of all words, but no given system has been capable of performing simultaneous operations in both modes without the duplication of much of its circuitry such as to use different logic and arithmetic circuitry for each of the two modes.
Therefore, it is the general object of the instant invention to present a novel solid state associative processor organization wherein a unique solid state memory array is coupled with the key apparatus of an associative processor to form an associative array wherein associative or parallel operations may be performed upon data in either a word-oriented or a bit-oriented mode and wherein each mode utilizes the same read-write lines and arithmetic unit.
A further object of the invention is to provide a solid state associative processor organization wherein a plraulity of the aforementioned associative arrays may be operated upon in parallel so as to be capable of simultaneously receiving and processing data from a large number of sources.
A further object of the invention is to provide a control system whereby the control programs necessary for the parallel operation of a plurality of associative arrays may themselves be processed with a speed conducive to that of the associative arrays.
Still a further object of the invention is to provide a unique computer organization which is not only capable of the parallel processing of a large volume of data from various sources and capable of processing the control program with a speed conducive to the data processing speed of the system, but to do so in a manner which is accurate in operation, highly flexible, adaptable to various uses, and quite economical.
The aforesaid objects of the invention and other objects which will become apparent as the description proceeds are achieved by a digital computer wherein operations may be simultaneously performed on a plurality of data in both a bit-oriented mode and a word-oriented mode comprising a plurality of solid state memory arrays, the data storage arrangements of which are such that access may be made to the data storage bits thereof in either a bit-oriented mode or a word-oriented mode, and of such character that a single set of data input/output lines is required for writing data into the arrays or reading data from the arrays in both modes and a plurality of arithmetic units, one associated with each solid state memory array, providing the means for performing, in both word-oriented and bit-oriented modes, parallel logical and arithmetic operations on the data associated with the solid state memory arrays.
For a better understanding of the invention, reference should be had to the accompanying drawings wherein:
FIG. 1 shows the basic block diagram of the solid state associative processor organization;
FIG. 2 illustrates the block diagram of an associative array; and
FIG. 3 illustrates the block diagram of the AP control.
Referring now to the drawings and more particularly FIG. 1, a generalized block diagram of the embodiment of the invention may be seen. The computer organization described herein contains three separate memory systems; associative arrays 12, AP control memory 18, and sequential control and memory 20. These separate memory systems allow memory cycle times to be overlapped, thus enhancing the data processing capability and speed of the invention. The control elements of the invention, AP control 16, program pager 24, external function logic 22, and memory port logic 26 allow the fast processing capability of the associative arrays to be dynamically controlled and applied to the changing requirements of any given application. The input/output means; parallel input/output 14, direct memory access 28, buffered input/output 30, and external function commands 32 provide for the rapid transfer of data and control signals to the system.
As mentioned above, the instant invention contains three separate and distinct memory systems. As these memory systems are discussed hereinbelow, it will be seen that each of the elements of the three has been selected and arranged such as to economically achieve the ultimate in data processing speed.
The associative arrays 12 are shown more particularly in FIG. 2. Here it is shown that the storage element of the associative array 12 in the multi-dimensional access solid state memory, MDA memory 34, the subject of co-pending patent application Ser. No. 253,388 filed May 15, 1972, now U.S. Pat. NO. 3,800,289, and assigned to Goodyear Aerospace Corporation of Akron, Ohio. Although the MDA memory 34 shown in FIG. 2 is a square memory, that is it contains 2n words each containing 2n bits, it should become quite apparent to one skilled in the art that the concepts of the instant invention are readily applicable to systems which may utilize non-square MDA memories also. In the preferred embodiment, each MDA memory 34 contains 22n bits, comprising 2n words containing 2n bits, of solid state storage. By use of a unique data storage arrangement within the MDA memories 34 simultaneous access may be made to the data storage bits of the memories in either the bit or word direction; that is, one bit of all words or all bits of one word may be accessed simultaneously.
Although reference to the above designated patent application should be made for a complete understanding of the MDA memory, a few characteristics of that invention will herein be described to facilitate an understanding of the instant invention. A 2n word by 2n bit MDA memory is readily constructed from 2n solid state memory modules each containing 2n bits. Each memory module has one input line by which data may be written into memory, one output line from which data may be read from memory, and n address lines whereby any of the 2n bits contained within the memory module may be addressed. Regardless of whether the MDA memory is to be operated on in a bit-oriented mode or a word-oriented mode, the fata to be written into any given solid state memory module will always be placed on the same input line, and the data to be read from any given solid state memory module will always be found on the same output line. In other words, the input and output means of each MDA memory are exactly the same regardless of the mode of operation. The mode of operation is determined solely by the inter-relationships of the states of the address lines of the individual modules.
As is clearly defined in the above referenced application, an MDA memory array constructed from 2n address line encoded binary solid state memory modules will have associated therewith a unique data storage technique to achieve the desirable multi-mode accessability. In general, if each of the 2n memory modules is designated by a unique n-element binary vector index M and if each of the 2n data storage words is similarly indexed with a unique n-element binary vector W, and if the 2n bits are correspondingly designated by unique n-element binary vectors B then the following data storage rules will be observed:
Bit B of module M will contain bit B of word W in accordance with the formula M = B ♁ W, where ♁ means addition modulo 2.
It should be readily apparent then to one skilled in the art that each memory module M will contain one bit of each of the stored words W and no memory module will contain more than one bit of each of the words. With each memory module containing one bit of each word and no similar bits of any two words, it should be readily apparent that it is possible to access all of the bits of one word or one bit of all words by simultaneously accessing all of the memory modules.
By utilizing the solid state memory modules hereinabove described, an MDA array 34 may be easily constructed. Such an array would require 2n selection lines for providing addressing to the array. A set of X selection lines, designated by a binary vector X and a set of Y selection lines, designated by the binary vector Y. The n address lines of each module will connect to n of these X-Y selection lines. Only one address line per memory module will go to any particular selection line. The rule for connecting module address lines to array selection lines is expressed as follows: Address line k of memory module M connects to xk if mk = 0 or to yk if mk = 1. Where xk, yk and mk are the kth elements of the respective binary vectors X, Y, and M. As a result, each X line connects to one half of the modules and the corresponding Y line to the other half.
With an array constructed as described directly above, operation may be easily achieved in a bit-oriented, or associative processor, type mode. To access any bit B of all words, the state of the X selection lines and the state of the Y selection lines are set to equal B. That is, X = Y = B. Each module then selects a bit B of its contents which is bit B of word (B ♁ M). The result is that bit B of each word is accessed. In such an instant however the words, as referenced to the modules, are not in order and the word order varies as a function of B; W = B α M. A permutation network is required such that the data associated with each word's bits may be placed at the same location for each bit. The specific operation of the permutation network is discussed hereinafter.
The MDA array 34 may of course be operated in a word-oriented mode, or for use in a general purpose digital computer. If W is the binary vector index of the memory word to be accessed, then X is set to equal W. At this point, all memory module address lines of those modules wherein mk = 0 will be set to the state wk or wk ♁ mk. Similarly, Y is set to equal W such that all memory module address lines for those modules where mk = 1 will be set to the state wk or wk ♁ mk. Therefore, considering the X and Y array selection lines together it follows that each module M receives address B = W ♁ M. At address B of module M is bit B of word (M ♁ B) = W. Hence each bit of word W may be accessed by setting X = W and Y = W. The accessed bits however are not in order as referenced to the modules but vary as a function of W; B = W ♁ M. Here again a permutation network is necessary for arranging the order of data into or out of the memory. Again, the function of the permutation network in this regard will be discussed hereinafter.
Associated with each MDA memory 34, is a single response store 36, the elements of which are the subject of co-pending patent application Ser. No. 344,316 filed Mar. 23, 1973, now U.S. Pat. No. 3,863,233, and assigned to Goodyear Aerospace Corporation of Akron, Ohio. The response store 36 performs the arithmetic and logic function required in processing the data associated with the associative array. In the preferred embodiment utilizing 2n by 2n MDA arrays, the response store will contain 2n elements, each element containing three flip-flops. A Y flip-flop 40 generally will contain the results of search, arithmetic, and logical operations; an X flip-flop 38 is generally used to store intermediate results; and an M flip-flop 42 masks or selects the words participating in the desired associative operation. The M flip-flops provide the important and necessary feature of allowing the selection of operation subsets from the total memory content, such that operates may be performed on these subsets without disturbing the contents of unselected bits.
As is clearly related to the above-identified copending patent application, a simple J-K flip-flop may be utilized in conjunction with the output of the memory array 34 and two timed logic pulses to generate all sixteen logical functions which are capable to be generated between two variables. This flip-flop is referred to as the Y flip-flop. As is shown in the illustration of FIG. 2, the X and Y flip-flops are interconnected such that intermediate data from the operations performed by the Y flip-flops and the above referenced control signals can be temporarily stored in the X flip-flops. Hence the X and Y flip-flops in conjunction with each other provide means for presenting the results of two operations such that the results thereof may be utilized to control a final logical operation. The utilization of a flip-flop to control, by the output thereof, the enabling or inhibiting of a gate is of course well known in the art. The third flip-flop, the M flip-flop, is also an inhibiting or enabling type of flip-flop which provides for the selection of the words or bits participating in a particular logical operation or array interrogation. Again, this masking is believed to be well known in the art.
Of key importance in the associative array 12 is a permutation network 44, the subject of co-pending patent application Ser. No. 291,850 filed Sept. 25, 1972, now U.S. Pat. No. 3,812,467, and assigned to Goodyear Aerospace Corporation of Akron, Ohio. This network provides the necessary function of arranging the lineal order of data into and out of the MDA memories 34 such that in either a word-oriented access or a bit-oriented access the data into or out of the MDA memory 34 will be in a consistent logical order. The permutation input selection gating 46 selects the data whose lineal order is to be permuted, that data coming from either the response store 36, the MDA memory 34, the parallel input 14, or the argument register 56 to be discussed hereinafter. Such a circuit may be constructed of data selectors similar to those comprising the permutation network as will be discussed below.
The specific structure of the permutation network is of course clearly related in the above-mentioned patent application. Suffice it to say for this application that the permutation network arranges the order of data into or out of the response store or data interface such that the data associated with each memory module M may always be placed at some unique position P in the data interface where P = X ♁ M. Of course, P, X, and M are all unique n-element binary vectors. In bit-oriented mode, X is set to equal B; therefore, P = B ♁ M = W; that is, in bit-oriented mode the data associated with any particular word W will always be placed at the same unique location P in the response store or data interface. In word-oriented mode, X is set to equal W; therefore, P = W ♁ M = B; that is, in word-oriented mode, the data associated with any particular bits B will always be located at the same unique position P in the response store data interface. Thus it can be seen, the purpose of the permutation network is to direct the transfer of the data from the response store to the memory of from the memory to the response store in accordance with the mode of access being made to the memory.
A permutation network capable of performing the desired function may readily be constructed of commonly available k-channel data selectors. A plurality of such data selectors are arranged into r levels such that any level z contains 2n kz -channel data selectors, the outputs of which are the inputs of the data selectors in a succeeding level (z + 1), where z is less than or equal to (r-1) such that the relationship among n, r, and kz is given by the equation n = z=0r-1 log2 kz.
In the permutation network contemplated for use in the instant application, all of the channel select input lines of data selectors in any given level are joined together and connected to an appropriate circuit, preferably a binary register, the output of which is controlled by the permutation function X. Thus the data on the input lines of the permutation network is channeled through the various data selectors thereof in accordance with the output of the register containing the permutation code X and the data appears on the output lines of the permutation network in accordance therewith.
With reference to the above attenuated description of the operation and construction of a simplified permutation network, generalized wiring rules for any permutation network may be presented. A typical logic data selector adaptable for use in the construction of a permutation network is the four-channel data selector, MC1228, manufactured by Motorola Semi-conductor Incorporated of Phoenix, Arizona. Such a data selector would typically have four data inputs, D0 through D3, one data output, and two binary-coded channel select inputs, C0 and C1, by which any of the four data inputs may be selected to appear on the output. In the permutation network the output lines of the data selectors on one level comprise the input lines of the data selectors in the succeeding level. The data selectors are labelled with binary vector indices and the output line of any data selector is accorded the binary vector index of that data selector.
It should be appreciated that a permutation network permutes the lineal order of data in a series of steps, these steps being performed in each of the various levels of the permutation network. The input lines for any level within the permutation network are grouped such that all lines in a group have common elements in their binary vector indices except for those elements which are to be operated on in that level. Each such group of lines then goes to that group of data selectors which shares the same commonality of elements in their binary vector indices as do the lines. The lines in data selectors are then wired together with respect to the elements of the vector indices which are not common. That is, associated with every line L there is a binary vector L consisting of those ordered elements in the binary vector L which are correspondingly dissimilar to those of the other lines in the group and corresponding to every data selector S there is a binary vector S consisting of the ordered elements in the binary vector S which are dissimilar to the corresponding elements of the binary vectors of the other data selectors in the group. The wires within a group are then wired to the data selectors in the corresponding group such that line L goes to data input B of data selector S in accordance with the formula D = L ♁ S.
It should be noted in applying these wiring rules that the number of lines or data selectors that will appear in a group will be equal to the input capacity of the data selectors used in construction of the permutation network. If K-channel binary coded data selectors are used then the data selectors and their input lines will be grouped in groups of K and the number of elements in the binary vector L which will be operated upon in any level of the permutation network will be equal to log2 K. Consequently, the binary vector LS will contain log2 K elements which will appear in the same order relative to each other as they did in the vectors L S respectively. For example, if in one level of the permutation network the elements 14 15 of the vector L are to be operated upon, then L = (15 14) and S = (s5, s4); consequently, D = (15 ♁ s5, 14 ♁ s4). By following these wiring rules throughout, a permutation network may be readily created whereby the data contained in any position P in a data interface may be transferred through the permutation network to an output position M in the memory array in accordance with the formula P = X ♁ M where X is an n-element binary code.
The associative array 12 provides four basic operations within the system. These operations may be grouped into the following categories: reads, writes, logical, and resolve address.
Data is read from the MDA memory 34 in either the bit or word mode. The lineal order of the data read from the memory is arranged in the permutation network 44, and is then channeled to either the response store 36, the parallel output lines of the parallel input/output 14, or the argument register. All such reading operations from the MDA memory 34 are non-destructive. When data is read from the MDA memory 34 into the response store 36, operations may then be performed upon this data before it is read out on the parallel output lines 14.
Data is written into the MDA memory 34 in either the bit or word mode. The data, regardless of the source, may be written through a mask which is designated by the state of the M flip-flops of the response store. The mask alows access to certain bits to be written while the state of the other accessed bits, those masked, remain unchanged. The data to be written may come from either the response store 36, the parallel input lines 14, or the argument register 56. The response store 36 may also be loaded with the contents of the parallel input lines 14 or the argument register 56.
Certain logical and arithmetic operations such as exact match search and add fields may be performed upon the data in the response store. By controlling the response store, data read from the MDA memory 34 may be logically combined with the contents of the response store 36 to accomplish these ends. Data from the argument register 56, the parallel input 14, or the MDA memory 34 may be logically ANDed, ORed, or exclusive-ORed with the previous contents of the response store 36. Data may also be moved among the response store elements within the associative array 12.
In many operations it is desirable that the address of the first word to respond to a given criteria be made avaiable for further operations. The response store 36 continuously resolves the addresses of words responding to given criteria such that the first respondoer to a given operation is available.
The manner of achieving the four above mentioned basic operations of the associative array 12 may now be summarized. In each associative array operation an input to the permutation network is selected. The inputs may include any one of the following:
1. A bit slice containing one bit from each of the 2n words in the MDA memory 34,
2. A word slice containing all 2n bits of one MDA memory word,
3. The contents of the 2n M flip-flops 42,
4. The contents of the 2n Y flip-flops 40,
5. The contents of the 2n X flip-flops 38,
6. A 2n - bit parallel input from the input/output lines 14, or
7. The contents of the argument register 56 contained in AP control 16.
The selected input is transmitted through the permutation network 44, which shifts or permutes the lineal order of the data in a manner controlled by the operation. The 2n - bit output of the permutation network 34 is then communicated to one or more of the following:
1. The MDA memory 34 which stores it as a bit slice
2. The MDA memory 34 which stores it as a word slice
3. The M flip-flops 42 which store it as a new mask
4. The Y flip-flops 40 which use it in a logical operation to modify their contents
5. The X flip-flops 38 which use it in a logical operation along with the contents of the Y flip-flops to modify their contents
6. The parallel output lines 14, or
7. The argument register 56 of AP control 16.
As indicated in FIG. 1, the instant invention comprises a plurality of associative arrays 12. Each such associative array comprises an MDA memory 34, a response store 36, a permutation network 44, and permutation input selection gating 46 whereby each associative array 12 may read or write data, perform logical operations upon the data, and resolve the addresses of responders to the operations. All such functions of the associative array 12 are performed in parallel upon 2n bits simultaneously. The number of such arrays required in a system is dependent upon the size and number of data sources to be serviced. The actual control of the elements of the associative array 12 and the relationship that the associative array 12 has toward other elements of the system will be fully described hereinafter.
The second of the three memory systems comprising the instant invention is the AP control memory 18. The main function of this memory is to store AP control instructions. It is also capable of storing items of data and acting as a buffer between AP control 16 and other elements of the system. Since the control memory is separate from the associative arrays 12, AP control memory 18 cycle time can overlap that of the associative arrays 12. The fast execution times of AP control 16, described hereinafter, imply that a fast memory is needed. To put all of the AP control programs in such a fast memory is prohibitively expensive, so AP control memory 18 is divided into sections. Three fast, small sections called pages hold the current AP program segments and a slower large section holds the rest of the AP program. A program pager 24 is included in the instant system to facilitate the transfer of instructions from the slow large section to the fast smaller sections of the AP control memory 18.
Although any number of page memories may be included in the AP control memory 18, the preferred embodiment requires three such memories. Each page memory uses fast bi-polar solid-state elements. In normal operations, the first page would contain a library of commonly used micro-programs while pages 2 and 3 would be used in a ping-pong fashion with AP control 16 reading instructions out of one page while the other page is loaded by means of the program pager 24. Each page memory has a port switch, a part of memory port logic 26, which allows it to be connected to one of three busses. At any given time a page memory may be
1. connected to the instruction bus which allows AP control 16 to read instructions from the page, or
2. To the pager bus which allows the program pager to load the page, or
3. To the sequential bus which allows sequential control and memory 20 to read items from the page.
The high-speed data buffer (HSDB) is a section of AP control memory 18 using fast bi-polar solid-state elements. All busses which can access AP control memory 18 can access the HSDB making it a convenient place to store data and instruction items which need to be accessed quickly by different elements of the system. The HSDB has a priority port switch, a part of memory port logic 26, which resolves any conflict between busses competing for access to the HSDB. Each memory cycle is given to the highest priority bus requesting HSDB access while other busses requesting such access wait for subsequent memory cycles.
The largest portion of AP control memory 18 is the bulk core memory which uses non-volatile core storage. This meeory is accessible to all busses which can access AP control memory 18, a priority port switch, a part of memory port logic 26, giving each memory cycle to the highest priority bus requesting a bulk core access. Since it is large and non-volatile, the bulk core memory is useful for storing the AP control programs. Although the bulk core memory is considerably slower in cycle time than the page memories, the use of proper programming techniques make it possible to deal portions of the AP program from the bulk core memory to the faster page memories for further use by AP control 16 such that the system will hardly ever wait for a program segment. That is, while AP control 16 is receiving a program segment from one of the pages, the other can be loaded by the bulk core memory such that that page will be available to AP control 16 when the latter is finished with the first page. It should also be noted that since the bulk core memory is accessible by all busses accessing AP control memory 18, it is also useful as a buffer for data items which do not require the higher speed of the HSDB.
AP control memory 18 also provides for direct memory access (DMA) 28 to external memory sources. These external memory sources may be desirable in lieu of greater storage capacity in the page memories or the HSDB. Direct access to a host computer memory allows that memory to act as part of the AP control memory, as well as a host computer memory. Items in the host memory are equally accessible by a host computer and the instant system, thus reducing the need for a buffered I/O transfer between the two. A wide variety of computers are amenable to such a situation, such as the Xerox Data Systems, Sigma 5. A priority port switch, a part of memory port logic 26, resolves any inter-bus conflicts which may arise in seeking access to the host memory. A buffered input/output (BIO) 30 is provided for tying several different types of peripherals into the AP control memory 18. In addition, the BIO can be used to transfer blocks of data and/or programs between the AP control memory 18 and the host memory.
As can be seen, the AP control memory 18 provides a broad base of programming capability for the instant system. It comprises a wide range of elements and allows access to external sources such that the instant system may be economically provided with an extremely large source of rapidly accessible program commands and intermediate data.
The last memory element of the instant system, is contained in the sequential control and memory 20. This element of the system contains a sequential process or (SP) with a suitable memory, input/output means, and interface logic to connect the SP to other elements of the system. The sequential control and memory 20 is used to provide:
1. A means to initially load the AP control memory 18,
2. A communication link between the operator and the system for on-line control and monitoring,
3. Off-line capabilities for assembling and debugging programs,
4. Control for system maintenance and diagnostic program routines,
5. Sequential arithmetic capability, and
6. Housekeeping capabilities.
Provisions are made for four distinct forms of communication between the sequential control and memory 20 and other elements of the system. First, sequential control amd memory 20 can read and write AP control memory 18 data. Secondly, to assist program debugging and hardware maintenance, certain of the system's registers can be read by sequential control and memory 20 by reading certain bus addresses. Thirdly, the sequential control memory 20 issues external function commands 32 described further hereinafter. Fourthly, the sequential control memory 20 can accept interrupts from other system elements. These interrupts may arise from error detection, a panel interrupt button for use by the operator, or external functions.
In general, the sequential control and memory 20 provides the means for initializing the system, loading the programs, activating and deactivating AP control 16, issuing interrupts, receiving interrupts from error detection means throughout the system, and providing other housekeeping tasks.
The three main memory elements in the system described herein above each perform vitally important distinct functions. The associative arrays 12 provide for the storage of data such that parallel access may be made thereto in either a word-oriented mode or a bit-oriented mode, and further provides for parallel operations upon such data. The AP control memory 18 provides storage and rapid accessibility to the system programs and temporary storage for intermediate data. The sequential control and memory 20 provides for initialization of the entire system, provides for the interjection of external commands, and generally provides for the basic housekeeping tasks of the entire system.
The AP control 16 fetches its operations from the AP control memory 18. AP control 16 is directly responsible for manipulation of data within the associative arrays 12 under control of the program contained within the AP control memory 18. Associative operations are coordinated and controlled by AP control 16 which, as shown in FIG. 3, comprises the following basic sections: instruction register 50, program control 52, bus logic 54, argument register 56, field pointers and length counters 58, response store control 60, array control 62, and resolver 64.
Instructions are loaded into the instruction register 50 from AP control memory 18, such that at any point in time the instruction register will contain the instruction being executed by the system. The sequence in which the instructions are read from the AP control memory 18 to the instruction register 50 is controlled directly by program control 52, which comprises: a program counter containing the address of the instruction being read from control memory, a start loop marker or register used to store the first address of the loop whenever a loop instruction is executed, an end loop marker or register used to store the last address of an instruction loop, a comparator to compare the address contained in the end loop mark register to that in the program counter, and a status register, containing the interrupt mask for the AP control interrupts used in the system.
The bus logic 54 provides a common data path for all pertinent registers of AP control 16 and the data bus from AP control memory 18. The bus logic 54 is capable of shifting the bus data, the shift being controlled by the instruction moving the data.
The argument register 56 may contain the argument for a search operation performed on the associative arrays 12, input data to be written into the arrays, or output data read from the arrays. The array output data is loaded into the argument register 56 through a mask generated therein. The use of the mask allows the formating of an output word from the associative arrays 12 from non-contiguous data in the array.
In the preferred embodiment of the instant system, field pointers and length counters 58 comprises three bi-directional counters into which the array, bit, and word addresses associated with any given operation are loaded, and two field length counters to control the number of cycles for a given instruction loop such as search, add fields, or multiply.
The response store control 60 controls the logical function and timing of the response store 36. The former comprises a control line conditioner which generates the control line signals required to manipulate the latter. The control line signals are generates as a function of the contents of the instruction register, the argument register, and the inclusive or output of the resolver 64. A control line buffer controls the timing of the control line signals transmitted to the associative arrays 12.
Array control 62 controls those lines to the associative arrays 12 not controlled by the response store control 60. Array control 62 comprises an array select register whereby the associative arrays 12 to be operated upon may be made available to access, array address select logic for accessing any of the particular arrays enabled by the array select register, array mode logic whereby determination as to bit mode or word mode accessing may be made, mask address logic for controlling the position of the write mask within the associative arrays 12, and shift control logic for generating the control signals required by the associative arrays 12 for permuting, shifting, or mirroring the lineal order of the data associated with the arrays.
The resolver 64 contains the logic whereby the array address and the word address of the most significant responder to a given operation may be resolved. Generally, the responders will indicate those words satisfying some search criteria. The resolver then loads the array address and the word address of the responder into the field pointers of field pointers and length counters 58 such that subsequent operations may be performed on the first responder without affecting other words.
In general then it can be seen that AP control 16 is directly responsible for the manipulation of data within the associative arrays 12 under the control of the program contained within the AP control memory 18. The simultaneous control of any of all of the associative arrays 12 may be achieved through AP control 16 which uniquely comprises an arrangement of registers, counters, and high-speed logic devices.
The program pager 24, referred to hereinabove, loads the high-speed page memories from the lower speed parts of the AP control memory. The program pager performs these transfers independent of AP control such that while AP control is executing a program segment out of one page of memory, the program pager 24 can be loading another page of memory with a future program segment. Each page memory has a port switch, a part of memory port logic 26, to prevent AP control 16 from jumping into a segment before the pager has loaded it. Pager operation is initiated by external function codes. Under standard programming procedure, sequential control and memory 20 starts the first pager operation to load the standard sub-routines and initial program segments into the page memories and then AP control 16 starts the later program operations to load other program segments when they are required. Provisions have been made whereby the program pager may instantaneously stop the loading of any given program into a page, and begin the loading of another program is such is required. This situation is most likely to occur in programs containing many braching networks. The prgram pager contains three distinct registers. A GET address register holds the AP control memory address from which the next source word is to be moved or from which the next pager command is to come. a PUT address register holds the address of the memory location into which the next word is to be put during a move data operation. A count register indicates the number of words still to be transferred during a transfer operation. In general, then, the program pager 24 contains the source address, the destination address, the number of transfers yet to be performed, and the means for loading the high speed page memories from the lower speed parts of the AP control memory 18.
It has been shown that the instant invention presents a novel solid state associative processor organization flexible in size, rapid in processing time, accurate in operation, inexpensive to build, and adaptable to numerous uses. The system comprises the arrangement of a plurality of associative arrays each capable of the parallel processing of a large volume of data, a control memory system comprising a large variety of memory elements each selected as to its characteristics of size, speed, volatility, and expense, and input/output system whereby external data or commands may be received from any one of numerous peripheral sources, and whereby large quantities of data may be simultaneously written into or read from the associative arrays, and a control network whereby the associative arrays may be controlled in accordance with the programs contained in the control memory network in such a manner that the associative arrays will receive control instructions with such rapidity that they will never have to wait for a command.
While in accordance with the Patent Statutes only the best known and preferred embodiment of the invention has been presented and described in detail, it is to be understood that the invention is not to be limited thereto or thereby but that the true scope of the invention is defined in the appended claims.


text:
We've got some great outdoor and survival knives and gear from the best knife brands in the business, including Spyderco Knives, Cold Steel, Bark River, CRKT, and more!
Bark River JX6 Companion Series
The Chris Tanner-designed JX6 Companion is an everyday carry fixed blade with an ergonomic shape that lends itself well to skinning, slicing, and chopping. We have new variants that Bark River recently debuted which upgraded the A2 tool steel on previous models to CPM-154 super steel.
Spyderco LC200N Steel Native 5 Salt Knives
One of Spyderco's most popular folders has now been fitted with rust-proof LC200N steel and lightweight FRN handles as the new addition to their Salt Series. With both serrated and plain blade options, this ultra corrosion-resistant knife is great for fishermen, boaters, or anyone who spends time on the water.
Cold Steel Bushman Integral Fixed Blades
The blades and integral handles in Cold Steel's Bushman Series are expertly forged out of thick slabs of SK-5 high carbon steel. Carefully ground to an extra thin edge, you can either pick up a Bowie-style variant or a standard straight back – both profiles make for great survival knives.
Swiss Military Surplus Pack Hatchet
This small camping axe is 15.75" and so well-balanced you can pretty much put a hand anywhere on its hardwood ash handle and still make some stellar chops. Add the fact that it offers Swiss-made steel and you've got yourself a great survival hatchet for less than twenty bucks.
CRKT Ken Onion Prowess Flippers
Ken Onion is known for producing some wildly creative designs, but the Prowess is a stripped down, rugged knife that goes against his usual grain. This is a great knife for camping or hunting that feels good in the hand, opens fast thanks to IKBS, and is lightweight and nearly indestructible.
Condor Sabertooth Machetes On Sale
Condor's Sabertooth machete is available with either a 12" or an 18" 1075 high carbon steel blade and high impact polypropylene handles. The black powder coating is going to hide your use marks well, which is good – considering they're both less than fifty bucks, you'll be using and abusing them.
Camping and Survival Fire Starters
We've got a great collection of fire steels, fire starters, compasses, match tube holders, parashovels, fire starter gels, and more. These are must-have outdoor essentials that anyone who's looking to put together a safe and secure campsite will need.
If you're looking for a lightweight honing steel to keep your edge ripple-free between sharpening sessions, pick up the Old Timer Honesteel. This is a tried and true honing steel with a chisel point, a lanyard hole with a leather lanyard, and a brown leather belt sheath. This honing steel has been a staple for many knife owners for decades, so it's about time you picked up your own.

subset: commoncrawl


text: Sign Up for a free download Agileload in the Application testing cycle Performance testing/ Application performance testing/ Agileload in the Application testing cycle Using a performance tool such as AgileLoad can give you recommendations on what to do, which are very useful for system tuning. This becomes a cyclical process. Test – Tune – Test – Tune -- Test. Until we're at a point where the performance engineering cycle is over and the results can be documented properly in a report and the recommendations, if there are any, can be made. A number of users are going to be going in through the network infrastructure into the application, as well as a number of web servers, application servers and database. We use AgileLoad Center to control AgileLoad injectors. Now, these injectors can run on the same machine as AgileLoad Center or if you've got particularly large performance test requirements, you might need to distribute that one to several machines or you might want to distribute the load around the world. For example around your network in order to get an insight on response times from different network locations. We generate load on the application. We hit the web server, which in turn makes a service request to the application server, which in turn makes a database request to the database and then it sends messages back up the stack. We end it with an end-to-end performance test while this is running AgileLoad can also monitor the performance of each of our infrastructure nodes. Things like CPU or database calls or memory utilization or network utilization and so on. It pulls this altogether and puts it into AgileLoad Center. Next Agileload analysis and output


text:
Long before its official start date, a single diagnosis led to the founding of The Bonnie J. Addario Lung Cancer Foundation (ALCF). During Christmas week in 2003, I found out I had lung cancer. At 56, I was a wife, a mother, a grandmother, Petroleum CEO, and one of millions of Americans diagnosed with the disease.
Faced with a 16% survival rate and following a 14-hour surgery, radiation, and chemotherapy treatments that invaded my formerly predictable world, I became a survivor with a new purpose in life.
Despite losing three family members to cancer of the lung, when the doctor said, "You have lung cancer," I realized I knew very little about the disease. So, I searched for information.
I was surprised by how difficult it was to find credible information on the disease, treatment options, and how to live with cancer. Everyone kept saying, "Cancer is a journey," but no one could provide me with a roadmap. I was lost and I only just diagnosed.
In a unique position to become the voice for the other 1.5 million people personally affected by the number one cancer killer, I began to think of ways to help people facing the crisis of this highly stigmatized disease. I asked myself,
"What about the 450 patients who die each day of lung cancer in the U.S. alone…and What about their families? Where's the outrage?"
During my first chemotherapy treatment, I made a promise to myself: If I survive this, I will do something about the social injustice surrounding lung cancer. On March 6, 2006, the news broke that Dana Reeve lost her battle with lung cancer. I decided enough is enough. ALCF was born.
What is the mission of ALCF?
I founded ALCF to empower those diagnosed with lung cancer through education and to fund novel research efforts that directly impact patients today. Our innovative patient education programs support patients and their families.
[Editor's Note: The Addario Lung Cancer Foundation has a 4 star (the highest) rating by Charity Navigator.]
We support promising research projects through our grants program and the formation of The Addario Lung Cancer Medical Institute (ALCMI), an international consortium dedicated to developing treatments that are more effective for lung cancer patients. To date, we have raised nearly $25 million and dedicated approximately 90% to novel research projects, patient education, and lung cancer awareness programs. Our ultimate goal is to make lung cancer a chronically managed, survivable disease by the year 2023.
The ALCF is one of the largest philanthropies (patient-founded, patient-focused, and patient-driven) devoted exclusively to eradicating lung cancer through research, early detection, education, and treatment. Our goal is to work with a diverse group of physicians, organizations, industry partners, patients, survivors, and their families to identify solutions and find a cure for lung cancer.
ALCMI's ground-breaking study, "The Genomics of Young Lung Cancer Study," aims to understand why never-smokers under the age of 40 are getting lung cancer and if they have a unique cancer subtype that doctors can treat differently. The development of targeted therapies—medicines designed to address the underlying genomic drivers of cancer—has revolutionized the treatment of lung cancer, however, there is an inherent need to match the right treatment to patients based on their specific genomic makeup.
Lung cancer, smoking, and stigma
Lung cancer kills more Americans than the next three most common cancers combined. Eighty percent of the people diagnosed either quit smoking decades ago or never smoked, but there is still a stigma attached to this cancer that takes the lives of nearly 160,000 Americans each year. During the past 39 years, the lung cancer death rate has fallen 29% among men while increasing 102% among women.
It is true that smoking is the number one cause of lung cancer. But every year, doctors diagnose more and more people who have never smoked a day in their lives. Lung cancer in never-smokers, if considered a cancer unto itself, would be the sixth deadliest cancer in the U.S. The American Cancer Society estimates that nearly 25,000 Americans who never smoked will die of lung cancer every year. That is greater than the number of deaths associated with leukemia, non-Hodgkin's lymphoma, liver, ovarian, and bladder cancers.
Because there is so little funding for lung cancer research, we still don't know why the number of never-smokers with lung cancer is increasing. Prevention and early diagnosis are extremely challenging as there isn't a reliable early detection test other than a CT scan.
The importance of research
Research holds the key to discovering the causes of lung cancer, developing effective treatment options, and delivering those treatments to patients in a timely manner. What can we do to predict lung cancer risk, detect the disease at early onset, and, ultimately, prevent it? Are there novel drug combinations that researchers can create to preempt and overcome cancer cells? How can we personalize and provide targeted treatment for each individual patient? By funding research, the ALCF hopes to find the answers to these and other critical questions.
Patients participating in The Lung Cancer Registry have the opportunity to help researchers better understand the disease and develop better treatments. In turn, because it is an open platform, patients can do their own research and find information about others' treatment plans and what does and does not work with similar cancer types.
With more than 18 million people worldwide diagnosed with lung cancer each year, there is a dire need to improve patient outcomes and quality of life. The more people who register, the more data there is to study. Researchers can identify patterns in the data that could lead to more effective treatments and better outcomes. When there are clinical trials or research specific to the type of lung cancer users have, they can opt in to participate in studies.
This data provides critical information to identify new trends, recognize the most important treatments, and develop new clinical trials and care practice guidelines. We need patients to opt-in because we need their information.
With the onset of new targeted therapies, comprehensive genomic profiling, and now immunotherapy, we can finally see the light at the end of the tunnel. But in order to progress, we simply must increase the funding for this disease and say goodbye to the myth that it is solely a smoker's disease.


text:
Summer tutoring expands to year-round program
Supporting Island Families -
The Summer Tutoring Program for Kids was one reason Shaylyne Carver had such a fun summer.
Shaylyne was one of 700 students who participated in the summer literacy program, which wraps up this Friday, August 25. Starting this fall it will be known as "Ready, Set, Learn!" and will expand to offer year-round programs to keep students engaged in learning.
"We read, write, play, and make crafts," said Shaylyne, remembering her summer with the tutoring program. "I really like it because it's all really fun."
The PEI Literacy Alliance hosted the summer tutoring program in 21 public libraries across the province to encourage literacy and prevent summer learning loss for students. More than 20 tutors individually taught 30 students every week during July and August.
"The Summer Tutoring Program for Kids began in 1998 with 97 participants and to date it has tutored 10,788 students," said Gina Hyson, the youth programs director of PEI Literacy Alliance. "Through the support of our partners, this program has expanded to become the Ready, Set, Learn! program, which will provide day camps throughout the school year, as well as tutoring during the summer. We aim to help fill the gap in supports for Island students."
The provincial government's departments of Education, Early Learning and Culture as well as Workforce and Advanced Learning provided a combined $41,500 to the alliance to help hire tutors and a coordinator.
"Our schools and libraries are pleased to partner in this valuable program, which helps children build reading skills and prepares them for a successful school year," Education, Early Learning and Culture Minister Doug Currie said. "One of the things that makes Prince Edward Island mighty is how Islanders work together to achieve great things, and partnering to make our children better readers is a powerful way to help them succeed in life."
Other partners in Ready, Set, Learn! are Service Canada, the United Way of PEI, Skills PEI, Raise a Reader, PEI Association for Newcomers to Canada, and RBC – with nearly $87,000 in contributions.
Media contact:
Jean Doherty


text:
Various. Board-game. 1-2 hours. Determine where to place new develops to place new develops to find tradeoffs between development gains and ecosystem service losses.Read More
Various. Board-game. 1-2 hours. Determine where to place new develops to place new develops to find tradeoffs between development gains and ecosystem service losses.Read More
Sustainable Cities and Communities. Mobile game. 2 hours. Manage an evolving world by matching resource tiles and generating new results and products.Read More
Sustainable Development Goals. Board Game. 30-60 min. Go Goals! helps children understand the Sustainable Development Goals impact their lives.Read More
Clean water. 2 hours. The Public Infrastructure Participatory Engagement Simulation recreates features of an American system with aging infrastructure.Read More
SDGs, Peace and Global Citizenship. Mobile Game. Android and iOS. A narrative, research-based video-game inspired by the Sustainable Development Goals of the United Nations.Read More
Responsible production. Board game. 2 hours. In the Nexus! Challenge you can play a country or company and face obstacles to explore the resilience of the energy-food-water nexus.Read More
Sustainable cities and communities. Clean Water and Sanitation. Board Game. 1 hour. In the Game of Floods, players take into their hands a future of a hypothetical Marin Island.Read More
Responsible Consumption and Production. Clean Water. 2 hours and more. In the River Basin Game, players become farmers whose main goal is to increase their income to maintain the wellbeing of their families.Read More
Social simulation. 5-6 hours. 11-44 players. THE WORLD'S FUTURE game is an interactive role-playing simulation game which enables players to face the great challenges of our time.Read More
Society and environment. Online game. 2 hours and more. Build a civilization in a simulated ecosystem. Education about environmental impact and collaboration.Read More
Energy. Simulation. Water and energy. 2 hours and more. The Nexus Game gives participants a unique opportunity to get an insight into managing the water needs of energy production.Read More
Cities and communities. Simulation. Floods and Culture. 1-2 hours. Gifts of Culture is a board game role-playing simulation of a diverse cultural community. It allows players to experience how cultural differences can lead to troubles but at the same time they can also be helpful.Read More


text:
Sports Card Blogs
Recent headlines and news,Premier league, champions league, European and world football football news.
Recent headlines and news,Premier league, champions league, European and world football football news.
DORCHESTER, N.B. — Police in New Brunswick are looking for a convicted murderer from Dorchester Penitentiary who failed to return to a minimum-security unit after he was granted an unescorted temporary absence.
The Correctional Service of Canada says 66-year-old Jack Woods is serving an indeterminate sentence for manslaughter and second-degree murder.
The agency says Woods was staying at a community-based residential facility in Moncton when he left and didn't come back Thursday.
Woods stands 5-7, weighs 223 pounds and has a fair complexion, blue eyes, brown hair and is missing both of his little fingers.
He also has a leopard tattoo on his right upper arm and skull tattoos on his left forearm and upper arm. A warrant has been issued for his arrest and the RCMP have been called in.
Dan Melanson with the Dorchester Penitentiary said Friday that Woods was serving a life sentence, but could not confirm when his sentence was classified as indeterminate.
Melanson said an offender with a life sentence can be deemed indeterminate after demonstrating progress, but said people should still be cautious.
"Is he dangerous? I don't know," Melanson said. "Possibly (with) the rehabilitation that we gave him over the years, maybe he's not, but then again, he's done it once."
The Canadian Press reported in 1994 that Woods and another man were to stand trial on first-degree murder after the bodies of two Alberta men were found. The bodies of David Rosamond and Harvey Bernard were found in 1993, buried in shallow graves in Alberta.
Woods has escaped before. In 2011, a Canada-wide warrant was issued for him after he fled to Nanaimo, B.C. from an Ontario halfway house.
Click Here: Cheap Chiefs Rugby Jersey 2019
RCMP said in 2011 that Woods was convicted in 1996 for second-degree murder and was paroled in 2009.
Police cautioned at the time that Woods was an experienced outdoorsman who had let it be known that he was not prepared to go back to jail.
At the time, Woods was described as potentially dangerous.


text:
Cox Law Firm in Dallas/Fort Worth, TX
Sound Counsel. Excellent Service.
Dallas/Fort Worth Business Law Firm
The Cox Law Firm, PLLC was founded in 2009 and handles matters ranging from business, real estate, and construction transactions and litigation to family law, entity formation, estate planning and probate, general civil litigation, and personal injury cases.
Ed Cox is a 25-year, AV-rated Super Lawyer. He practices with Paul Goetz, who has nearly forty years of diverse civil litigation and family law experience and Steve Pierret, who has practiced more than thirty years and is a double-board certified trial lawyer. Details on our full staff and experienced team are available here.
Ed Cox Attorney / Escrow Officer
Paul Goetz III Attorney
Steven Pierret Attorney
Mary Torres Attorney / Escrow Officer
Tate Roush Attorney / Escrow Officer
Our Clients
Our clients include public and private companies with national operations, local and nationwide contractors, subcontractors, suppliers, engineers, architects and builders, buyers and sellers in commercial and residential real estate transactions, and other businesses, municipalities, and individuals. We primarily practice in North Texas, providing sound counsel and excellent service to people in Tarrant and Dallas counties, and throughout the State of Texas.
Our attorneys have significant experience in state and federal courts, administrative agencies, arbitrations, and mediations. We also operate a fee office for Chicago Title with experienced escrow officers and assistants who place a premium on customer service and knowledge of the closing process. We pride ourselves on our availability, resourcefulness, strategic thinking, and results. Our clients value our sound counsel and excellent service.


text:
Suze Orman did a smackdown of the FIRE (Financial Independence/Retire Early) movement on Paula Pant's podcast. She said she "hates it, hates it, hates it." Interesting since her publicist asked Paula for the interview, as well as asking this of other FIRE podcasters, in order to push Suze's new book, products and events. Talk about inviting yourself to dinner and then complaining about the food!
Mr. Money Mustache did an excellent job of correcting her misimpressions of what we all are up to with saving and investing money early in life so we can be free to pursue what matters more than money. I don't have anything to add to his explanation.
Coach Carson posted a balanced, informative response, appreciating Suze's admonition to be sure you have enough for a risk-free retirement. Suze enumerated a string "what can go wrong" scenarios as evidence that early retirement (on less than $10 million) leaves you vulnerable when life hands you lemons — a whole tree of lemons. He — and MMM — responded evenhandedly but ultimately, here's what Carson said she got wrong:
1. Early retirees are not withdrawing from life. They're embracing a purposeful life MORE fully than ever.
2. Early retirees are not wild risk-takers. They are calculated risk-takers. They see the old bargain of a 9-to-5 job until they're 70 as riskier than an early retirement.
3. The retirement plans of most early retirees aren't naive, fragile castles built on sand. At least the ones I know of are anti-fragile, multilayered, flexible plans built on a combination of investment savings, retirement accounts, side businesses and backup plans.
For myself, post-FI life has thrown plenty my way. Cancer. The death of a partner. Homeowner miseries like a flooded basement, failed siding and carpenter ants. But none of this has thrown me. I find that much of what happens in early retirement can be addressed fairly easily through a combination of building close relationships with family and friends, insurance, a prudent stash in a money-market fund, level-headed and lower-cost choices, a MacGyver DIY knack and some gigging.
Read MarketWatch's interview with Vicki Robin
But this post isn't to quibble about whether my frugal lifestyle as failed me — which it hasn't yet in 73 years. This post is to challenge Suze's experience with retirement — and retirement itself.
She said to Paula:
"I'm telling you, I just did it for three years on my private island. I retired at 65. I shut down the Suze Orman show. I sold five homes. I got rid of five cars. I stopped going on QVC. I stopped writing for Oprah's magazine. I stopped giving talks. I stopped doing everything, and I had a great time for three years. I learned how to fish. I learned how to win tournaments. I learned how to be the captain on my boat. and all of a sudden it was like, "Oh, there's still stuff for me to do." Now. I was in a field that everybody welcomed me back, when I came back. They were excited to see me in the halls of NBC and MSNBC, and everywhere that I went this past week."
I think there is retiring forward and retiring backward. Suze did what many early retirees do. She left her day job. She got rid of excess not needed in a post-job life. For most, it's getting rid of the car to impress clients or five suits for a weekly rotation at the office. For Suze, it was five cars and five homes.
Indeed, the simple life is one of the lures of early retirement.
This can mean time in nature, reading, meditation and family life. For many who achieve financial independence (FI), compensatory spending — the shopping you do to reward yourself for a tough week at work — disappears. For Suze it was quitting the QVC habit.
FIers might travel to exotic places. For some it's backpacking. For Suze it was living on her private island.
And people tend to learn new skills. For most it's a language or an instrument or home cooking. For Suze it was fishing and tournaments and being a captain of a boat.
And then, a couple of years in more or less, the identity confrontation lands with a thud. Who am I now that I am not my job? How do I explain myself to others? How can I gain the respect and voice I had with my old job? I was somebody. Now I'm nobody.
Retiring forward is using this crisis of identity to grow spiritually or take on some of the bigger issues in the world through volunteering, study, serving on boards, entrepreneurship, training or social innovations. Or they attend to the relationships they neglected as they hurried to their million or two.
Not everyone does this. Many retire backward, returning to their old professions after they've filled up on travel or hobbies, perhaps on their own terms, because that's where they felt competent, needed and, truth be told, important. Many do a bit of both and feel their way along to who they will be and how they might spend their time in this new world of freedom, choices and sovereignty.
From Suze's account, it sounds like she retired backward into her old role. OK. But what did she learn in those hiatus years that she can share with her audience? It seems from other comments she learned that even $10 million in a retirement account is not enough. That stuff happens and money is the answer. I hope for all our sakes that she learned more than that and will share it.
The question for early retirees is: "To what am I dedicating my freedom?" It's really not about how many millions you have — Suze's assertion. Nor how much play you can do before you get bored and go back to your old job.
I suspect that Suze had a blast in her own way, but she didn't find anything in herself that wasn't Suze, so crawled back into that identity — and then asked to be on FIRE bloggers' podcasts to relaunch Suze.
In "Your Money or Your Life," we promised FI as a reward for systematically examining your relationship with money. I think this is what most people attracted to FIRE really want. Independence of thought. Of how they use their time. Of options. Of choices. Of dedicating their attention to something less soul-searing than cubicle life or the endless boring meetings of middle management. Retirement and freedom are two different animals. Doing "nothing" and doing your passion full-time are not even the same species.
Read:Millennials have more money than you think — so expect ESG funds in your 401(k)
People don't have to follow my path of service, spirituality and social innovation. There are so many ways to use your time for happiness, meaning, purpose and contribution. At the end of the day, we all want to have a well-lived life. Five houses and five cars and a private island — without a higher purpose — mean nothing.
Vicki Robin, the co-author of "Your Money or Your Life," is often called one of the founders of the FIRE movement. This is an abridged version of a blog post — "Suze Orman — A Wet Blanket on FIRE" — that appeared on her website.


text:
Wanted: 24 HuffPost Citizen Journos
GW student and D.C.'s resident Citizen Journo Daniel Lippman, take note. This may be just the position for you.
HuffPost is holding a contest to unleash 24 "journalists" on the upcoming presidential elections. Unlike most of their bloggers, who post for free, HuffPost is sending these souls on an all-expense paid trip to the conventions. The winners — up to 12 for each convention — will get official credentials, airfare, hotel accommodation for five nights, and a basic per diem.
But first, you have to take part in a convention season contest and hope and pray they think you're just goofy and inexperienced enough for the job (no offense, Daniel. They'd be lucky to get you).
Details…"We want to find the best, most creative citizen journalists in America and Canada and send them, at our expense, to cover the conventions in their own way, with their own vision and their own ideas." By March 8, send us an embeddable video explaining why we should choose you, what you would cover and which medium (or mix of them) you want to use to do so."
The greatest part: HuffPost plans to publish these videos. We can hardly wait.


text:
Latvian Defense Minister Raimonds Vejonis has turned to law enforcement authorities asking that the authorities investigate statements made by the "Non-Citizen Congress" activist and one of the organizers of the referendum to make Russian a state language in Latvia, Aleksandrs Gaponenko, in an interview with a Norwegian television, said the minister's advisor Andis Jekabsons, reports LETA.
On April 22, Vejonis turned to Interior Minister Rihards Kozlovskis, asking him to evaluate Gaponenko's opinions expressed in an interview with Norwegian television and later aired in Latvia by the TV3 television, and "take the relevant measures."
"It is unacceptable that the image of the state of Latvia and the National Armed Forces is being tarnished in such a manner, and that the international community is being misled about the objectives and tasks of the Latvian government," Vejonis notes in a letter to the interior minister.
Vejonis believes that Gaponenko is trying to disseminate tendentious information hostile to Latvia and to mislead the local and international communities. "The public statements by Gaponenko create a wrong impression about the involvement of the National Armed Forces in any kind of protests or rallies, likewise, statements such that the army could shoot at non-citizens or be used to suppress protests question the principles of Latvia as a democratic country," says Vejonis' letter.
During the interview with Norwegian television, Gaponenko said that the current government was inclined to suppress protests with the help of the army. "This is what they have said. And they imagine that Russia will stand by and watch women and children shot dead for fighting for their right to learn in their native language," he said.
Most in the general public believe that if Gaponenko, and others expressing similar views negative of Latvia, and supportive of Russia, they should then move to Russia. If they are not willing to work within the legal system to express their views, but instead promote lies and distrust in society, they don't belong in Latvia and should leave.


text:
Teens Not Charged for Tennessee's Deadliest and Extremely Destructive Wildfire
From June 30th, 2017
Gatlinburg deadly fire mystery: Who doctored prosecution agreement?
A failed bid to hold two Anderson County teenagers legally responsible for the state's deadliest wildfire in a century is sparking a new mystery – who doctored an official agreement between federal and Tennessee governments and why?
Aggravated arson charges against the boys, ages 17 and 15, were dropped Friday in part because 4th Judicial District Attorney General Jimmy Dunn did not have authority under a 1997 agreement between the state and federal government to prosecute crimes committed in the Great Smoky Mountains National Park.
The park was left out of the 1997 agreement, which granted both state and federal authorities the power to prosecute crimes committed on federal lands within Tennessee. That meant only federal authorities could level charges for crimes committed in the park. That omission was discovered during Dunn's attempt to prosecute the boys.
Source: Gatlinburg deadly fire mystery: Who doctored prosecution agreement?
I wonder if all the boys learned from this was how to get away with it? I surely hope not.
The photo was actually taken in TN and is of the fire but I don't know who took the photo.


text:
On your tiptoes, almost can see
That crazy feline has left me.
What's Tom doing, climbing that tree?
She'll be sorry, she'll be sorry.
Such a show-off, Tom thinks he's hot
Continuous attention sought
Can't she see his ignorant plot?
It's about me, It's about me.
She's gonna miss me when I'm gone,
She'll miss my paw pad spawn,
My red dot intellect and brawn,
Outta here, Juan; Outta here, Juan.
This was my first time at a monotetra poem.


text:
The Sadies--Darker Circles (Yep Roc): Canadian roots rock band with perhaps their finest effort yet. When preparing for my radio program, I gravitated to the small amount of uptempo tracks first, but I quickly realized that the gist of Darker Circles is moody, atmospheric sounding stuff with great hooks, enhanced by close, understated harmonies straight out of the Byrds' Notorious Byrd Brothers. Musically, it floats, but emotionally, it hits hard. The Sadies continue to develop in remarkable ways; I recall when I thought of them basically as Neko Case's occasional backup band.
Geoff Muldaur & the Texas Sheiks (Tradition & Moderne): This mixture of the many types of traditional music Muldaur has done so well for the last 50 years (blues, jug band, swing, early jazz) was released in 2009, but I missed it. Assembled with a stellar bunch of musicians, including Stephen Bruton (who died before its release), slide and steel guitarist Cindy Cashdollar and fiddler Suzy Thompson--not to mention guests like Jim Kweskin and former Asleep at the Wheel piano player Floyd Domino--Geoff Muldaur & the Texas Sheiks is most likeable because of its sometimes lazy, sometimes intense feel and accomplished playing. "All By Myself" is rollicking, and Muldaur does a pretty good Skip James on "Hard Time Killin' Floor," which he'd recorded on the 1972 album with then-wife Maria, Sweet Potatoes.
Steve Cropper & Felix Cavaliere--Midnight Flyer (Stax): While their 2008 collaboration
Nudge It Up a Notch had some fine moments despite less than first rate material, the legends of blue-eyed soul (Stax guitarist Cropper, Rascals vocalist Cavaliere) are off the mark with Midnight Flyer. It's a tedious outing with almost nothing going for it except Cavaliere's still-strong voice. Midnight Flyer's slick sound lends itself to what used to be labeled Smooth Jazz (sometime around 2008, said radio stations began calling themselves just "Smooth," or they added much more pop music and came up with a new description). You know what my definition of Smooth Jazz is, don't ya? Funk Lite. You've forgotten that classic R&B demands a little ingredient called grease, boys.


text:
putting in a plug for http://www.electoral-vote.com . This is a daily blog I read on election (and political) coverage. The author tends to lean a bit left of center in his analysis. That being said, it's one of the best sources of polling/insight information into national political races I have found. Here are a few recent ones of interest:
In NC, Republicans in the legislature hold a veto-proof supermajority in both houses, so despite a Democrat in the Governor's mansion, not much has changed policy-wise. The recent teacher's march in Raleigh garnered national headlines, but it is doubtful it will move the needle much. However, education is an issue that is uniting people across all political persuasions (teachers are both conservative and liberal). They could represent a deciding block in a state that is trending purple (Cooper won by less than 11K votes out of almost 5M ballots, less than 1%).
Most of the discussions in Democratic circles are trying to break the supermajority in at least one state house to be able to protect Gov. Cooper's veto. Also of interest is that several legislative districts were redrawn due to the recent Supreme Court ruling, but some are still on hold pending an upcoming appeal ruling by SCOTUS.


text:
Don't Miss This Christmas Eve Tree Lighting
It's a tree lighting that benefits the Boise homeless population, and there's a unique way that we can all contribute to this special tree.
This is more than just showing up to watch the lights flicker on. We can take an ornament to put on the tree that reflects something personal to us, and be reminded that not everyone is enjoying an overflow of gifts, food, and holiday cheer this week.
Bad weather got in the way once, but Interfaith Sanctuary says its rescheduled tree lighting will be on Christmas eve, December 24th in the backyard of the homeless shelter.
We can all take an ornament to add to the tree to reflect our own faith traditions, and by doing that the shelter says we're showing all faiths can work together toward the common goal of helping the homeless get on their feet, and stay warm in the meantime.
Saturday should be sunny and in the 20s, and in the teens at night. Being out in the cold for the tree lighting might help us all realize how great we have it, and it might be a great way to experience meaning that's deeper than a Fit Bit and a Hatchimal this season. Happy holidays.


text: Five Fun Things You Can Do With Redtie July 12, 2019in B2B, B2C, Blockchain, Business, Chat Services, Email, Ethereum, Live Chat, Marketing, Redtie, VoiceBy Santhosh Kumar 5 Fun Things to Do With Redtie We built Redtie to meet communication use cases using text messaging, phone calls, chat, and social media channels. Most of these use cases are enterprise-focused and frankly boring. For example, one of the largest energy utility companies in the US has integrated Redtie to detect weak electric signals coming... Read More


text:
Little Man
Bow Tie Baby Shower Theme Banner • Custom Wording Banner • Ships Next Day
$ 20.00
This banner absolutely screams BOY! The gorgeous combination of colors and patterns make this banner a must have to welcome your little man into the world.
- Colors: navy, gray, light blue, lime green, white
- Length: Varies - Circles measure 6 inches each
- Height: 6 inches
- Layout: (bow tie) NAME (bow tie)
- Materials: heavy cardstock, ribbon
- Ships next day
- Select the number of letters from the "Wording" drop down menu
- Include your wording for the banner in the note section