text:
Publication number | US6892292 B2 |
Publication type | Grant |
Application number | US 10/135,575 |
Publication date | May 10, 2005 |
Filing date | May 1, 2002 |
Priority date | Jan 9, 2002 |
Fee status | Paid |
Also published as | US20030131216 |
Publication number | 10135575, 135575, US 6892292 B2, US 6892292B2, US-B2-6892292, US6892292 B2, US6892292B2 |
Inventors | Joerg Henkel, Haris Lekatsas, Venkata Jakkula |
Original Assignee | Nec Corporation |
Export Citation | BiBTeX, EndNote, RefMan |
Patent Citations (13), Non-Patent Citations (6), Referenced by (17), Classifications (7), Legal Events (5) | |
External Links: USPTO, USPTO Assignment, Espacenet | |
This application is an application filed under 35 U.S.C. � 111(a), claiming benefit pursuant to 35 U.S.C. � 119(e) of the filing date of the Provisional Application Ser. No. 60/346,002 filed on Jan. 9; 2002, pursuant to 35 U.S.C. � 111(b) and claiming benefit pursuant to 35 U.S.C. � 119(e) of the filing date of the Provisional Application Ser. No. 60/359,692 filed on Feb. 27, 2002, pursuant to 35 U.S.C. � 111(b). The Provisional Application Serial No. 60/346,002 and Provisional Application Ser. No. 60/359,692 are incorporated herein by reference for all they disclose.
1. Technical Field of the Invention
This invention is related to an apparatus for executing one-cycle decompressions of compressed and uncompressed software instructions. More specifically, the invention processes compressed software instructions using a decompression tree and a dictionary and the decompressed software instructions are forwarded instructions to a processor without requiring any processor stalls.
2. Description of the Related Art
The following papers provide useful background information on the indicated topics, all of which relate to the invention and are incorporated herein by reference:
T. C. Bell, J. G. Cleary and I. H. Witten, Text Compression, Prentice Hall, N.J. (1990).
L. Benini, A. Maci, E. Macu and M. Poncino, Selective Instruction Compression for Memory Energy Reduction in Embedded Systems, IEEE/ACM Proc. of International Symposium on Low Power Electronics and Design (ISLPED '99), pgs. 206-11 (1999).
IBM CodePack PowerPC Code Compression Utility User's Manual, Version 3.0 (1998).
N. Ishiura and M. Yamaguchi, Instruction Code Compression for Application Specific VLIW Processors Based on Automatic Field Partitioning, Proc. of the Workshop on Synthesis and System Integration of Mixed Technologies, pgs. 105-9 (1998).
C. Lefurgy and T. Mudge, Code Compression for DSP, CSE-TR-380-98, University of Michigan (November 1998).
C. Lefurgy, E. Piccininni and T. Mudge, Reducing Code Size with Run-time Decompression, Proc. of the International Symposium of High-Performance Computer Architecture (January 2000).
S. Y. Liao, S. Devadas and K. Keutzer, Code Density Optimization for Embedded DSP Processors Using Data Compression Techniques, Proceedings of the Chapel Hill Conference on Advanced Research in VLSI, pgs. 393-99 (1995).
T. Okuma, H. Tomiyama, A. Inoue, E. Fajar and H. Yasuura, Instruction Encoding Techniques for Area Minimization of Instruction ROM, International Symposium on System Synthesis, pgs. 125-30 (December 1998).
A. Wolfe and A. Chanin, Executing Compressed Programs on an Embedded RISC Architecture, Proc. of the International Symposium on Microarchitecture, pgs. 81-91 (December 1992).
Y. Yoshida, B. -Y. Song, H. Okuhata and T. Onoye, An Object Code Compression Approach to Embedded Processors, Proc. of the International Symposium on Low Power Electronics and Design (ISLPED), ACM: 265-268 (August 1997).
There will now be provided a discussion of various topics to provide a proper foundation for understanding the invention.
Designers in the high volume and cost-sensitive embedded systems market face many design challenges as the market demands single-chip-solutions to meet constraints like lower system cost, higher functionality, higher level of performance and lower power-consumption requirements for increasingly complex applications.
Code compression/decompression has emerged as an important field to address parts of these problems in embedded system designs. Typically, a system that runs compressed code is decompressing the compressed code as it is needed by the CPU. The decompression can be performed outside the CPU (e.g., between the L2 cache and main memory or between the L2 cache and CPU) or inside the CPU as part of the instruction fetch unit or decoding unit. In any case, only parts of the whole code will be decompressed (i.e., on an instruction-level or block-level) in order to minimize the memory requirements. The code is being compressed as a step following code compilation and then it is burned into flash memory or ROM, from where it loaded during system reset into the main memory or the L2 cache. That implies that the software cannot be changed and must be fixed. Note that this characteristic prohibits the system to conduct any kind of technique using self-modifying code. If, however, the software application does change, then the code has to be compressed again, and the flash memory or ROM has to be burned again. Typically, this is not a problem for embedded systems that do not allow the user to make software changes, e.g., cellular telephones.
The primary goal in code compression has traditionally been to reduce the instruction memory size, although newer approaches have shown that it can even lead to performance increases of an embedded system. As used herein, the terms "compression" or "decompression" denote a technology that runs code that has been compressed before the system runs and where code is being decompressed when the system runs, i.e., on-the-fly.
Application areas for code compression/decompression are embedded systems in the areas of personal wireless communication (e.g., cellular telephones), personal computing (e.g., PDAs), personal entertainment (e.g., MPEGIII players) and other embedded systems where memory size and performance is a constraint.
Wolfe and Chanin developed the Compressed Code RISC Processor (CCRP), which was the first system to use cache-misses to trigger decompression. Their decompression engine is designed as part of the cache refill hardware. The instructions in each L1 cache block are Huffman encoded separately so that each block can be individually decompressed without requiring decompression of other blocks in advance. As Huffman codes are variable length codes, decoding is not as fast as with dictionary methods. Since the fixed-length cache blocks are compressed to variable-length blocks, an index table is required to map native cache-miss addresses to compressed code addresses. This requires the decompression engine to conduct one more level of lookup to find the data.
CodePack is used in IBM's embedded PowerPC systems. Their scheme resembles CCRP in that it is part of the memory system. The CPU is unaware of compression and a device similar to a Line Address Table (LAT) maps between the native and compressed address spaces. The decompression engine accepts the L1 cache miss addresses, retrieves the corresponding compressed bytes from main memory, decompresses them and returns native PowerPC instructions to the L1 cache. CodePack achieves 60% compression ratio on a PowerPC. IBM reports that performance change in compressed code is within 10% of native programs—sometimes with speedup. A speedup is possible because CodePack implements pre-fetching behavior that the underlying processor does not have.
Software decompression is also possible, simplifying the hardware design and allowing the decompression to be selected at run-time. The hardware is simplified because the decompression software uses the arithmetic unit in the processor core, rather than having separate and highly specialized logic structures. Lefurgy et al. proposed two hardware mechanisms to support software decompression. First, a L1 cache miss triggers a cache miss exception that runs the decompression program. Second, a privileged instruction used by the decompression program stores decompressed instructions directly into the instruction cache. The decompression software is not compressed and is stored in a region of memory that does not cause a decompression exception. Liao et al. proposed a dictionary method that can be accomplished purely in software, where mini-subroutines are introduced replacing frequently appearing code fragments.
Ishiura and Yamaguchi proposed a compression scheme for VLIW processors based on automated field partitioning. The compression scheme keeps the size of the decompression tables small by producing codes for sub-fields of instructions. Benini et al. limit the dictionary size by selectively compressing instructions. Lefurgy et al. also proposed a dictionary scheme used in their DSP compression work. Okuma et al. proposed an interesting encoding technique that takes into account fields within instructions. Yoshida et al. proposed a logarithmic-based compression scheme that can result in power reduction as well.
An important problem associated with code compression is how to locate branch/jump/call targets in compressed code since the original offsets will not point to "correct" locations after compression. A compressed program must be decompressed in sections determined by the flow of control through the program; decompressing the entire program before execution begins would defeat the purpose of code compression. This means that there should exist several points in the program where decompression can start without having decompressed any previous parts of the binary code. The frequency of these resynchronization points determines the block size, which is a uniquely decompressible piece of code. Some methods do not have constant block sizes, while others enforce a constant block size that can be anything from a single instruction, to a cache line, or even a page. It is important to understand that the block size refers to the uncompressed data and not to the compressed. In the invention, the block size is equal to the size of one instruction and is variable-size in the general case (since native instructions can be variable-size).
The decompressor is responsible for locating the compressed data for a requested instruction. It must map the native address of a requested instruction to the address where the compressed data is located. Techniques for implementing this mapping are described below.
The most widely used method to solve the indexing problem is to build a table that maps native addresses (addresses of instructions in the original code) to addresses in compressed code. Wolfe and Chanin were the first to propose such a method in which a Line Address Table (LAT) was used to map the address of cache lines to their address in the compressed code. Since Wolfe and Chanin's design used cache lines as their decompressible units, they only need to store addresses of beginnings of compressed lines and not branch targets. Storing a full pointer for each cache line would result in a large LAT, hence they proposed a method to compact pointers by storing one base address and a number of compressed cache line offsets in each LAT entry. To get the compressed address of a cache line, several offset fields must be added to the base address. These offsets are interpreted as byte-aligned offsets from the base address since all compressed blocks (cache lines) are byte-aligned to simplify decoding.
A drawback of the LAT approach is that the table introduces a significant amount of overhead for small blocks. Increasing the number of offsets per LAT entry can help, but makes the address calculation slower.
Another technique is to use an equation to calculate addresses in the compressed space. The easiest way to achieve this is to have a constant block size and to ensure all blocks are compressed to the same compressed size. This is a fixed-to-fixed coding scheme (F—F) and is generally not very efficient in terms of compression ratio. The most straightforward way to do this is to collect statistics of bit patterns in fixed-size blocks and re-encode with fewer bits depending on how many bit patterns combinations occur. For example if the block size is 32 bits, but only 224 combinations appear, and only 24 bits are needed to encode these blocks. However, a table that maps these different bit patterns to their original 32-bit sizes is required making this method impractical. This can be improved by splitting the original 32-bit block into sub-blocks and having a significantly smaller table for each sub-block.
The invention has been made in view of the above circumstances and to overcome the above problems and limitations of the prior art.
A first aspect of the invention provides a one-cycle decompression engine, the decompression engine for compressed and uncompressed software instructions. The decompression engine comprises means for decoding input data, wherein the input data is compressed and uncompressed software instructions. The decompression engine further comprises means for storing decoded instructions that are coupled to the means for decoding. Typically, these means are used to store uncompressed instructions that correspond to a particular compressed instruction. The decompression engine also has output means coupled to the means for decoding and to the means for storing decoded instructions. The output means is used to output decoded and uncompressed software instructions to a processing unit. Finally, the decompression engine comprises means for storing coupled to the means for decoding and to the output means. The means for storing stores various flags and portions of compressed or uncompressed instructions.
A second aspect of the invention provides a one-cycle decompression engine that comprises a decoding circuit and at least two dictionary tables coupled to the decoding circuit. The dictionary tables store uncompressed instructions that correspond to certain compressed software instructions. The decompression engine further comprises an output register coupled to the decoding circuit and to the dictionary tables. The output register outputs the uncompressed instructions to a processing unit for execution. The decompression engine further comprises a plurality of registers coupled to the decoding circuit and to the output register. These registers are used for storing various flags and portions of compressed or uncompressed instructions.
A third aspect of the invention provides a method for maintaining instruction counter coherency during decompression of compressed software instructions. The method comprises determining if an uncompressed instruction is a predetermined type of instruction, and based on that determination, storing a decompression program counter in a predetermined memory location. Next, the method determines if the processor program counter is greater than the decompression program counter, and if that determination is true, incrementing the decompression program counter. After examining the processor program counter, the method next determines if the processor program counter offset points to a replay buffer address, and if that determination is true, the method changes the decompression engine program counter to be equal to the replay buffer address.
A fourth aspect of the invention is a method for handling compressed and uncompressed software instructions of various bit sizes using a decompression tree. First, the method constructs a decompression tree having a root and a plurality of branches extending from the root, with each branch having a branch end. The location of the branch ends is based on a predetermined total bit size for compressed and uncompressed software instructions. Next, the method receives two software instructions at the root of the decompression tree. The bit size of the first software instruction is determined, and a branch of the decompression tree corresponding to the bit size of the first software instruction is traversed. Next, the method determines the bit size of the second software instruction, and traverses the decompression tree down a branch that corresponds to the bit size of the second software instruction. After traversing the second branch, the method determines if a branch end has been reached, and if that determination is true, decodes the software instructions. If a branch end has not been reached, the method receives additional software instructions until a branch end is reached.
The accompanying drawings, which are incorporated in and constitute a part of this specification illustrate aspects of the invention and, together with the written description, serve to explain the aspects, advantages and principles of the invention. In the drawings,
Prior to describing the aspects of the invention, some details concerning the prior art will be provided to facilitate the reader's understanding of the invention and to set forth the meaning of various terms.
As used herein, the term "computer system" encompasses the widest possible meaning and includes, but is not limited to, standalone processors, networked processors, mainframe processors and processors in a client/server relationship. The term "computer system" is to be understood to include at least a memory and a processor. In general, the memory will store, at one time or another, at least portions of executable program code and the processor will execute one or more of the instructions included in that executable program code.
It will be appreciated that the term "predetermined operations," the term "computer system software," and the term "executable code" mean substantially the same thing for the purposes of this description. It is not necessary to the practice of this invention that the memory and the processor be physically located in the same place. That is to say, it is foreseen that the processor and the memory might be in different physical pieces of equipment or even in geographically distinct locations.
As used herein, one of skill in the art will appreciate that "media" or "computer-readable media" may include a diskette, a tape, a compact disc, an integrated circuit, a cartridge, a remote transmission via a communications circuit, or any other similar medium useable by computers. For example, to distribute computer system software, the supplier might provide a diskette or might transmit the instructions for performing predetermined operations in some form via satellite transmission, via a direct telephone link, or via the Internet.
Although computer system software might be "written on" a diskette, "stored in" an integrated circuit, or "carried over" a communications circuit, it will be appreciated that, for the purposes of this discussion, the computer usable medium will be referred to as "bearing" the instructions for performing predetermined operations. Thus, the term "bearing" is intended to encompass the above and equivalent ways in which instructions for performing predetermined operations are associated with a computer usable medium.
Therefore, for the sake of simplicity, the term "program product" is hereafter used to refer to a computer useable medium, as defined above, which bears instructions for performing predetermined operations in any form.
A detailed description of the aspects of the invention will now be given referring to the accompanying drawings.
The invention can be summarized by the following:
The basic functionality and architecture of the system into which the decompression engine is embedded such that the main memory contains the code that has been compressed in a post-compilation step. Upon an instruction cache miss, blocks of compressed code are loaded into the instruction cache. When the CPU requests a certain instruction word, the instruction cache sends this compressed word to the decompression engine. The decompression engine decompresses the instruction word on-the-fly in one cycle. The decompression engine is generic, since it does not assume a certain instruction set and it does not assume a fixed instruction length.
Though table-based dictionary encoding is a well-known compression technique, advanced architectural design strategies are necessary to meet the one-cycle design constraint for the architecture of the present invention. A summary of design constraints follows:
The decompression engine interfaces have been designed for a commercial CPU core. A list of characteristics that represent especially challenging features of CPU cores with respect to the one-cycle decompression constraints follows:
The invention uses a dictionary technique to compress frequently appearing instructions (according to program statistics). Dictionary coding refers to a class of compression methods that replace sequences of symbols with indices to a table. This table is called the "dictionary". The indices are the code-words in the compressed program. An entry in the dictionary holds either an original symbol or a sequence of symbols. This encoding reduces the data if the indices are shorter than the replaced symbols and if the dictionary is compact. The main advantage is that the indices are usually of fixed-length and thus simplify the decompression logic to access the dictionary, as well as reducing decompression latency.
Referring to
The present invention can use several bit encodings for instruction words. For example, a commercial processor may use 24-bit instructions, and those 24-bit instructions can be compressed into 8-bit codes and 16-bit codes. For 8-bit codes, the whole code word is used to index the decompression table. For 16-bit codes, the 8 MSB bits are used to access the decompression table, while the 8 LSB bits are used to signal the type of instruction. The types can entirely be derived from the 4 LSB bits of any instruction.
Referring to
Referring to
Referring to
The decompression engine 31 consists of the decoding logic 49 and two decompression tables 40-41. Preferably, the decompression tables 40-41 are 256 entry SRAMs, and are as wide as the largest uncompressed instruction, i.e., uncompressed 24-bit instructions require a 24-bit wide SRAM. The present invention uses two decompression tables, since at most two compressed instructions can be decoded per cycle. The decoding logic 49 is triggered by the arrival of compressed/uncompressed 32-bit instruction words from the instruction cache 32. The decompression engine 31 examines the bits (depending on the ISA will be in different locations) which form the select bus for the multiplexers 42-43 and determine the type of the instruction. The output of the decompression tables 40-41 and the decoding logic 49 is coupled to the 32-bit output register 44.
The prev_decomp register 47 holds previously decompressed instruction data. For example, if the decompression engine decompresses two 16-bit instructions into their original 24-bit sizes, that will exceed the 32-bit limit of the CPU. The remaining 16 bits of the second decompressed instruction are stored in the prev_decomp register 47 for use in the next cycle. The prev_decomp register 47 is also connected to the output register 44.
The prev_comp register 48 holds previously compressed data. This register is used when it is not possible to decompress the whole instruction in the current cycle because part of it belongs to the next word. Thus, it is necessary to store the part of the compressed instruction that is available in the current cycle in the prev_comp register 48. A pre_part_set register 46 is used to indicate that there is a portion of the previous instruction stored.
Bytes to be sent directly from the next compressed data stream are held in the bytes_next register 45. For example, consider the case where there are two 24-bit uncompressed instructions. Since the decompression engine 31 can only receive and produce 32 bits, it will only receive eight bits of the second instruction from the cache. The bits needed to decode this instruction are always held in the first four bits. Therefore, it is possible to know the type of the instruction but it is impossible to send more than eight bits. The bytes_next register 45 is used to inform the decompression engine 31 that it needs to forward the next two bytes directly to the CPU in the next cycle without any decoding. Decoding would be impossible since the first eight bits that are already received by the decompression engine 31 can only be used for decoding.
For example, if a 24-bit instruction word has been compressed to eight bits, the 8-bit index for the decompression table is formed by the four MSB bits of the incoming compressed word. The decompression table 40 is accessed and the corresponding address contents return the 24-bit instruction for the compressed eight bits. In other cases, the 32-bit compressed instruction stream may contain a portion of an instruction and the remaining portion of the instruction is in the next 32-bit compressed instruction word. In that case, the decoding logic 49 uses the 16-bit prev_decomp register 47 and the 16-bit prev_comp register 48 to store the previous portion of the instruction. The two-bit pre_part_set register 46 is used to indicate that there is a portion of the previous instruction stored. In addition, the 2-bit bytes_next register is used to indicate whether 8 or 16 bits of the prev_decomp register 47 and the prev_comp register 48 comprise the previous instruction. The dotted lines in
The heart of the decompression algorithm is handled by the tree logic. The tree receives instruction data from the cache (compressed) and produces a full word of data for the CPU. The invention assumes a word is n-bytes wide and that in general it can contain compressed and uncompressed instructions that can be 1, 2 . . . n bytes in length.
The input to the algorithm is a W-byte word (compressed) fetched from the cache. The decompression tree 50 is illustrated in FIG. 5. It illustrates all the possible sequences of compressed instructions that can be subject to decompression by the decompression engine within any one cycle. The decompression tree 50 starts with branches corresponding to the instruction sizes. The root node is pointed to by the "W-byte input" arrow. It then continues with all cases until W bytes have been received (in certain cases some instruction combinations will not end on a W-byte word boundary). After decompression, any instructions/instruction parts that do not fit in a W-byte word boundary are buffered and sent to the CPU in the next cycle. The decompression tree 50 will reach terminal nodes (circles in
At each node, all possible instruction sizes are shown that can possibly occur (i.e., X1, X2, . . . ).
Referring to
Referring to
Referring to
An important problem associated with code compression is how to locate branch/jump/call targets in compressed code since the original offsets will not point to "correct" locations after compression. In the following we will use the term branch loosely to mean any instruction that alters the program counter such as a call, a jump, etc.
One technique for locating compressed data was proposed by Lefurgy et al. When a branch instruction is executed, the decompression engine must be redirected to begin decompression at the branch target. Therefore, the mapping of native addresses to compressed addresses only occurs when a branch is executed. This allows the mapping information to be stored with the branch instruction itself. The technique changes the branch offsets in the original native branch instructions to point to the target instructions in the compressed address space, rather than the uncompressed space addresses of the original program. It involves the following steps:
One problem with this is that the original offset fields and compressed offset fields may assume different alignment between the original and compressed instructions. For instance, the original instructions may align to 4-byte boundaries, but the compressed instructions align to byte boundaries. In this case, the offset field really needs two more bits to have the same addressing range as the original program. In practice, this is rarely a problem because the size of the compressed program is less and the addressing range does not need to extend as far.
Decoding speed is not affected since there is no LAT to access, but usually the processor branch unit requires some modification. In some processors, byte-aligned instructions were supported and thus a branch target could reside on any byte boundary. This means that no modification in the CPU core was needed. Furthermore, removing the LAT improves the compression ratio. The main disadvantage of this method compared to the indexing table method is its lack of generality. The decompression unit has to be able to identify branch instructions and extract the offset. It is thus instruction set specific and will need some modification to work on different instruction sets.
An implication of using this technique is that the decompression engine must maintain its own program counter dce_pc. When the application starts execution, the dce_pc equals the CPU's program counter cpu_pc. As the execution progresses, the dce_pc diverges from the CPU's program counter. Incrementing the dce_pc is not always necessary because of compression: more instructions can fit in one 32-bit word and thus the data from the previous cycle may be used. Using a separate program counter for the decompression engine also means that cache hits or misses must be triggered according to the dce_pc value and not the cpu_pc value. The dce_pc will change value completely independently from the cpu_pc as the decompression engine keeps track of the instruction sizes it decompresses. The cpu_pc is only used when its current value is not just an increment of its previous value. This signals that a branch was taken. By that time, the decompression engine will already have the offset (branch instruction decoding is done a few cycles before a branch is taken) and will add it to the dce_pc.
Referring to
One potential problem is "unpredictable" cpu_pc behavior, which means that the values of the cpu_pc are not correlated with the program flow. This is due to internal effects in the CPU that, in general, may not be known to the system designer. On some processors, the cpu_pc may perform a replay function, wherein it will loop to a value it had a few cycles before when an instruction is stalling the pipeline, e.g., in the case of a load instruction. In order to handle such cases, the invention keeps a buffer of the most recent instructions and we are thus able to provide the CPU with data from previous cycles if requested.
The invention handles such "unpredictable" cpu_pc behavior in commercial CPU platforms having the pipeline replay feature. In this particular processor, replay means that certain instructions that have already been fetched are refetched when there is cache miss and data must be loaded from main memory.
The invention handles the replay function as follows: during execution the decompression engine identifies instructions that may cause a replay (e.g., loads and stores). The decompression engine stores their respective addresses (in compressed space) and their bit values in the replay buffer. A few cycles later, when the cpu_pc changes to value that is different than one instruction memory word plus its previous value, and its target points to an equivalent address location in the replay buffer, a replay is assumed and instructions are fetched from the replay buffer.
Referring to
At S1135, a determination is made whether the cpu_pc has a value greater than the dce_pc. If that determination is true, then the dce_pc is incremented. Next, a determination is made whether an cpu_pc offset goes a replay buffer address. If that determination is true, then at S1160 the dce_pc is changed to the replay address. Finally, at S1165, the cpu_pc offset to the dce_pc from the buffer, or use the dce_pc stored on the stack for returning.
Referring to
Holding a different program counter dce_pc for the decompression engine presents additional challenges. When a call instruction is executed, the decompression engine has to know where to return after the subroutine ends. Since calls can be nested, a stack similar to the CPU's stack is necessary. This stack holds values of the dce_pc that correspond to return addresses. Return instructions are detected by the decompression engine; once a return instruction is found the target address is retrieved from the stack. This is illustrated in
Referring to
The foregoing description of the aspects of the present invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the present invention to the precise form disclosed and modifications and variations are possible in light of the above teachings or may be acquired from practice of the present invention. The principles of the present invention and its practical application were described in order to explain the to enable one skilled in the art to utilize the present invention in various embodiments and with various modifications as are suited to the particular use contemplated.
Thus, while only certain aspects of the present invention have been specifically described herein, it will be apparent that numerous modifications may be made thereto without departing from the spirit and scope of the present invention. Further, acronyms are used merely to enhance the readability of the specification and claims. It should be noted that these acronyms are not intended to lessen the generality of the terms used and they should not be construed to restrict the scope of the claims to the embodiments described therein.
Cited Patent | Filing date | Publication date | Applicant | Title |
US5455576 * | Feb 7, 1994 | Oct 3, 1995 | Hewlett Packard Corporation | Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory |
US5534861 * | Mar 8, 1995 | Jul 9, 1996 | International Business Machines Corporation | Method and system for adaptively building a static Ziv-Lempel dictionary for database compression |
US5654806 * | May 6, 1996 | Aug 5, 1997 | Xerox Corporation | Code manipulation for a high speed JPEG decoder |
US5872530 * | Jan 28, 1997 | Feb 16, 1999 | Hitachi, Ltd. | Method of and apparatus for compressing and decompressing data and data processing apparatus and network system using the same |
US5883975 * | Sep 11, 1995 | Mar 16, 1999 | Nippon Steel Corporation | Compression and decompression methods on two-dimensional image data |
US5894300 * | Sep 9, 1996 | Apr 13, 1999 | Nec Corporation | Color image display apparatus and method therefor |
US6049862 * | Jul 16, 1997 | Apr 11, 2000 | U.S. Philips Corporation | Signal processor executing compressed instructions that are decoded using either a programmable or hardwired decoder based on a category bit in the instruction |
US6466144 * | Nov 30, 2001 | Oct 15, 2002 | Unisys Corporation | Data decompressor for use with a data compressor implemented with limited length character tables and compact string codes |
US6549995 * | Jan 6, 2000 | Apr 15, 2003 | International Business Machines Corporation | Compressor system memory organization and method for low latency access to uncompressed memory regions |
US6633969 * | Aug 11, 2000 | Oct 14, 2003 | Lsi Logic Corporation | Instruction translation system and method achieving single-cycle translation of variable-length MIPS16 instructions |
US6657569 * | Jan 22, 2002 | Dec 2, 2003 | Honeywell International, Inc. | Canonical Huffman encoded data decompression algorithm |
US6763031 * | Nov 17, 1999 | Jul 13, 2004 | 3Com Corporation | Network device incorporating selective compression of stored data packets |
US6765509 * | Jan 22, 2001 | Jul 20, 2004 | Btg International Limited | Data compression having improved compression speed |
Reference | ||
1 | C. Lefurgy, E. Piccininni and T. Mudge, Reducing Code Size with Run-time Decompression, Proc. of the International Symposium of High-Performance Computer Architecture (Jan. 2000). | |
2 | L. Benini, A. Maci, E, Macu and M. Poncino, Selective Instruction Compression for Memory Energy Reduction in Embedded Systems, IEEE/ACM Proc. of International Symposium on Low Power Electronics and Design (ISLPED '99), pp. 206-211 (1999). | |
3 | S.Y. Liao, S. Devadas and K. Keutzer, Code Density Optimization for Embedded DSP Processors Using Data Compression Techniques, Proceedings of the Chapel Hill Conference on Advanced Research in VLSI, pp. 393-399 (1995). | |
4 | T. Okuma, H. Tomiyama, A. Inoue, E. Fajar and H. Yasuura, Instruction Encoding Techniques for Area Minimization of Instruction ROM, International Symposium on System Synthesis, pp. 125-130 (Dec. 1998). | |
5 | Wolfe and A. Chanin, Executing Compressed Programs on an Embedded RISC Architecture, Proc. of the International Symposium on Microarchitecture, pp. 81-91 (Dec. 1992). | |
6 | Y. Yoshida, B.-Y. Song, H. Okuhata and T. Onoye, An Object Code Compression Approach to Embedded Processors, Proc. of the International Symposium on Low Power Electronics and Design (ISLPED), ACM: 265-268 (Aug. 1997). |
Citing Patent | Filing date | Publication date | Applicant | Title |
US7079054 * | Aug 17, 2004 | Jul 18, 2006 | Broadcom Corporation | V.42bis standalone hardware accelerator and architecture of construction |
US7343471 * | Jan 12, 2005 | Mar 11, 2008 | Pts Corporation | Processor and method for generating and storing compressed instructions in a program memory and decompressed instructions in an instruction cache wherein the decompressed instructions are assigned imaginary addresses derived from information stored in the program memory with the compressed instructions |
US7420484 * | Oct 8, 2007 | Sep 2, 2008 | The Texas A&M University System | Data encoding and decoding using Slepian-Wolf coded nested quantization to achieve Wyner-Ziv coding |
US7484077 | Nov 8, 2006 | Jan 27, 2009 | Realtek Semiconductor Corp. | Skipping unnecessary instruction by multiplex selector using next instruction offset stride signal generated from instructions comparison results |
US7649479 | Oct 8, 2007 | Jan 19, 2010 | Zhixin Liu | Data encoding and decoding using Slepian-Wolf coded nested quantization to achieve Wyner-Ziv coding |
US7765342 * | Sep 7, 2006 | Jul 27, 2010 | Florida State University Research Foundation | Systems, methods, and computer program products for packing instructions into register files |
US8217813 * | Apr 29, 2010 | Jul 10, 2012 | Advanced Micro Devices, Inc. | System and method for low-latency data compression/decompression |
US20040139298 * | Jan 9, 2003 | Jul 15, 2004 | International Business Machines Corporation | Method and apparatus for instruction compression and decompression in a cache memory |
US20050125633 * | Jan 12, 2005 | Jun 9, 2005 | Pts Corporation | Processor and method for generating and storing compressed instructions in a program memory and decompressed instructions in an instruction cache wherein the decompressed instructions are assigned imaginary addresses derived from information stored in the program memory with the compressed instructions |
US20050270188 * | Aug 17, 2004 | Dec 8, 2005 | Chu Hon F | V.42bis standalone hardware accelerator and architecture of construction |
US20050289288 * | Jun 25, 2004 | Dec 29, 2005 | Matheny David L | Compression and decompression of expansion read only memories |
US20060189035 * | Mar 17, 2006 | Aug 24, 2006 | Chien-Hua Chen | Placement of Absorbing Material in a Semiconductor Device |
US20070113052 * | Nov 9, 2006 | May 17, 2007 | Realtek Semiconductor Corp. | Method for compressing instruction codes |
US20070136561 * | Sep 7, 2006 | Jun 14, 2007 | Florida State University Research Foundation | Systems, Methods, And Computer Program Products For Packing Instructions Into Register Files |
US20080048895 * | Oct 8, 2007 | Feb 28, 2008 | Zhixin Liu | Data Encoding and Decoding Using Slepian-Wolf Coded Nested Quantization to Achieve Wyner-Ziv Coding |
US20080106444 * | Oct 8, 2007 | May 8, 2008 | Zhixin Liu | Data Encoding and Decoding Using Slepian-Wolf Coded Nested Quantization to Achieve Wyner-Ziv Coding |
US20110271055 * | Apr 29, 2010 | Nov 3, 2011 | O'connor James Michael | System and method for low-latency data compression/decompression |
U.S. Classification | 712/200, 712/E09.037 |
International Classification | G06F9/30, G06F9/318, G06F5/00 |
Cooperative Classification | G06F9/30178 |
European Classification | G06F9/30U4 |
Date | Code | Event | Description |
May 1, 2002 | AS | Assignment | Owner name: NEC USA, INC., NEW JERSEY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HENKEL, JOERG;LEKATSAS, HARIS;JAKKULA, VENKATA;REEL/FRAME:012867/0622 Effective date: 20020426 |
Apr 11, 2003 | AS | Assignment | Owner name: NEC CORPORATION, JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NEC USA, INC.;REEL/FRAME:013926/0288 Effective date: 20030411 Owner name: NEC CORPORATION,JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NEC USA, INC.;REEL/FRAME:013926/0288 Effective date: 20030411 |
Oct 9, 2008 | FPAY | Fee payment | Year of fee payment: 4 |
Sep 28, 2012 | FPAY | Fee payment | Year of fee payment: 8 |
Dec 16, 2016 | REMI | Maintenance fee reminder mailed |


text:
National Hispanic University
National Hispanic University logo
Type | Private |
Active | 1981–2015 |
Parent institution
Laureate International Universities |
President | David P. López |
Provost | Gladys Ato |
Academic staff
12 full-time, 60 part-time [1] |
Students | 700[1] |
Location | San Jose, California, United States 37°21′33″N 121°48′58″W / 37.3591°N 121.8161°WCoordinates: 37°21′33″N 121°48′58″W / 37.3591°N 121.8161°W |
Campus | Urban |
Mascot | Golden Eagles |
Website | www.nhu.edu |
The National Hispanic University (NHU) was a small, private university located in San Jose, California, founded by Stanford-educated Dr. B. Roberto Cruz. National Hispanic University ceased operations on August 23, 2015. [2] It was the first four-year Latino university in the United States. NHU's vision was to foster "a caring learning environment where students have felt valued and supported at every step in their academic journey. Embracing diversity and multiple perspectives as guiding principles." [3]
The National Hispanic University was founded in 1981 in Oakland, California, to address the needs of Hispanic men and women. Founder Dr. Roberto Cruz had studied the disproportionately large impact historically black colleges and universities had in generating both undergraduate and professional degree graduates within the Black community. Dr. Cruz's vision was to have similarly positive impact on the Hispanic community in the United States. In 1990, the university opened a San Jose campus and moved to a larger facility in Oakland. In 1994, NHU closed both campuses and moved to a new campus in East San Jose.
For several years, National Hispanic University published an annual report card on Hispanic quality of life. [4]
From 1981 to 1986, NHU also published reports on women of La Raza, Cesar Chavez, bilingual special education, Las Posadas, and "Steps to Humanity." [5]
In the 2000s, NHU was unsuccessful in its many attempts to find financial backers from Silicon Valley or Latino philanthropists who could save the school. [6]
After those options were closed, the school reached a deal with Laureate Education. [7]
In 2010, NHU became a member of the Laureate International Universities network, a for-profit college chain.[8] Laureate hoped to turn NHU into a mostly online school. [9]
In 2012, NHU celebrated its 30th anniversary.[10]
Laureate officially closed National Hispanic University on August 23, 2015. [11]
Laureate's Decision to Close NHU[edit]
When Laureate made the decision to abandon National Hispanic University in 2014, one NHU student remarked "The values of the school stood out for me."..."Now it comes down to dollar bills." [12] According to the San Jose Mercury News "some students who wanted a traditional, classroom approach to education said they felt abandoned by Laureate after NHU's drive to enroll thousands of new students in Internet classes did not produce the desired results."
Plans for NHU campus[edit]
As part of the Foundation for Hispanic Education's efforts, the East San Jose campus is planned to house The Center for Latino Education and Innovation, The Latino College Preparatory Academy (a bilingual charter school), and The Luis Valdez Leadership Academy, a charter high school for students in San José. [13]
The university was accredited by WASC[14] and was rated by the Carnegie Foundation for the Advancement of Teaching as a "Baccalaureate College", with an academic breadth rated as "Diverse Fields"[15]
- ^ a b NHU Financial Plan
- ^ http://www.nhu.edu/
- ^ http://www.nhu.edu/about_nhu/history.htm
- ^ https://books.google.com/books?id=CXRjGLlrwtMC&pg=PA52&lpg=PA52&dq=Hispanic+America:+a+national+report+card+1985&source=bl&ots=B_s-crLGBP&sig=TmJAvdsKBYILjOKHXoIWyQnG9OE&hl=en&sa=X&ved=0ahUKEwjQw6-Soe7OAhUELSYKHXx-AxUQ6AEIIjAB#v=onepage&q=Hispanic%20America%3A%20a%20national%20report%20card%201985&f=false
- ^ https://scholar.google.com/scholar?q=%22national+hispanic+university%22+&btnG=&hl=en&as_sdt=0%2C9
- ^ http://www.npr.org/2014/04/10/301417514/national-hispanic-university-shutting-its-doors
- ^ http://archive.sltrib.com/story.php?ref=/57717647
- ^ "Laureate Education acquires National Hispanic University". Silicon Valley/San Jose Business Journal. April 20, 2010. Retrieved November 4, 2011.
- ^ http://www.latinpost.com/articles/9304/20140321/national-hispanic-university-announces-its-closing-in-2015.htm
- ^ "History - About NHU".
- ^ http://www.nhu.edu/
- ^ http://www.mercurynews.com/breaking-news/ci_24988123/national-hispanic-university-san-jose-stops-enrolling-new/
- ^ http://www.nhu.edu/about_nhu/campus.htm
- ^ WASC Accreditation Page
- ^ Carnegie Foundation Information Page

subset: commoncrawl


text:
This blog is a bit of fun really. Feel free to contribute in discussions and links to anything funny in our beautiful game. I might be a Chelsea fan but I fully intend to rip the crap out of all your favourite football teams and you to do the same to mine. I hope some of you will stay with me during the season as without the banter,whats the point? It would be duller than watching Liverpool!
Friday, 13 May 2011
The FA Cup Final
Personally I don't care who wins (well I do actually as I've had a few quid on the Stokies!) but I do hope it's a good game. May the best team on the day win.
Oh and a big thumbs down to the FA for allowing Premier League games on the same day as the sacred FA Cup final. Yes we know it is the Champions League Final next Saturday but surely you could of put all this weekend's games on the Sunday. Luckily ours is Sunday so I won't miss the Cup Final but it is not the point. Punish football going fans why don't you. F.A. really does stand for Fucking Arseholes!
EDIT: I won't give up my day job. Congratulations Man City on a deserved win!
11 comments:
- Anonymous13 May 2011 at 23:39
even worse mate is the fact that the fa want to keep it the same next year but with a kick off time of 5.15,to get a bigger tv audience they say,thats bollocks.
personally as a utd fan i hope stoke win and also for the fact of some eejit(a manc blue)i saw on sky sports yesterday who had a giant fa cup tattooed on his back with '2011 winners' underneath it.he wont feel like a bell end if stoke win
gobshyte Well any silly sod who has a tattoo done before the game deserves what he gets Gob. Yep I see the game is 5.15 ko next season. More misery for the fans who travel to Wembley!
Mullers - when Fergie spoke out about Webb,I honestly thought he would get charged. It isn't allowed mate,however stupid it is.
On the subject of the FA Cup lads,do you think Man Utd are responsible for killing the competition in some way after pulling out of the 99/00 FA Cup to play in that World Club thingy? I honestly don't think the Cup has been the same since with so many clubs not bothering to field their best sides,dwindling attendences,less TV coverage etc although having to play the final in Cardiff for a few seasons afterwards didn't help. Did you lot set that ball rolling? Just wondered.....
PS We won it that season too :)- Anonymous14 May 2011 at 06:58
Just thougt I would drop by as it seems forever.
Best wihes mate,
Marky Dread. I think you'll find the Champions league is the 28th not next week although it improves Blackpool's chances if United are playing 2 days in a row :)
Still not sure why people still blame Man U for the cup losing it's sparkle? when it was the FA who asked them to go in the first place. I blame a combination of Sky, FIFA and Liverpool fans :)Longy, Sir Alex's quote - "We are getting the best referee, there is no doubt about that. But (getting a bad decision) is definitely our big fear." Ancelotti's quote, "I don't want to put pressure on the referee. I think Howard Webb is a fantastic referee because he has experience. If the referee he has no experience we can perhaps be a bit worried about this but with Howard Webb there is no problem. Tony Pulis last month: "Howard is a great ref in my book and certainly as good as there is in the world. What makes him special is that little bit of an aura he has about him. He deals with players very well and I think most people in the game respect him. We are pleased to have him [for the semi-final]. Now we just hope it's an eventful game for the right reasons and that major decisions are decided by the players, not the officials."
Only one manager charged - no wonder Sir Alex refuses to answer the charge.


text:
Home | Forums | Rules | Articles | diyAudio Store | Gallery | Wiki | Blogs | Register | Donations | FAQ | Calendar | Search | Today's Posts | Mark Forums Read | Search |
Solid State Talk all about solid state amplification. |
Please consider donating to help us continue to serve you.
Ads on/off / Custom Title / More PMs / More album space / Advanced printing & mass image saving |
Thread Tools | Search this Thread |
12th February 2006, 09:22 PM | #11 | |
diyAudio Member
Join Date: Feb 2005
Location: torino
So it is very far from a "ready to use" schematic. What is your opinion on the minimalist darlington schematic? Thanks a lot. Regards, beppe |
12th February 2006, 10:41 PM | #12 |
diyAudio Member
Join Date: Dec 2005
Location: the north
Darlington Transistors are not very often used in amps.
They are most often not made for audio use. But, most power amplifiers use Transistors in darlington configuration. In the output stage. By using two or more separate transistors it is possible get a better amplifier. You can make darlington output stage from good 'audio' transistors you want to use. Figure 5.20: - a) The Darlington connection of two transistors to obtain higher current gain and - b) the Sziklai connection of an NPN and PNP transistor to obtain the equivalent of a high-current-gain NPN. Darlington and Sziklai Connections
lineup |
12th February 2006, 11:08 PM | #13 | |
diyAudio Member
Join Date: Jan 2003
Location: ancient Batsch , behind Iron Curtain
"ready for use",and pretty deeply covered here are JLH (PLH,too),but even Mini A or any other Aleph are not even slightly complicated amps for build; at least -not comparing to few other amps which I make during the years..... hehe-like I always say,I know what I know with tubes,but for SS -I'm good just for repairs,not for constructions... in DIY oriented amp making,crucial (and most fun) aspect is time;don't hurry-if you don't understand something,just stop and try to figure out exactly that "something"; then do what you can do with more knowledge....and again-learn,build,learn, build. complexity in some schematic often is not related with number of parts ,active or passive,whatever....
my Papa is smarter than your Nelson ! clean thread; Cook Book;PSM LS Cook Book;Baby DiyA ;Mighty ZM's Bloggg;Papatreasure;Papa...© by Mighty ZM |
13th February 2006, 11:19 AM | #14 | |
diyAudio Member
Join Date: Feb 2005
Location: torino
thank you so much for your kind and valuable reply. I thought that having the driver and the power transistor on the same chip were a smart solution (one chip instead of two). But I can well understand your point: the choice is much wider with separate components. Speaking of the Sziklai pair connection I am attaching another "intriguing" schematic, part of anold line stage preamp, that I liked very much is indeed a Sziklai pair, if I am not wrong. I think that this schema accurately built and with a nice power supply could sound phenomenal, up to well regarded commercial solution. I invited other DIYAUDIO friends to built it and report about their listening impressions. No on accepted the invitation dismissing the preamp right away. I have a very basic set-up so I would have liked to get some confirmations by people much more expert that me. I go on with thinking that this schema is exceptionally simple nevertheless quite good sounding. And, as I said, I think it can be classified as a Sziklai pair. Bjts are BC107 and BC303 while the supply is a single 0-60V. Thank you very much again. Kind regards, beppe |
13th February 2006, 11:28 AM | #15 |
diyAudio Member
Join Date: Jan 2003
Location: ancient Batsch , behind Iron Curtain
I build that at least 15 yrs ago,or at least something similar I agree with you regarding simplicity and quality ,but what is important to say that PS is equally or even more important part of that style preamps same as in NS10 or SL10 or Fet1 etc
my Papa is smarter than your Nelson ! clean thread; Cook Book;PSM LS Cook Book;Baby DiyA ;Mighty ZM's Bloggg;Papatreasure;Papa...© by Mighty ZM |
13th February 2006, 11:34 AM | #16 |
diyAudio Member
Join Date: Dec 2005
Location: the north
That is good preamp, beppe61.
People do not think simple can be good. But they are wrong! I have built such preamp and used them. But nobody is interested. Because they like Advanced and Complicated. They think they get better result, but maybe only get more problems. The more parts - the more possible troubles. Here is my version of your amplifier. Uses an output buffer stage of 2 transistors. I have posted it 3-4 times, already ........ And here it is again:
lineup |
13th February 2006, 12:27 PM | #17 | ||
diyAudio Member
Join Date: Feb 2005
Location: Zagreb
I was actually intrigued by it so decided to do some simulations. Here are some conclusions: 1) The input MOSFETs are not well chosen, according to the models I have. IRF710 and IRF9610 appear to be much better, and IRFD110 and IRFD9120 are even better than that. 2) Output stage MUST have emitter resistors in order to even hope of making the whole amp temperature stable. 3) Modulating the cascode voltages reduces distortion by 30-50% in numbers, but more importantly, this improvement comes from lowering of high order harmonics, you end with a very nice decreasing spread of low order harmonics (h5 is already >100dB below fundamental). 4) Input stage benefits from source resistors, and increased stage current as this increases MOSFET gm and simultaneously makes it more linear. The down side is that each of the input stage transistors generates at least 0.5W of heat, so they need to be the type that can be heatsinked. 5) Output stage works best in class A (by a large margin!), because opel loop gain is low and so is feedback, too low to effectively compensate for class AB operation. 6) I have also tried a MOSFET output version which is FAR easyer to thermally stabilize, and in fact shows more promise. It does have somewhat higher distortion, as well as output impedance. In either case the distortion increases less than 2x from 1 to 10kHz, and the harmonic spread remains the same. The figures are not stellar (0.15% at 10kHz, 20W into 8 ohms) but the open loop gain is low and so is the feedback factor - and the harmonic spread promises a pleasant sound. The MOSFET version has VERY high bandwidth, the BJT version is not far behind. I don't have the schematic at hand here, but will try a few more sims with bipolars as well, before I post something. Just keep in mind it has not been built, just simms nicely. Quote:
I did once build a version of the Quad 405 amp with darlingtons on the output (MJ11015/11016) which works fine, but it has been put into biamped LF service for the last 10 years or so. It's driving a 4 ohm load with a single pair, which, to be honest, looking at the SOA ratings for these transistors, is highly optimistic - even so, the SOA ratings must be very pessimistic because this amp has been completely reliable, even though it's now some 15 years old. SOA ratings of most Darlington BJT packages are nothing to write home about, unfortunately. |
13th February 2006, 12:36 PM | #18 |
diyAudio Member
Join Date: Feb 2006
Location: staffordshire
yes i have no doubt this will work however the bias will be wrong
to low i think and it will a suffer fom xover distortion i would have liked to see a capacitor around a 100 pf between the collctor and base of the driver transistor but dont expect to much from this a the diff pair on the input does not seem to have a smooth current source but we all have to start some where |
13th February 2006, 05:16 PM | #19 |
Did it Himself
diyAudio Member
Beppe, I have sent you a message through the forum message system. I was just wondering if you had received it. You should see the message in the email account that is registered with the forum. If you have not received it please let me know and I will try to resend or use other means.
www.readresearch.co.uk my website for UK diy audio people - designs, PCBs, modules and more. |
13th February 2006, 05:49 PM | #20 | |
diyAudio Member
Join Date: Feb 2005
Location: torino
Tomorrow I will check. Thank you very much Regards, beppe |
Thread Tools | Search this Thread |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
new year ..new mos amp schema opinion? | tadiam | Solid State | 4 | 7th January 2008 10:37 AM |
Request of kind help. | beppe61 | Solid State | 22 | 20th February 2006 01:36 PM |
DCX2496 newbie - questions and 2nd opinion request | morbo | Digital Line Level | 7 | 19th December 2005 08:22 PM |
Experience with IXYS bridges - kind request. | beppe61 | Parts | 1 | 5th December 2005 10:19 AM |
New To Site? | Need Help? |


text:
This item is temporarily out of stock. However, we can notify you as soon as this product becomes available.
Thank you
We have received your request and you will be notified as soon as this product becomes available.
Description: Echo Park Decorative Tape is adhesive-back paper tape that is slightly translucent so what's underneath will show through. Bundle of Joy Girl Plaid Decorative Tape has a White background with a diagonal plaid pattern in shades of Pink, Green, Aqua, and Dark Brown. Tape measures about 5/8 inch wide and 15 feet long.
See more Echo Park Bundle of Joy Girl Collection.
Review this product and Enter to Win a $100 shopping spree!


text:
These chequered and striped linen specimens of Flemish or German origin are from the Public Record Office at Kew, London. They were submitted under Act no. 24 of George III, chapter 40, which was created so that imported linens, attracting a 15% additional duty, could be identified.
© Science Museum / Science & Society Picture Library


text:
Abortion arguments
The following are some common pro-"choice" (aka. pro-abortion and -murder [1]) arguments on abortion, and problems with the reasoning.
Right to Choose
The obvious question not being confronted is what choice is at stake? The choice to kill another human being to bypass the consequences and responsibilities that should accompany the choice to create another life; in essence the choice to murder one's own children so sex can be engaged in freely without responsibility or consequence.[2] Sometimes women die from abortion.[3] Since abortion is deliberate and thought about in advance, it is comparable to a premeditated killing.[4]
Rare Circumstances: Life of Mother and Rape
BBC News has an article called "Abortion in self-defence" arguing that abortion should be allowed in cases where the mother's life and health are at risk, and that this is justifiable self-defense. However, BBC News acknowledges that abortion is NOT justified for the following reasons:
" | "But supposing the mother is not in physical danger, what then? There are a number of cases where some people argue that a woman should have the right to an abortion, such as: damage to mental health, damage to family, damage to career prospects, damage to financial prospects, damage to plans for her life. The self-defence argument for abortion seems to fail here, because although a threat to life can be a defence to a charge of killing someone, none of the above would be an adequate defence in a case of homicide, nor would they be regarded as reasons that justified euthanasia. But if we don't regard the foetus as a person with a right to live, or if we regard it as a being that doesn't have a full right to life, then these cases of self-defence may be arguable."
-BBC News.[5] |
" |
The bottom line is that apart from such extremely rare circumstances, BBC News acknowledges that "The self-defence argument for abortion seems to fail here, because although a threat to life can be a defence to a charge of killing someone, none of the above would be an adequate defence in a case of homicide, nor would they be regarded as reasons that justified euthanasia."[5] Choosing to kill another person, in other words, is unjustifiable unless the mother's life is in danger or, debatably, if rape occurred. In fact, those who bring up cases like rape and life of the mother are doing so because, deep inside, they themselves know that choosing to murder another human being is justifiable only under such extreme circumstances, and NOT for abortion on demand.
The only way to justify abortion apart from such circumstances is, as BBC News says, "if we don't regard the foetus as a person with a right to live, or if we regard it as a being that doesn't have a full right to life".[5] You see, this is not about the right to choose at all, and such a slogan distracts from the real issue - the real issue is whether the fetus is a human being deserving of a full right to life. Because if it is a human being worthy of the right to life, then there is no excuse for "choosing to kill" via abortion on demand.
Right to One's Body
The Pro-Choice movement likes to say that women should have a right to their bodies. However, such a right should logically not allow one to harm others with that body, including physical assault, murder, rape, or theft, and therefore, this is not an absolute right, but a privilege that is not intended to exceed another's unalienable rights, including the right to life. As Hugh V. McLachlan of Glasgow Caledonian University pointed out in 1997, there is no entitlement to one's body and "we have rights duties, liabilities, restrictions and disadvantages as well as rights concerning our own bodies."
" | "Consider the assumption at issue in the abstract: 'That particular X is your X and, therefore, you are entitled to do what you want with it'. As a matter of pure logic, the claim is an absurdity. What if 'X' stands for a Thompson Machine Gun? Should we say: 'That is your machine gun and, therefore, you can do whatever you like with it?' On the contrary, although there might be some things which you and only you can of right do to and with the gun, if that particular machine gun is your machine gun then it is incumbent upon you in particular to ensure that certain things are not done with it. Is the situation any different when 'X' pertains to one's body or to parts of it? I do not think so."
-Hugh V. McLachlan, Glasgow Caledonian University.[8] |
" |
As McLachlan continues to point out, this emphasis on rights neglects the other side of the coin, responsibilities or duties. He gives on pg. 177 the example of an insurance policy, and how using one's body to commit suicide can invalidate such a contract.[8] Logically, creating another human life should likewise bring responsibly for actions toward that life - how is the decision to create another human life of lesser importance than the decision to sign an insurance contract? Why should one be able to kill a separate person to void the sexual decision to bring about another life, yet not be able to kill oneself without voiding an insurance contract?
" | "Certainly a woman has a right to control her own body, but the unborn entity, though for a time living inside her body, is not part of her body. Hence, abortion is not justified, since no one's right to personal autonomy is so strong that it permits the arbitrary execution of others."
-Francis J. Beckwith, Christian Research Journal.[9] |
" |
Right to Privacy
To get abortion legalized, the Pro-Choice movement had to argue that women should have a "right to privacy".[10] However, logically, if the fetus is a human being and thus murder would be committed, privacy is no excuse for such murder. Logically, killing someone in the privacy of one's own home should no more be an excuse for murder than killing them in the privacy of one's body. Furthermore, as Judge Henry J. Friendly pointed out in the nation's first major abortion case, Hall v. Lefkowitz, abortion is actually a complete violation of privacy when you look at it, requiring intervention in a woman's most private areas by a physician and variety of medical personnel.
" | A holding that the privacy of sexual intercourse is protected against governmental intrusion scarcely carries as a corollary that when this has resulted in conception, government may not forbid destruction of the fetus. The type of abortion the plaintiffs particularly wish to protect against governmental sanction is the antithesis of privacy. The woman consents to intervention in the uterus by a physician, with the usual retinue of assistants, nurses, and other paramedical personnel, indeed the condition calling for such intervention may very likely have been established by clinical tests... Yet, even if we were to take plaintiffs' legal position that the legislature cannot constitutionally interfere with a woman's right to do as she will with her own body so long as no harm is done to others, the argument does not support the conclusion plaintiffs would have us draw from it. For we cannot say the New York legislature lacked a rational basis for considering that abortion causes such harm. Even if we should put aside the interests of the father, negligible indeed in the many cases when he has abandoned the prospective mother but not in all, the legislature could permissibly consider the fetus itself to deserve protection.[11] | " |
Women Choose, Not Men
The Pro-Choice movement likes to say men and fathers should have no say in the abortion debate, only women. However, as Thomas J. Lucente Jr. points out, this is similar to saying one can't criticize the President unless one is the President.
" | "The pro-abortion crowd will argue that because I am a man, I should not be allowed to have an opinion on abortion, unless, of course, I support the mass murder of 50 million babies in the last 39 years. That's akin to saying I can't criticize the president unless I have been the president."
-Thomas J. Lucente Jr.[12] |
" |
" | "Either you can subscribe to the American creed which says that God endowed us with our rights, or you can subscribe to the abortion creed which says that those rights are the consequences of our mother's will."
-Alan Keyes, speech at Southern Methodist University, Feb. 24, 1997.[14] |
" |
" | "... abortion is to our time what slavery was to the 19th Century, and if anyone of conscience went anywhere in the 19th Century and did not confront the American people with the evil of slavery, then they were not doing what statesmanship required... Well, it's a part of her body utterly dependent on her body, not viable apart from her body. She has, therefore, absolute power over this being, and given that absolute power she has the absolute right to dispose of it according to her will. We don't recognize what that's saying? What that's saying is that power makes for right. Might makes for right. If I have you in my power, I may dispose of you and your life according to my will. And if that argument is now accepted, and we have embraced it as a fundamental principle of law, then we have rejected the right principle. For if our right, our most basic and conditional right, the right to life itself comes to us not from God but from our mother's choice, then there is no human right that transcends in its claim, human choice and human power. Abortion is the paradigm, the ultimate paradigm of despotism, tyranny, oppression, slavery, holocaust."
-Alan Keyes, speech in San Francisco, March 3, 2003.[15] |
" |
Life of the woman
Another argument by pro-abortion activists for legalized murder is that some pregnancies carry the risk of the woman dying with the baby. Thus, aborting the child may save the life of the woman. If the abortion isn't performed, both the woman and the baby would die.
- ↑ Objectively, logically, and rationally speaking, abortion is murder in the same way that murdering someone who has already been born is murder. An unborn human being is a human being and much more than an animal.
- ↑ Hoffman, M.C. (2012, May 28). Abortion is 'murder' for the purpose of population control, says Turkish prime minister. Life Site News.
- ↑ See "Documented Incidents of 365 Women Who Have Been Killed by "Safe" and Legal Abortion." 365 women who have been killed by 'Legal' abortion
- ↑ First-degree murder is defined as "a killing which is deliberate and premeditated."
First Degree Murder. The Free Dictionary. - ↑ 5.0 5.1 5.2 Abortion in Self-Defence. BBC News. Retrieved July 23, 2012.
- ↑ Cite error: Invalid
tag; no text was provided for refs namedrare
- ↑ Abortion History Timeline. National Right to Life Committee.
- ↑ 8.0 8.1 McLachlan, H.V. (1997). Bodies, Rights, and Abortions. Journal of Medical Ethics. Vol. 23. p. 176.
- ↑ Beckwith, F.J. (1991). Doesn't a woman have the right to control her own body? Christian Research Journal. At ChristianAnswers.net.
- ↑ Levin, M.R. (2005, March 14). Death by Privacy. The National Review.
- ↑ Randolph, A. Raymond. Before Roe v. Wade: Judge Friendly's Draft Abortion Opinion. Harvard Journal of Law and Public Policy. Vol. 29.
- ↑ Cite error: Invalid
tag; no text was provided for refs namedlucente
- ↑ Jefferson, T. (1776, July 4). The Declaration of Independence. Retrieved from USHistory.org. Independence Hall Association.
- ↑ Former Presidential candidate, Alan Keyes shares his views on the commonalities between abortion and slavery. AbortionTV.com.
- ↑ Abortion Quotes. NotableQuotes.com.


text:
Are LED's the future?
With power bills going ever upwards Gippslanders are thinking laterally in search of solutions. Carolyn Crossley from the Cowwarr Art Gallery has introduced LED lighting and is confident it will cut her power bill by 90 per cent.
- Print page
- Email this
- Permalink
With lighting being the major cost to the gallery's budget each year Carolyn began looking for a lighting system that was more cost effective more than a year ago.
With the help of both a local electrician and a lighting consultant, she has recently installed a $5,000 LED lighting system which both showcases the art works on display and also promises significant reductions in the gallery's power bill.
Carolyn believes the future of lighting will be vastly different to what we currently have on offer with new 'greener' lighting systems becoming available.
CEO of Lighting Council Australia, Bryan Douglas says that while LED lights are an addition to the market place, consumers should do their research before investing in the technology.
"LED's will permeate just about every feature, every lighting application including at the domestic level but the technology is still maturing, costs are still quite high but perhaps they're not quite ready yet for domestic applications."
While urging caution Mr Douglas says that a home owner determined to make the change to LED should follow some simple guidelines.
"There are good products available that will replace the down lights but it's a case of buyer beware. I'd recommend that your listeners only buy reputable product...my organisation has developed a certification program, in the absence of... (international) standards. You can look for a label with Lighting Council Australia. We're a not for profit organisation. We do not promote one brand over another... We see test reports on the products before we issue that label."
Latest videos
- ENGIE Australia CEO Alex Keisser says the company looked at all other options before deciding to close the plant
- Daniel Andrews announces support for Morwell and Hazelwood employees
- Footage shows the plane crash site near Yarram airport in Victoria
- Two adult male kangaroos boxing on Raymond Island
- Footage of the washed up yacht taken from a police helicopter
Latest audio
- Federal Government intervenes in Heyfield Mill closure in Victoria
- A Big Country: Footy passions run high at Moe
- Brett Worthington reports on why the dairy bubble burst and how the industry ended in crisis
- Heywire winner Lauren Shin Carlson
- Gippsland mother-of-three Fiona Plant says her family is owed hundreds of thousands of dollars by National Dairy Products.


text:
While the casual games giant (and crack dealer) made no mention of those platforms specifically (other than to say it has no plans involving them), it did want to make clear that its goal is to bring its product to as many people as possible. The company explained that its "overriding mission" is to have its games "in as many different places, and on as many platforms, as possible – to make them accessible to this audience of 'everyone'."
The game would be great on XBLA, PSN and WiiWare, we'd say. And, sure, why not the iPhone? That thing is too legit to quit now.


text:
"The champions of socialism call themselves progressives, but they recommend a system which is characterized by rigid observance of routine and by a resistance to every kind of improvement. They call themselves liberals, but they are intent upon abolishing liberty. They call themselves democrats, but they yearn for dictatorship. They call themselves revolutionaries, but they want to make the government omnipotent. They promise the blessings of the Garden of Eden, but they plan to transform the world into a gigantic post office. Every man but one a subordinate clerk in a bureau. What an alluring utopia! What a noble cause to fight!" ~ Ludwig von Mises
New Yorker Arrested For "Hording" Gas, Gas Station Owner Arrested For Selling It To Him
Submitted by DP_Thinker on Wed, 2012-11-07 01:00
Disaster situations like this are propaganda goldmines for governments because it gives them an opportunity to pretend that they are relevant and necessary for a society to work.
Your rating: None
- Login to post comments
User Login
Search This Site
Recent comments
2 days 15 hours ago
3 days 15 hours ago
5 days 8 hours ago
5 days 10 hours ago
5 days 13 hours ago
5 days 13 hours ago
5 days 13 hours ago
5 days 13 hours ago
5 days 13 hours ago
5 days 15 hours ago


text:
the signs based on people i know
aries: stubborn and independent, married to their netflix account, assholes but lowkey sensitive, always ready to turn up
taurus: competitive and sensitive, loves food and attention, would do anything to protect their friends and family, good for late night talks
gemini: either very emotional and empathetic or very cold and self-absorbed, silly, good sense of humor, quick to cut people out of their lives
cancer: no chill, always there to tell you the truth when you need it but usually in a nice way, would probably murder someone for you (or for fun)
leo: assholes, talk a lot, usually have some wild story to tell, VERY blunt and sarcastic
virgo: angels probably, always there to make you laugh, hates most people but it makes you feel special when one of them actually likes you
libra: try really hard to look cool, actually really cool most of the time, all over the place, very loyal
scorpio: VERY intense, either very sensitive or a psychopath, you can usually find them in the middle of a 5 hour long rant
sagittarius: always wants what's best for everyone, sassy, loves listening to gossip, good listeners
capricorn: either cares about everything or cares about nothing, usually the parental figure of the friend group, generally responsible but doesn't really know what they're doing
aquarius: really hard to get close to them because they're so closed off, they'll come pick your ass up at 3am from a stranger's house if you asked
pisces: all over the place (literally. it's 4 in the morning and they're not in their bed. where are they??), very VERY sweet and VERY generous


text:
Hey there, glad you could join us. However, you must be 21 years old to enter this here page.
We are located at:
30 Oldham St.
Nashville, TN 37213
The thought "be who you are, use what you got" has forged much of what we consider Southern culture. In an ever-changing world, we maintain a loyalty to sourcing local ingredients and continuing Southeastern brewing traditions.
Sustainability is not a destination. It is a journey and way of life. At Little Harpeth we are constantly looking for new ways to minimize our carbon footprint. We began from the first day and it will continue to be our agenda to take care of the environment and our community.


text:
Lisson Grove
142 Marylebone Road, NW1 5PH
We offer affordable, high-quality carpet cleaning in Lisson Grove and we know just how to treat your investment. From antique Persians to modern synthetic carpeting, we clean them all - quickly, safely and thoroughly - leaving them fresh-smelling and clean, while extending their life for many years. Proper carpet maintenance includes periodic cleaning performed by professional carpet cleaners. Our industry-leading specialized and fairly priced domestic services guarantee you the perfect results and the highest technology for cleaning solutions.


text:
I'm frequently asked for tips and tactics which people can use to be certain they are making the most of their career.
Obviously there are many lists and books out there on the subject. And based on those, it seems there are many "experts" who can provide the reader with all the tools they'll need to get ahead. People with backgrounds in human resources, consulting, coaching, and other fields as well appear to making a good living simply by addressing this need.
So why are there so many individuals who are totally dissatisfied with how they're doing?
Over the past 30 or so years, I've had the chance to work with and meet some really successful people. I've been fortunate enough to spend time with the chairmen of a diverse group of large companies like AT&T, Cablevision, DIRECTV and Hudson's Bay Company. When he was the president, I was invited to have breakfast with Bill Clinton. During my career I've witnessed firsthand as successful people crashed and burned in their jobs. I've also seen individuals who were considered failures become huge success stories. At some stage I started asking these people about how they achieved what they did. Was there a magic bullet they used? Could there be a common thread in their career success – or was there really an element of luck?
I found out that almost everyone I asked this question shared one thing in common.
They all had a plan.
I know that to some of you reading this, it may sound too "easy". Can one's career success be strongly impacted by the simple activity of planning? The short answer is – ABSOLUTELY.If you don't have a plan, don't feel bad. According to our research, about 86% of people don't have a plan for their life. That means they get up every day and put their future in the hands of others. I'm all for trust, but expecting others to look after me makes me nervous.
But some people say things like:
"If I work hard, my performance will get me ahead." Or,
"I'm in a growth industry."
Many will point to their salaries and titles as evidence that no plan is needed because they are doing well without one.
My responses are always the same:
How do you know you couldn't be doing much better?
How do you determine you are as successful as you could be?
Successful career strategists don't compare themselves to those around them as much as they do to their own standards of performance. For them, the race is with themselves.
If you don't have a plan for your career, how do you check-in occasionally to see how you are doing? What measurement do you use to calculate what's required to move the next level and within a set period of time?
There's a reason why organizations and businesses spend so much time looking ahead and planning how they are going to succeed in an ever-more difficult environment.
If you think you can achieve your goals doing things differently than successful organizations or very-successful people, I urge you to think again. Take a lesson from the 14% of the population who tell us they have plans for their career success. Make your own plan. Now.
- john
Full Bio
John M. McKee is the founder and CEO of BusinessSuccessCoach.net, an international consulting and coaching practice with subscribers in 43 countries. One of the founding senior executives of DIRECTV, his hands-on experience includes leading billion dollar organizations and launching start-ups in both the U.S. and Canada. The author of two published books, he is frequently seen providing advice on TV, in magazines, and newspapers.


text:
In stereolithography (commonly known as "SLA" or "SL"), a 3D CAD drawing is turned into a solid object through the repeated solidification of liquid resin by a UV laser. Among the most common additive manufacturing techniques, SLA can produce cosmetically superior parts in as little as 1-2 days
About Stereolithography
Stereolithography (SLA) is one of the more versatile additive manufacturing technologies and goes by many names including SLA prototyping, optical fabrication, photo-solidification, solid-free-form fabrication or solid imaging.
No matter the terminology, the process involves turning a three-dimensional Computer Aided Design (CAD) drawing into a solid object through the rapid, repeated solidification of liquid resin.
To create an SLA prototype, a 3D CAD file is digitally "sliced" into horizontal cross-sections between 0.002″ and 0.006″ thick. These "slices" are entered into one of ProtoCAM's advanced stereolithography prototyping machines where an ultraviolet laser traces the first layer of the part on a metal plate submerged just below the surface of a vat of photo-sensitive polymer. Wherever the laser touches the liquid, it solidifies. Once the layer is traced, the plate sinks the thickness of a layer below the level of the liquid. The next layer is then built upon the previous layer. In this manner, the entire part is built from the bottom up.
Watch an animation of SLA:
SLA vs. SLS
- Stereolithography (SLA) is often compared and contrasted with selective laser sintering (SLS). There are several key differences between prototypes created with these two additive manufacturing techniques. These include:
- Turn-around time: SLA prototypes can be completed in as little as 1-2 days, with larger projects taking fewer than five.
- Tight tolerances: SLA prototypes can achieve tolerances +/- 0.005″ (0.127mm) for the initial inch, plus an additional 0.002″ for each additional inch.
- Surface finish: SLA prototypes typically have a cosmetically superior finish, unlike SLS prototypes, which are typically powdery and granular.
- Small-batch: SLA is well suited for small-batch or small-lot manufacturing of prototype or end-use parts.
Typical SLA Use Cases
Aesthetic models | Form/fit models | Presentation models |
Clear models | Casting molds | Click here to see available finishes. |


text:
GAH! I hate Bush!!! Whatever happened to separating church and state??? Is that not what america is all about??? ROARR! i'm so angry! I can't believe all those damn conservatives and republicans and their arrogance!!! They need, for just one second, to think about what's right for the NATION and not just what the "bible" says...ya know? For instance, gay marriage, it really pisses me off that they want to ban it just because they "don't agree with it"! IF IT DOESN'T AFFECT YOU WHY HURT OTHER PEOPLE????? And why do they get to decide if it's right or not? Obviously, they were born that way, so why on earth punish them for that????? They try and justify it by twisting the words of the bible to their advantage, but really it's just hate...and that really pisses me off! I can't belive that even some of my friends are so ignorant and hateful! GAH!!! And then abortion...who honestly has the god-given authority to decide if it's right or not? It should be a woman's choice, definetely not left to a man to decide or an entire nation to decide for one woman...what if she was raped? what if carrying the child to term would kill or hurt the mother or the baby? GAH!!! There're so many other arguments i have, but...i don't want to bore anyone...so i'll stop...lol.
Oh yeah, Bush won. Oh yeah, Bush kicks arse.Oh yeah, Bush is the choice of the people.Oh yeah, Bush won by a landslide.Oh yeah, Bush got 4,000,000 more votes than Kerry.Oh yeah, Bush whooped Kerry electorally.Oh yeah, he's an 8 year president.Oh yeah, Cheney's there too.Oh yeah, Teresa Heinz-Kerry won't be a our First Lady.Oh yeah, John Edwards aka Silky Pony aka Breck Girl won't be the VP.Oh yeah, we got even more seats in the Senate.Oh yeah, we got even more seats in the House.Oh yeah, we picked up some governorshps.Oh yeah, Democrats are splitting.W Stands for Win.Ahh, is that the sweet smelling fragrance of ...victory... wafting in my open, flaring nostrils?
From today's Daily Mirror in the UK - um...yeah, exactly...yikes!
I'm moving to the United States of Canada biotch!
From a friend of mine's journal:I just read on another list that someone proposed everyone opposed to the election results wear black tomorrow, in mourning. I think I'll do it.I am going to do it too.


text: LSU and Will Wade reached an agreement for the 34-year-old to become the Tigers' 22nd basketball coach, a source confirmed to Tiger Rag Monday night, following reports from CBS and ESPN. The deal, first reported by ESPN, is six years. Financial terms remained undisclosed but are thought to be near $2 million annually. Wade has led VCU to consecutive NCAA Tournament appearances in his only two years on the job. The former VCU assistant on Shaka Smart's 2011 Final Four team spent two years previously at Chattanooga, earning Southern Conference Coach of the Year in 2014. A former student manager and then graduate assistant at Clemson, Wade earned a reputation as an ace recruiter, first under Tommy Amaker at Harvard and then under Smart in Richmond. Stay tuned to WWL AM 870 | FM 105-3 and WWL.com for the latest.


text:
Where are Cougs' casualties now?
SO WHERE ARE THEY NOW? At least four of the eight former Cougar footballers whose academic woes contributed most severely to the scholarship penalty the NCAA recently handed down on Washington State are still pursuing their athletic careers.
Full Story
May 13, 2008
FALL CAMP: Day One
PULLMAN -- Bill Doba, true to his Midwestern roots, is typically restrained in analyzing unproven talent. This year, however, Doba has repeatedly hailed Washington State's recruiting class as the best in his five years as head coach. Sunday afternoon, it took just one practice for observers to see what Doba was talking about. A ton of news and notes from the first day of fall camp on the Palouse.
Full Story
August 6, 2007
DT Bryan Tarkington: Comes up short
Full Story
August 5, 2007
Boyd dreams big, Akey smilin' at DT health
PULLMAN – Senior tight end Cody Boyd, one of the fourth quarter heroes of WSU's dramatic 2005 Apple Cup victory, wants to make his final showdown with Washington this Saturday even more memorable. Meanwhile, the Cougs' young Californians say the importance of the rivalry isn't lost on them. And defensive coordinator Robb Akey is smiling with a full complement of defensive tackles.
Full Story
November 14, 2006
Cougs ailing; but Hill says confidence high
AT LEAST THREE COUGAR STARTERS, and possibly a fourth, could miss the UCLA tilt this Saturday unless changes occur on the WSU Medical Report between now and game time. Nevertheless, senior wide receiver and team captain Jason Hill says the 34-23 victory over the nationally ranked Oregon Ducks on Saturday could be just the tonic to kick start a crimson stretch drive to remember.
Full Story
October 23, 2006
PHOTO ESSAY: Cougs 34, Ducks 23
PULLMAN -- Sunday, the Cougars made their 2006 debut in the BCS standings at No. 25. The day before, on Saturday, despite losing both starting d-tackles and four starters total, WSU crossed the goal line five times and held No. 14 Oregon without an offensive touchdown until the halfway mark of the fourth period. The CF.C photo essay: Washington State vs. Oregon, presented in living Technicolor.
Full Story
October 22, 2006
What they're saying: post-Oregon edition
THE COUGS' 34-23 dismantling of Oregon wasn't that close, according to reports across the Pacific Northwest. Scribes found several crimson-clad playmakers worthy of praise, dotting the WSU roster like so many ducks lined up in a pond. The Cougar stop corps brushed aside the No. 4 offense in the land, while Washington State's offense 'smacked somebody in the mouth' on their way to five touchdowns.
Full Story
October 22, 2006
Tackles Tark and Eich 'played guts out'
PULLMAN – Matt Eichelberger and Bryan Tarkington, rarely used backups, were thrust into prime time in Washington State's resounding victory over No. 14-ranked Oregon and "played their guts out," Cougar head coach Bill Doba gushed in the afterglow of his team's 34-23 win under sunny Palouse skies.
Full Story
October 21, 2006


text:
Mercedes-Benz G500 for Sale
Viewing 1 - 4 of 4 results
2007 Mercedes-Benz G500
PInellas Park, FL
2007 Mercedes-Benz G500 with 78,105 miles This Mercedes G500 is in Excellent Condition, painted in Silver with Black leather interior the SUV is very well... More
Offered By: Private Allstar Cars
1991 Mercedes-Benz G500 300GE Cabrio
Chicago, IL
EXTREMELY RARE 300GE CABRIO. 5-SPEED MANUAL, COMPLETELY RUST FREE, EXCELLENT MECHANICAL CONDITION. MB 3.0 LITER 6-CYLINER 103 GAS ENGINE. NEW TIRES JUST INSTALLED, REVERSE... More
Offered By: North Shore Autosport
2002 Mercedes-Benz G500 SUV
Denver, CO
Worldwide Vintage Autos is pleased to present this 2002 Mercedes-Benz G500. We scour the country for vintage cars and trucks and we rarely come... More
2000 Mercedes-Benz G500 G500 Europa
San Diego, CA
2000 Mercedes G500 Europa Silver with Black interior only 54214 miles WDBEG4210Y7122471 These hand built pre-MBUSA GWagens rarely come for sale in the US and you will... More
Offered By: Veloce Motorsales


text:
Finding Profit Margin
Would you like to take your small business to the next level? Well, all you have to do is to find profit margin.
You will know all the details about this by simply reading this article.
There are several complicated ways on how you will be able to look for the perfect niche for your business but the best way to do it is to keep everything simple especially if you plan to sell online. Don't immediately look for the so-called big thing each time you start up a new site. You also need to look for goods and products that sell and have a stable market offering a room for you to build your site.
The following are some of the best tips you can use in order to effectively find profit margin.
Check Our Click Bank and Look for Gooding having High Gravity Score
Veteran affiliate marketers know for a fact that Click Bank is the best place to go to because if offers the most profitable niches. With the help of Click Bank, you will be able to find the profit margin of the best products that you can sell online.
Check Out the Click Bank Marketplace and Look for Any Term
If you have entered commodity trading, you will find the trading so easy. Bear in mind that a site having 96 gravity can successfully do the trick.
Gravity Score—An Indicator of What is Hot and What is Not in the Market
The gravity score serves as the indicator that there are several affiliate sites selling a certain product. Every time a certain product is sold by a different affiliate within a given period of time, the gravity score increases. If a seller was able to sell a total of 600 products, it would count only one point.
A Product having a Gravity Score of Over 40 is a Very Good Sign
If a product only sells at a score of 40, which means that it is doing well. So, it should be the one for you to sell. If 130 people or more have sold a certain product, it would be an excellent niche having lots of potential for profit. If the score is showing you this statistic, you should already begin to make a move. Who knows? That product might be the key for you to conquer the online market.
Visit Amazon.com on a Regular Basis
No one can deny the fact that Amazon is the leading online stores of today. So, to find the profit margin of products, you should make it a point to visit it. Did you know that even veterans make use of it just to know what products they need to sell and what products they need to ignore? By studying the market, you will always be on the right track.


text:
Michael Kors
"LIST PRICE" is the suggested retail price provided to us by our suppliers and/or manufacturers. We make no representation that a substantial number of these products have been sold or offered for sale at the list price. Actual retail prices in your area may be substantially different. Because we sell our merchandise over the internet on a national basis, it is not possible to know if our merchandise is sold at list price in any particular location or at any particular time. In addition, manufacturers may use formulas to determine the suggested retail price which may not correspond to what a product actually sells for regularly. "SAVINGS" and/or the "% OFF" shown throughout our site reflects the difference between our price and the supplier/manufacturer provided list price shown on our sites. Because the list price may be different than the actual retail prices in your area, you may not actually realize a savings of this amount and may want to make an exact comparison for yourself by checking the prices of other internet or local retailers prior to making a purchase.
Movement: | Quartz |
Case Diameter (mm.): | 45 |
Product Specs
Case Size (mm): | |
Movement: | |
Band Type: | |
Band Material: | |
Gender: | |
Water resistant: |
Other Items You May Like
Michael Kors has an elaborate reputation for meeting elegance and class at its finest. Its gold-tone case is stunning and the MK logo on the dial will turn heads and peak the interest of everyone around you. These remarkable timepieces are sure to enhance your style and soar your confidence.
Movement: | Quartz |
Case Diameter (mm.): | 45 |
Series: | Runway |
Gender: | Women |
Dial Color Primary: | Tortoise |
Band Color: | Gold-Tone |
Band Color Secondary: | Tortoise |
Band Finish: | Polished |
Band Length (in.): | 8.5 |
Band Material: | Stainless Steel |
Band Type: | Bracelet |
Band Width (mm.): | 24 |
Bezel Color: | Gold-Tone |
Bezel Material: | Stainless steel |
Case Back Material: | Stainless Steel |
Case Back Type: | Screw-down |
Case Color: | Gold-Tone |
Case Finish: | Polished |
Case Material: | Stainless Steel |
Case Shape: | Round |
Clasp Type: | Push button deployment |
Condition: | New |
Crown Type: | Push/pull |
Crystal Type: | Mineral |
Dial Finish: | Smooth |
Dial Markers: | None |
Hand Color(s): | Gold-Tone Hour, Minute, and Second. |
Movement Origin Country: | Japan |
Water Resistance: | 50M |
Weight (g.): | 165 |
Case Thickness (mm.): | 15 |
Brand: | Michael Kors |
WOW Id: | 188005 |