text:
The Body Shop White Musk EDT
48 reviews
64% would repurchase
Package Quality: 3.4
Price: $$
Package Quality: 3.4
Price: $$
Not tested on animals
The Body Shop is a Cruelty-Free Subsidiary.
Where to Buy
Start your review
on 7/25/2015 7:09:00 PM
Age: 30-35
Skin: Combination, Fair, Cool
Hair: Blond, Straight, Fine
Eyes: Green
I know the scent, ever since I was in my early teens, but I never bought it. I found it a bit to heady and old for me. Now that I know that heavy en heady scents are my cup of tea, I fell in love with this familiar scent. Yes, it can be a bit heady, but it's not overpowering and loud. It's a clean and sexy scent. It is suitable for any occasion (work, party, family, wedding, funeral). it works all the time. What surprised me the most was its staying power. It does a much better job than my high end perfumes. i spray this on my arm and the next day it's still detectable! Even after a shower I can still smell it! Now, That is a perfume. I love to layer it with the soap and body butter. I simply can't get enough of this fantastic scent.
on 5/25/2013 1:30:00 PM
Age: 19-24
Skin: Combination, Fair, Cool
Hair: Blond, Straight, Fine
Eyes: Blue
This was one of those sents that you never really can figure out if you like it or not. One moment I would love how it smelled, the next moment I felt ill from the scent. I would not purchase the product again for that reason alone. I usually like musks, so I don't know why this one and I did not get along.
on 4/13/2013 12:22:00 AM
Age: 36-43
Skin: Normal, Other, Not Sure
Hair: Blond, Other, Other
Eyes: Blue
I prefer this over the oil. The oil,way back in the day smelled delicious but it's been tweaked and now has an acrid sourness to it. The edt is softer a truer to the original musk...it's also lighter which I like. A comforting scent or me.
on 12/26/2012 8:46:00 PM
Age: 25-29
Skin: Acne-prone, Fair-Medium, Neutral
Hair: Brunette, Other, Fine
Eyes: Green
One of my favorite smells ever. I don't like overly flowery smells so this to me is amazing. Took a lippie off because it doesn't last as long as I like. Will be trying the perfume oil version next.
on 10/1/2011 2:26:00 PM
Age: 25-29
Skin: Dry, Fair-Medium, Warm
Hair: Blond, Straight, Medium
Eyes: Blue
I think that this is a lovely scent, but the staying power sucks! The EdP version does not smell as nice as this one so I pass on that. I think you need to buy the bath & body products of this line to layer and make the scent last longer. I like this, but I would not buy it again simply because it does not last en I don't want to buy the entire line to make it last.
on 7/21/2011 8:08:00 PM
Age: 18 & Under
Skin: Combination, Fair-Medium, Warm
Hair: Brunette, Wavy, Medium
Eyes: Blue
OH MY GOSH. I got this as a sample at The Body Shop and it smells so good. It reminds me of an older woman's scent, but re-vamped for a younger crowd. It's crisp and fresh and smells amazing. Great for really any occasion...I'm really considering buying this in the large bottle.
on 7/19/2011 1:54:00 AM
Age: 36-43
Skin: Oily, Fair-Medium, Warm
Hair: Brunette, Other, Other
Eyes: Green
This is fragrance that I have re purchased many times over. It's a simple, fresh scent that I wear to work a lot. It's also inexpensive which is a bonus :)
on 5/9/2011 11:08:00 AM
Age: 44-55
Skin: Combination, Fair, Cool
Hair: Blond, Straight, Fine
Eyes: Hazel
I love Musks but not a fan of white musks This is A faint smelling White musk. I dont care for it but i do not really like "white" type perfumes anyway Good thing it has No staying power so I didnt have to suffer long
on 1/13/2011 7:19:00 AM
Age: 25-29
Skin: Sensitive, Fair-Medium, Not Sure
Hair: Black, Wavy, Coarse
Eyes: Black
doesnt last long.. but nice powdery smell..and great for evryday use very fresh and clean and also cheaper as compared to other branded perfumes .
on 11/29/2010 2:18:00 AM
Age: 19-24
Skin: Oily, Fair, Not Sure
Hair: Red, Other, Other
Eyes: Hazel
It may sound weird but this scent relaxes me, even though I'm more on th sweet side. I think that it's because it remind me of my childhood.
It's an EDT so it doesn't last long but it's got a lovely smell.
Popular Fragrances
1420 Reviews
184 Reviews
77 Reviews
159 Reviews
717 Reviews
192 Reviews


text:
Grilled Shrimp -- Mmmmmm
Total Time
Prep 10 mins
Cook 6 mins
A nice modernized version of the old classic shrimp cocktail. Watch 'em disappear!
Ingredients Nutrition
For the rub
- 1 tablespoon paprika
- 1 tablespoon garlic powder
- 1 tablespoon garlic salt
- 1⁄2 tablespoon black pepper
- 1 tablespoon italian seasoning
- 2 tablespoons brown sugar
For the shrimp
- 2 tablespoons olive oil (give or take)
- 2 lbs medium shrimp, peeled and deveined (U-25s ( I buy them peeled and deveined)
- In a 1 gal plastic food bag place shrimp and olive oil, toss to coat, sprinkle enough rub to lightly coat the shrimp.
- The bag should look dark red.
- Refrigerate for 1-4 hrs, the longer you wait the hotter they'll be.
- Light the grill and while it's heating place shrimp on skewers.
- When coals are very hot, clean the area that the shrimp will be on and rub with a bit of canola oil on a rag (use a mitt please).
- Immediately place shrimp on greased grill for 2-3 minutes, turn and cook an additional 2-3 minutes.
- Remove from skewers and serve hot.
- No dipping sauce required.
- This rub works well on chicken wings too!
Most Helpful
This recipe is sooo yummy! I will definitly hold on to this one!
Simplicity at its best, so quick and easy, yet very yummy! My whole family loved them. I added a little cayenne for some heat.
Simple and delicious. I picked up shrimp that had already had the shells removed so was trying to find a well-rated recipe that would work without drying them out. This simple take did the trick. The shrimp turned out plump, juicy and delish.
My Italian seasoning blend had salt in it -- plus I had garlic salt so I might cut back on the sodium a little next time but otherwise...SOLD! You shared a winner Steve_G. Thanks!

subset: commoncrawl


text:
This NINDS-supported Core (formerly called BAG Engineering Technology) has been in operation for nine years under the direction of Dr. JrGang ,Cheng, a pioneer in the field of BAC recombineering. Over this time, our Core established a local and national reputation for excellence in generating BAC transgenes and gene? targeting constructs (Essential function #1 below, Figs. 1.1 &1.2). To capitalize on the molecular expertise of the core and economies of scale, we propose to expand its essential functions (to include items #2-4 below) in this renewal period. ?
|Burette, Alain C; Park, Haram; Weinberg, Richard J (2014) Postsynaptic distribution of IRSp53 in spiny excitatory and inhibitory neurons. J Comp Neurol 522:2164-78
|Wright, Brittany D; Loo, Lipin; Street, Sarah E et al. (2014) The lipid kinase PIP5K1C regulates pain signaling and sensitization. Neuron 82:836-47
|Huang, Hsien-Sung; Yoon, Bong-June; Brooks, Sherian et al. (2014) Snx14 regulates neuronal excitability, promotes synaptic transmission, and is imprinted in the brain of mice. PLoS One 9:e98383
|Mabb, Angela M; Kullmann, Paul H M; Twomey, Margaret A et al. (2014) Topoisomerase 1 inhibition reversibly impairs synaptic function. Proc Natl Acad Sci U S A 111:17290-5
|Zhu, Hu; Pleil, Kristen E; Urban, Daniel J et al. (2014) Chemogenetic inactivation of ventral hippocampal glutamatergic neurons disrupts consolidation of contextual fear memory. Neuropsychopharmacology 39:1880-92
|Demyanenko, Galina P; Mohan, Vishwa; Zhang, Xuying et al. (2014) Neural cell adhesion molecule NrCAM regulates Semaphorin 3F-induced dendritic spine remodeling. J Neurosci 34:11274-87
|Larsen, Rylan S; Smith, Ikuko T; Miriyala, Jayalakshmi et al. (2014) Synapse-specific control of experience-dependent plasticity by presynaptic NMDA receptors. Neuron 83:879-93
|McNeill, Robert S; Schmid, Ralf S; Bash, Ryan E et al. (2014) Modeling astrocytoma pathogenesis in vitro and in vivo using cortical astrocytes or neural stem cells from conditional, genetically engineered mice. J Vis Exp :
|Gama, Vivian; Swahari, Vijay; Schafer, Johanna et al. (2014) The E3 ligase PARC mediates the degradation of cytosolic cytochrome c to promote survival in neurons and cancer cells. Sci Signal 7:ra67
|Morgan-Smith, Meghan; Wu, Yaohong; Zhu, Xiaoqin et al. (2014) GSK-3 signaling in developing cortical neurons is essential for radial migration and dendritic orientation. Elife 3:e02663
Showing the most recent 10 out of 54 publications


text:
Post a comment
Recent News
Giving away handwritten Pieces lyrics to one lucky winner! To enter, follow Topsify's #FreshHits playlist on Spotify. robthom.as/TopsifySweeps
Join Rob Thomas for an unforgettable trip to The Hard Rock Hotel In Las Vegas! Spend three days and two nights in Las Vegas, enjoy a private, intimate show and photo with Rob Thomas, and much more. This is the ultimate fan experience, don't miss it! Rob...
JUST ANNOUNCED: Rob has just announced three very special shows happening January 2017!


text: The Royals are rocking the Tribe staff today, losing 10-8, Mota giving up 2 homers in the eighth after the offense just got the game tied at 8-8 after trailing 8-5. As I check the scores regularly, I continue to see high scores from the Cleveland nine. So far, they have reminded me of the 2004-2005 version of the Reds. I know Sabathia's hurt, but what's going on Tribe fans?


text:
Rear wiper
View Single Post
the kidd
pay it forward
Location: boston
Join Date: Jun 2010
Posts: 1,186
Mein Auto: Subaru Impreza for now
View My Garage
I forgot to mention that they "only charged" me 35 dollars since we were in disagreement. I will now be driving into the city or out to Sudbury for my remaining service needs. Not that this is topic related, but while I was waiting for wiper rape, I noticed a 2012 M3 in their showroom with swirls all over it. That right there screams "I don't give a **** about my product".
Present: 2013 subaru impreza with a great stereo!
2013 Honda Pilot Black/gray
2014 X3 msport carbon/chestnut
Past: 2013 X1 msport mineral/black (Takata)
2011 E90 M3 competition pkg Jerez/beige(i miss u so much)
2011 E70 35i titanium/black
2013 Subaru Impreza graphite/black
2011 E90 335i xdrive (bad mistake)
2005 Subaru Legacy GT
2002 Mini Cooper
the kidd
View Public Profile
Find all threads started by the kidd
Find all posts by the kidd
View My Garage
Add the kidd to Your Ignore List


text:
|Publication number
|Publication type
|Publication date
|May 28, 1974
|Filing date
|Jan 5, 1972
|Priority date
|Jan 5, 1972
|Also published as
|Publication number
|Arps R
|Original Assignee
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (4), Referenced by (44), Classifications (15)
|External Links: USPTO, USPTO Assignment, Espacenet
United States'Patent [1 1 Arps [11 3,813,485 May 28, 1974 SYSTEM FOR COMPRESSION OF DIGITAL DATA Inventor: Ronald Barthold Arps, Stanford,
International Business Machines Corporation, Armonk, NY.
Jan. 5, 1972 [73] Assignee:
App]. No.:
l79/l5.55 R; 340/347 DD References Cited UNITED STATES PATENTS 1/1956 Oliver 179/1555 R 5/1965 Ellersick, Jr. et al. 340/347 DD 5/1965 Blasbalg et al 340/347 DD 2/1972 Beltz l78/6.8
Primary Examiner-Howard W. Britton [57] ABSTRACT A system for compressing or compacting data that is representative of scanned images. Involved are predictive coding of two level pictorial data, followed by run-length coding characterized by an infinite overflow capability. The predictive stage utilizes an nthorder exhaustive, causal predictor which looks at adjacent points of previous lines and preceding points of present lines to predict what color (black or white) the predictive is. If the prediction is in error, a binary one is transmitted. Alternatively, if the prediction is correct, a binary zero is transmitted. The run-length coding is adapted to code the run-lengths of binary zero between binary one errors using a dual-base counting system, where p represents one base (the number of low order subword states) and n represents a second base (the number of high order subword states) with a subword length, L, of log (p n) bits. Mutually exclusive states in this run-length counting system provide an automatic comma for separating variable-length words (groups of subwords). A significant advantage of this type of run-length number system is that it provides a practical run-length encoding technique with the flexibility of variable-length overflow. The overall data compacting system also achieves a relatively high compression ratio for line drawings and other related type printed matter,
18 Claims, 9 Drawing Figures 1? STANDARD CHANNEL U COMPUTER H CONTROLUNIT SHARED BUFFER COMPRESSED AN AN IMAGE BUFFER DICTIONARY BUFFERS 05 m 35 4al l 45{ P41,
C D AN 0 E c GENER- u is; o 3 ATOR l 41 KEYBOARD BUFFER F cuRsoR SOURCE CONTROL SELECTOR LOGIC um i PARTIAL RASTER I BUFFER SCANNER 25 K i\'-33 PRINT/SCAN BUFFER iiiir i PRINTER DISPLAY 25 KEYBOARD PATENTEDHAY 28 I974 saw 1 BF 5.
i? y STANDARD CHANNEL 49 COMPUTER r, CONTROL UNIT A F sRARED BUFFER COMPRESSED AN AN FMADE BUFFER DICTIONARY BUFFERS CBFACBZ c D 0 E E NER- H '3 0 3 ATOR 27 3 41 KEYBOARD BUFFER F' OR souRcE A M SELECTOR v 19 PARTIAL RASTER I BUFFER SCANNER 23 L33 PRINT/ SCAN REFRESH BUFFER BUFFER PRINTER 29 v DISPLAY 21 25 KEYBOARD Fl G, i
PATENTEDm 2a 014 SHEEI 3 BF 5 i 0 RESET ABCD ABCD H0000 PATENTEDm 2 a 1914 lllllllllllllllllllll SHEEI S 01 5 FIG.5C
1 SYSTEM FOR COMPRESSION OF DIGITAL DATA BACKGROUND OF THE INVENTION 1. Field of the Invention This invention relates to the compression of images or digital data representative of such images, and more particularly to a system for compacting digital data representative of images, for operation in conjunction with a computer.
2. Description of Prior Art Data sources, such as video signals, facsimile transmission signals, etc., contain a substantial amount of redundancy. In view of this, source coding techniques, also called data compaction or compression, are sometimes used to efficiently encode the outputs of such data sources. Two obvious applications exist for these compaction methods/The first is in communications systems. Thus, by encoding the source, we can transmit the information over a communication channel in a relatively shorter period of time. Alternatively, a channel with smaller bandwidth could be utilized to transmit the coded data. The second application is in storage systems. In storage systems, one can use the available area of the medium more efficiently by compacting the data to be stored. Various techniques have previously been considered and implemented for the compacting of image bearing multi-level digital data. One such technique is known as predictive coding. This approach makes full use of a particular pertinent past to predict a signal, and then produces an error signal equivalent to the difference between the actual and predicted signals. If relatively accurate prediction is achieved, the difference between the actual signal and the predicted signal, which constitutes the error signal, has a very small amplitude most of the time. This allows the error signal to be expressed in a variable length binary code which requires much less transmission bandwidth than direct binary encoding of our original picture signal.
Another prior art technique which has proven useful in compacting digital data representative of images, is known as run-length encoding. This particular data compaction technique consists of transmitting with each non-redundant sample, a binary representation of the number or run-length of redundant (untransmitted) samples that have occurred since the previous transmitted sample. The position in the frame of any data sample may then be found by summing the number of nonredundant and redundant samples before it.
The aforementioned predictive coding and runlength encoding techniques both afford individual advantages in obtaining compression or compaction of image representative digital data. Accordingly, it has been found desirable to combine these two techniques to form two basic steps for a compression process. It has also been found desirable to utilize a run-length encoding technique which is essentially compatible with IBM computers, and also provides variable word length.
SUMMARY OF THE INVENTION An important object of this invention is to provide an improved method and apparatus for the compression of digital data.
Another object of this invention is to provide an improved method for compacting digital data representative of images.
A further object of this invention is to provide an improved apparatus which is capable of compressing digital information representing images, to achieve a relatively high compression ratio.
Still another object of my invention is to obtain an improved method and apparatus for compressing digital information which utilizes both exhaustive predictive coding and run-length encoding techniques capable of overflow.
In carrying out my invention, in one form thereof, it
is applied to a system for handling and processing digital data representing images. Such a system includes a source of digital signals and a compressor for compacting the digital data representing these signals. The compressor includes a two-dimensional predictor stage, and a run-length encoding stage. The predictor stage is a four point causal predictor which includes three one bit registers e.g. latches or flip flops for holding 3 bits for image positions adjacent to a predictable point on the previous line. Another one bit register similar to the previous three holds a bit for a previous image position on the present line on which the point is to be predicted. In addition, the predictor stage includes an exhaustive predictor logic unit. The predictor stage looks at the preceding point in a present line of the image and three points in the previous line to predict what color (black or white) the predicted point is. If the prediction is in error, a l is transmitted. If the prediction is correct, a 0 is transmitted. The predicted and actual values for each current or predicted picture element, are fed to an exclusive OR unit, which compares the output value of the predictor with the actual value of the current picture element. This provides a stream of digital data representing a new or error image based on a comparison between the predicted picture elements and the actual picture elements. For encoding the new error image, a run-length encoder state is provided. This run-length encoder stage uses variable length words, with subword length L related to a dual-base counting system such that L log (p n) bits, where p the number of states in the lower order subwords; n equals the number of states in successive higher and highest order subwords. The output of the compressor stage is fed to a buffer, which receives and stores the digital data after the data has been processed by the predictor and run-length encoder stages.
With such an image compression arrangement, it has been found that a relatively high compression ratio is achieved. In addition, an overflow capability is achieved by the use of dual-base counting, which adds to the efficiency in processing digital representations of images with differing picture elements per line. An additional advantage resides in the fact that the runlength encoding technique of the present invention is fully compatible with computers, and provides relatively high efficiency when used in conjunction therewith.
BRIEF DESCRIPTION OF THE DRAWINGS The foregoing objects, features, and advantages of this invention will be apparent from the following description of the drawings, in which:
FIG. 1 is a schematic diagram of an image processing system, with lines and arrows showing the data flow to and from an exemplary compressor and decompressor unit.
FIG. 2 is a schematic diagram of a digital data compressor for an image processing system, embodying the present invention;
FIG. 3a is a schematic diagram of a predictor stage, showing in greater detail the components of the predictor stage set forth in FIG. 2;
FIG. 3b is an exemplary prediction coding system which may be utilized in conjunction with the compressor shown in FIG. 2;
FIG. 4 is a digital data decompressor for an image processing system embodying the present invention.
FIG. 5A is a bit position layout for the first five scan lines of a typical image;
FIG. 5B is a bit position layout of the error image derived from the actual image layout of FIG. 5A;
FIG. 5C is a number layout for the run-length encoder derived from the error image layout of FIG. 53 with separate lines to illustrate the method; and
FIG. 5D is a code layout (in compressed format) from FIG. 5C for the run-length encoding technique involving a (10, 6) type number system.
, DETAILED DESCRIPTION Referring now to the drawings, there is shown in FIG. 1, a schematic diagram of an image processing system in which my invention may be effectively embodied. This system may be integrated into a standard com puter system 15, such as the IBM 5/370, that handles the storage of coded alphanumeric information and compressed image bearing information. Basically, the image processing system 11 includes a control unit 17 coupled to a scanner l9 and a printer 21 by way of a print/scan buffer 23; a keyboard 25 coupled to the control unit 17 by way of a keyboard buffer 27; a refresh buffer 29 coupled to the print scan buffer 23 and an interactive display 31; a partial raster buffer 33 coupled to the refresh buffer 29, and a buffer and compression/- decompression system 35 connected between the partial raster buffer 33 and the control unit 17.
In the illustrated embodiment, the buffer and compression/decompression system 35 includes a source selector 37 connected between the control unit 17 and the partial raster buffer 33. Source selector 37 is also connected to the output of a decompressor 39 and an alphanumeric generator 41. A compressor 42 is connected between the partial raster buffer 33 and a pair of compressed image buffers 43, to compact digitized data representing images prior to storage thereof. The buffer and compression/decompression stage 35 also includes an alphanumeric buffer 45 which is used to store the image in mapped format. This particular buffer 45 is preferably the size of a complete alphanumeric or coded image. The alphanumeric buffer 45 is coupled at its output to alphanumeric generator 41. In addition, an alphanumeric dictionary 47 is coupled to the alphanumeric generator 41, to provide a source of raster data.
For storing digital data after its compression, a storage file 49 is also coupled to the control unit 17.
To store a document in the image processing system 11, the index descriptors for it are entered on the keyboard 25 at the filing station (which may combine the scanner 19, display 31 and keyboard 25). The document is placed face down on the platen of the scanner 19. The image is then electronically scanned and transferred to the refresh'buffer 29. The display at the filing station is refreshed directly from the refresh buffer 29 so that the user can see exactly how the document was captured by the system. When the operator of the system is satisfied with the position and quality of the image appearing on display 31, the image appearing on scanner 19 is digitized by the scanner and a stream of digital data representing the image appearing on the scanner is passed through refresh buffer 29 and partial raster buffer 33 to the compressor 42 where it is compressed and thereafter transmitted to the storage disk at the unit 49, via control unit 17. While subsequent documents are being entered by the operator, the compressed image stored on the storage unit 49 can be transferred to a larger mass file (not shown) and indexed by the system. To retrieve a document (or a folder of documents), an indexed descriptor is entered on the keyboard 25 at the display station. The system converts the index descriptor into an address so that the proper disk cartridge is accessed and the document is transferred to the disk file 49. The user of the system can thus browse through the file folder by selecting a specific image stored in the file 49, decompressing it, and transferring it to this display. While the user is looking at one folder, it is possible for the next folder to be retrieved from the master tile and transferred to the disk file 49 so that it will be ready for immediate viewing. The displayed image may be a composite of alphanumerics stored in coded form and an image stored in digital data form. While an image is displayed, the user can clear selected areas, combine pieces of various images, draw lines, or use the keyboard to add text. For making a hard copy print, the image is transferred from the refresh buffer 29 to the print buffer 23 so that the display is free to continue working. If the print buffer 23 is busy when the user requests a print, the image can be transferred to the disk file 49 until the print buffer 29 becomes available.
Turning now to an important aspect 'of my invention, which concerns itself with the provision of a novel and improved system for compacting and compressing digital data representing images, attention is directed to the embodiment illustrated in FIG. 2. As shown therein, the compressor 42 includes a predictor stage and a runlength encoderstage. The embodiment of the predictor stage will first be discussed.
PREDICTOR CODING STAGE The compressor 42 includes two basic stages, a predictor stage and a run-length coding stage. Viewing FIG. 2, the compressor cycle starts when the next bit of data is read into a register 51. The register 51 has its output coupled to a line buffer shift register S3.The passage of a bit stream through the line buffer shift register 53 is controlled by AND gate 55, which receives inputs from a clock A, 57 and a clock control register 59 coupled to the predictor stage. The line buffer shift register 53 includes a number of positions equivalent to the number of bits per line, plus two. For the disclosed embodiment, which involves L056 bits per scan, this amounts to 1,058 positions. Asshown in FIG. 2, storage positions 53A, 53B, and 53C, as well as 53D, of the register 53, are gated into registers 61A, 61B, 61C, and 61D, respectively, which are fed into the predictor logic unit 63. (See also FIG. 3a)
The predictor logic unit 63 is determined by a statistical analysis and physical insight into the distribution of white and black dots in a set of documents typical of the business for which the data processing system is used. During the next time cycle, the predictor logic unit 63 computes the predicted value of the next bit P, by means of the preceding picture element in the current scan line, determined from predictor register 61D, and the 3 adjacent picture elements in the previous scan line, as determined by predictor registers 61A, 61B, and 61C. For the illustrative embodiment of the present invention, and one typical set of documents, the predictor logic unit 63 shown in FIG. 3a was utilized. As shown therein, the predictor registers 61A, 61B, 61C, and 61D, are connected to AND gates 65, 67, and 69, which are in turn coupled to an OR gate 71 that provides an output to the predicted output register 73. Thus, registers 61A, 61B, and 61C, hold adjacent 3 bits from the preceding line, and register 61D holds the previous bit of the present line. At the beginning of each bit cycle, predictor register 73 is reset to 0. If the predictor logic predicts a 1, it is then set to 1. AND gates 65, 67 and 69 perform the logic operation which can be represented by the Boolean expression:
The results of these AND gates are sent to OR gate 71, so that if either of the 3 conditions for a 1 are satisfied, register 73 is then set to l.
The value of point P is thus predicted by looking at points A, B, C, and D, and using an exhaustive logical formula or table that is not a linear relationship of these points to predict P.
Statistical tests have been made of sample pages of data to determine the conditional possibilities of P l, for all the possible combinations of points A, B, C, and D being or 1. A sample table is indicated below as TABLE 1. TABLE 1 was prepared by statistical analysis of 6 re p re s @t ative engineering drawings.
TABLE 1 Possi- A B l) Prob. hility vnluc Item 8 4 2 l of X No. 0 0 0 0 0 0 1 0 0 0 1 1 0 0 1 0 0 3 0 0 1 1 1 4 O l 0 0 0 (or 1) 5 O l 0 l l 6 0 1 1 0 1 7 0 1 1 1 1 8 1 o 0 0 0 9 1 o o 1 0 1 0 1 0 0 1 0 1 1 0 (or 11 11 1 1 0 0 0 12 1 1 0 1 1 1 1 1 u 0 14 1 1 1 1 1 15 f tems? t TABLE 1 1 2 .pr za i iwas 9 9 I0 .9%..
A graphical illustration of the mathematical table set forth in TABLE 1, is included herein as FIG. 3b. Thus, as shown in TABLE 1, for each of 16 possible combinations of neighboring picture elements A, B, C and D, the predictors guess is indicated to the right in the form of a binary l for each blank dot and a O for each white dot.
As further shown in FIG. 2. the predicted value ofthe next point is thus stored in register 73 of the predictor output. An actual register 75 is also provided, to receive the actual value of the data from data input register 51. The outputs of predictor register 73 and actual data register 75 are fed to an exclusive OR unit 77. The
OR unit 77 provides a 1" if there is an error when comparing the actual data in register with the pre' dicted data of register 73, and a if the predicted value is correct. During the next cycle time, the value of register 77 is gated out so that if a l is present. it passes to line 77a and if a Q is present, it passes to line 77b.
From the above description of the prediction stage, it will be understood that the output of the predictor is compared with the value of the current or actual picture element in the original image. If they are the same, a pulse is passed through line 77b to the run-length encoder by the exclusive OR unit 77. On the other hand, if the predicted value and the actual current image values are different, an error has been made, and a l bit is passed through OR circuit to AND circuit 153 which switches control to clock B, 151 for transferring the accumulated count from register 78-81 to the buffer 140, as described hereinafter. The result of this process through OR circuit 77 can be thought of as a new image where the 1" bits represent black and the Q bits represent white. This is called an error image. No compression has occurred up to this point (e.g. at output of OR 77). However, the error image is a transformation of the original image into a form which makes the run-length encoder much more efficient.
Although one particular preferred embodiment of a predictor stage has been shown, my invention is also considered to embrace other types of exhaustive and non-linear predictors which involve the utilization of a specified plurality of adjacent picture points in present or preceding scan lines for furnishing the prediction of a current picture element.
RUN LENGTH ENCODER STAGE As a further aspect of the present invention, the runlength encoder provides for the coding of the runlengths of 0" and l errors in a dual base counting system having a subword length unit L of log (p 11) bits. In general, a dual-base counting system can take either of two forms:
N= 0( p)+ 1( P)+ 2( P 20 ("'P'") where N is the run length count, p is the number of states in the lowest order subword, n is the number of states in successiver higher and highest order subwords, and the a,- and b,- are counting coefficients. Such a system has been tested both for the compression and decompression stages with software and hardware using the first equation with p 10, n 6 and L log (10-1-6) 4. For such a system, the run-lengths may be coded into 4, 8, l2, 16, etc. bit code groups. The most frequently occurring lengths are coded into 4 bits or 8 bits. The nature of the mutually-exclusive, dual-base counting states gives an automatic comma available for separating the variable length code groups as will be further elaborated upon hereinafter. Some examples of dual-base (p, n) counting systems for run-length encoding are listed below as TABLE 2, 3, 4 and 5, for purposes of further discussion. The columns are as follows:
coefficient subword equation weight (CW) state (SS) term The subword state is expressed in binary notation and the particular equation term heads the column. in TA- BLES 4 and 5, the higher order equation terms have also been designated by hexidecimal notation which appear in parenthesis.
TABLE 2 a A (4,4)counting system with subword length, L=3:
b, p) b, we) mp) u mu) t p some examples:
77773 (768 +192 48 +12 3) 1,023 7773+(192+48+12+3)=255 773+(48+l2+3)=63 73+(l2+3)=l5 3=3 some examples:
FFFB (586 +144 36+ 11) 767 FFB=(144+36+ 11)= 191 FB .6.? 111E4 TABLE 5 A (10,6) counting system with subword length, L=4:
201 1?) 10 9) u p) armo 0:1010:0000(A). 0:1010:000(A) 0:l010:00(A) 0:0000:1) 6:0110:6 1:10l1:0360(B) 1:10l1:060(]3) l:1011:10(B) 1:0001z1 7:0111z7 2.l100:0720(0).. 2.ll00:120(C) 2 1100:20(C) 2:0010:2 8:1000:8 3:l101:1080(l)) 3:1101:180(D) 3 1101:3003) 3:0011:3 9:l001:9 4:1ll0:l440(E). 1:11102240(E) 4.lll0:40(E) 4:0l00:4 5:llll:l%00(1 5:111113000) 521111151KF) 510101;:
some examples:
FFF9 =(1800 300 9) 2159 FF9 (300 50 9) 359 F9=(50+9)=59 Taking TABLE 2 as a first example of the dual-base (p, n) counting system for run-length coding; for this particular system the lowest order subword uses the first p 4 states from 0 3, the next higher order subword uses the next n 4 states firom 4-7, and the next higher order subwords continue to use the states from 4-7, etc. If it is desired to encode the decimal number 886, this would be equivalent to octal 75752 and could be encoded in binary fashion as 111101111101010. The encoding techniques set forth for TABLES 3 and 4 are substantially similar to that explained for TABLE 2.
TABLE 5 shows a particular preferred embodiment of the invention, where p 10 and n 6. As an additional example, if it is desired to encode the decimal number 359 from TABLE 5, this equals 9 50 300. S0 first the b, coefficient with state F code is sent, to symbolize the number 300. This is followed by the state F from the h column to symbolize the code for number 50. Then the state 9 from the a column is sent. This would be in the binary form of 1111 1111 1001.
A specific advantage of the p 10, n 6 type runlength encoding technique of TABLE 5 resides in the fact that this counting system readily matches the hexidecimal numbering system and 4-bit subword halfbyte L commonly used in computer systems.
Another advantage of the dual-base (p, n) counting system for run-length encoding is that this technique provides unusual groups which can be used for special purposes such as blank line, end of line" and end of image. Specifically, in counting, leading zeros" in the subword of base n are suppressed and available to prefix any special code words. Thus, for the l0, 6) system, the following special codes are available:
A0 through A9 10 special codes with two subwords AAO through A1 9 60 special code words with three subwords AAAO through AFF 9 360 special codes with four subwords Viewing the above arrangement of special codes, it will be noted that the letter A, since it denotes a zero for the subword of base 6, can be used as a prefix to generate a special code from any of the various numbers. Alternatively, the letter A may be used alone where only one special code is needed as will be described for the (10, 6) hardware that follows. It will further be noted that the following special codes could alternatively be provided for the (10, 6) counting runlength encoding technique, as the situation warrants.
A0 End of scan line A1 Blank scan line or scan line with no black picture element (no errors) A9 End of page AA9 Alternate end of page where necessary, to pad coded data to integral byte boundary.
Table 6 is presented at this point to demonstrate the counting system employed in the encoder of FIG. 2 using a (10, 6) system.
TABLE 6 Mutually-exclusive counting states for (10, 6) dual-base example;
n-States Counting Weight 1010 1011 l 1100 2 1101 3 1110 4 1111 Turning now to a further description of the illustrative compressor with regard to its emobdiment of the run-length encoding technique of the present invention, it will be noted that the four conventional binary counters 78, 79, 80 and 81 are connected in that order, in series, from line 77b of the predictor stage, to store the run-length count for the number of error free predictions before the next error. Counter 78 counts to the base p and counters 79, 80 and 81 to the base and equals 6. When reset, the counters 78, 79, 80 and 81 are initialized to the zero weight values for their base shown in their associated registers 78R, 79R, 80R and 81R. When the counter 78, 79, 80 and 81 give a carry to the next higher order counter, they are reset again to the zero weight values for their base registers 78R, 79R, 80R and 81R, respectively. Thus, when a l is added to counter 78, if there is a carry, a l is added to register 79, and flip-flop 79A (for flagging the fact that in addition to counter 78 being used, counter 79 is now also being used) is set to 1. In alike manner, during subsequent subcycles, counter 79, 80 and 81 may receive a carry and flip-flops 80A and 81A are set to I if indicated.
It is most important to note that a run-length encoding technique of the present invention includes a feature for a special code when a full 1,056 bit line of no errors is found. After each incrementing of the counters, the contents of counter 78, 79, 80 and 81 are gated respectively to associated AND gates 88, 89, 90 and 91 (where logic functions are shown in FIG. 2). Then, the outputs of these four AND gates (88, 89, 90 and 91) are gated to AND gate 100 (whose logic function is shown in FIG. 2) which thus detects the dual-base states for a count of 1,056. This sets clock control register 59 to 0" stopping any further reading of input data pending a selective reset from flip-flop 169. This also sets a register 120 for counting down the transfer of subwords of the compressed code into a compressed buffer memory 140. The compressed buffer memory 140 receives the output of the predictor stage which has in turn been compressed into a sequence of dualbase count subwords or a special code, as shall further be set forth in the transfer cycle" described hereinafter.
If the output of ANDgate 100 is 1, indicating a special code, then flip-flops 81A, 80A and 79A are reset 0," and counter 78 is set in the special code state A" (1010) by shifting contents of register 78X into counter 78.
For each error or special code, a transfer cycle occurs for the run-length encoding stage of the compressor shown in FIG. 2. For such an occurrence, a clock B, 151, inputs to AND gate 153. Gate 153 also receives an input from OR gate 155, to which AND gate 100 (special code) and line 77a (error) are connected.
Clock 151 inputs AND gate 153, when either line 77a produces a binary l or AND gate is a binary l," whereupon the register starts counting down from binary 100," first to binary 011, the address of counter 81 decoded by logic unit 157 from counter 120. The contents of counter 81 are gated through AND gate 81B to AND gate 81C to switch 159 for the compressed buffer memory if flip-flop 81A is on. Then a pulse is ANDed with the output of flip-flop 81A through AND gates 163 and adder 165, to increment address counter 161. It should be noted that if flip-flop 81A is 0, nothing happens during these cycles, which corresponds to a condition that either the run-length was too short to require use of counter 81, or that the run-length was 1,056 so that a special code in counter 78 is used.
On the next subtract cycle of counter 120 controlled by clock 15], counter 120 reads 010, the address of counter 80. If flip-flop 80A is on, the contents of counter 80 are gated to compressed buffer memory 140, and address counter 1601 is incremented. On the next cycle after that, counter 120 reads 00], the address of counter 79, and the contents of counter 79 are transferred to the compressed buffer memory 140. On the next cycle, counter 120 reads 000. This is the address counter 78, which has its contents transferred to compressed buffer memory 140. After each of these aforementioned cycles, at times AND gate 167 (coupled to the output of counter 120) is tested, and if all zeros occur, it sets a reset register 169, which resets the clock control register 59 to 1 to allow the resumption of reading input data. When reset register 169 is on, the following devices are reset (control lines being omitted from FIG. 2 to enhance simplicity):
register 59 reset to 1" counters 81, 80 and 79 reset to 1010- counter 78 reset to 0000 flip-flops 81A, 80A, 79A reset to 0 counter 120 reset to 100 reset register 169 reset to 0 The next bit of data is thereupon read into input register 51, as the compression process continues.
OPERATION OF STAGES For a further understanding of the operation of the prediction and run-length encoding stages of the present invention, attention is now directed to FIGS. 5A and 58. FIG. 5A shows the format of a typical scanned and digitized image to which the predictor code of FIG. 3b may be applied. When the predictor code is applied, the errors shown in the layout of FIG. 5B are thereby obtained. Thus, for example, it will be noted that for line 1 of the actual image, all of the bits 1-1056 have predictor reference points A, B, C and D 0 (white). As a result, prediction category number 0 of TABLE 1 and FIG. 3b applies. As a result, assuming that the previous line was blank, all of the bit positions for line 1 would be predicted as 0s or whites. Accordingly, there are no errors for the whole line, which provides a blank line 1 for FIG. 58.
For line 2 of FIG. 5A, it will be noted that bit 2-3 (i.e., line 2, bit 3) is a black. The prediction code of FIG. 3B puts this in category no. 0; since reference points A, B, C and D relative to predicted point 2-3 are all white. Accordingly, a (white) is predicted. When compared with point 2-3 of FIG. SA, which is black, it is found that this prediction for point 2-3 is in error. Therefore, point 2-3 of FIG. B has a black in that position, signifying the error.
Taking now bit 2-4 of FIG. 5A, it will be found that this bit of the actual image is also black. However, here the predictor code of FIG. 3B, finds that A, B, and C 0" (white), but D l (black). Hence, prediction category no. 1 applies, so that a I (black) is predicted. When point 2-4 of FIG. SA, which is black, is compared with its prediction (from FIG. 38, also black), no error is found. Thus a white or 0 is found in bit position 24 of the error image in FIG. 5B. In like manner, all of the predictions for the bit positions of the image of FIG. 5A, may be determined. The resulting error image when the prediction code of FIG. 3B is used, is depicted by FIG. 58.
FIG. 5C represents a numerical depiction of how the error image of FIG. 53 would be handled by the runlength encoder of my invention. For example, in line I, a code correlation of 1,056 whites would indicate no errors. For line 2, the number 2, first appearing, represents two white bit positions, automatically followed (in the absence of a subsequent zero) by a single black bit position. This correlates to bit positions 2-1, 2-2, and 2-3 of the error image. The number 1, next appearing, represents one white bit, followed by a black,.
which correlates to bit positions 2-4 and 2-5 of the error image of FIG. 58. Likewise, the next number I, correlates to bit positions 2-6 and 27 of the error image. Then after that, a number 4 appears. This correlates to the four whites of bit positions 2-8 to 2-11 inelusive, followed by the black of bit position 2-12.
Using the same reasoning already set forth above, the first and second number 2"s of line 2 of FIG. 5C, which appears after number 4, each denote two white bit positions and a black bit position for the respective bit positions 2-13, 244, 2-15; and 2-16, 2-17, 2-18 v of the error image.
It has previously been stated that each positive digit besides indicating the number of bit positions between errors (black) also automatically provides a black (implied) at the end of each run-length of whites. Since bit position 2-19 of FIG. 5B shows a black appearing after another black, a 0" appears after the second number 2 in the iine 2 sequence for FIG. 5C. This 0 signals the presence of an additional black besides the automatic black at the end of each run-length of whites.
The number 3, next appearing in line 2 of FIG. 5C, denotes the three consecutive whites, followed by a black, for bit positions 220, 2-21, 222, and 2-23. Then, after the number 3, the number 1 denotes respective white and black for bit positions 2-24, 2-25.
Next, the number 4, followed by'a 0 denotes four consecutive whites for bit positions 2-26, 2-27, 2-28, and 2-29, and two consecutive blacks for bit positions 2-.-30, 2-31.
Then, a number 2, which appears next toward break line for line 2 of FIG. 5C, denotes two consecutive whites followed by a black for bit positions 2-32, 2-33, and 2-34.
Lastly, the number 1020 appears to the right at the end of line 2 for FIG. 5C. This indicates I020 whites for the bit positions 2-35 to 2-1055, followed by a black in bit position 2-1056.
In similar fashion to the technique described above for determining'the run-length numbers of line 1 of FIG. 5C from the error image of FIG. 5B, the runlength numbers for lines 2, 3, 4, and 5 may be obtained for FIG. SC. Thus, each number denotes the number of consecutive whites appearing in an unbroken sequence, plus an automatic black at the end of the sequence. If two or more blacks appear at the end of a sequence of whites, a 0" is added to denote each additional consecutive black after the automatically denoted black. It should further be noted that at the end of lines 3, 4 of FIG. SC, and at the beginning of lines 4, 5 thereof, asterisks appear. The asterisk at the end of a line means a continuation of the same color at the beginning of the next line. The asterisk is included here for explanatory purposes. It does not have to be included in the coder or decoder.
In FIG. SD there is shown the encoding format for the run-length numbers of lines I-S of FIG. 5C. Here, it will be noted that the letter A first appearing denotes a fully blank scan line. Then, near the middle of the first line of FIG. SD, the combination of CFAO, assuming the (p, n) number system of l0, 6) is used, provides the code for the number I020.
In operation, the binary code for the first line runlength sequence of A 2 l 1 4 2 etc. would be 1010 0010 0001 O00 10l00 0010," with the first four binary digits denoting the code for a blank scan line. It should be noted that the compression code for the separate lines is run in sequence to maximize utilization of available storage area (See FIG. SD).
OVERFLOW It is important to note that by using the dual-base counting system in the encoder, more inherent power is obtained for encoding large amounts of overflow, than has been present in related prior art systems. For a further understanding of this concept, attention is directed to the following equation.
b, (pn) b,(pn where N the run-length, represented by coefficients Hg coefficient of low order base p subword counter,
b coefficient of second position or .last base n subword counter b coefficient of third position or next to last high base n subword counter b coefficient of fourth position or third last base n subword counter b,= coefficient of i -l 2 position or i I from last base it subword counter W to the zero power or 1" p== p (number of lowest order subword states) n n to the zero power or l n= 21 (number of higher order subword states) n= n to the 1' power and the coefficients a and b, are predefined to be of any constant length in bits and uniquely decodable into two mutually exclusive groups.
For computer hardware based on constant length words, a commonly desirable constraint is that the coefficients a and b, have identical constant length:
where the subword lengths L, L,,, and p as well as n, are integer valued. In such a case, the parameters (p, n) are all that are necessary to specify the code.
For the dual-base code where L, L,, 4, then For physical implementation of the above approach, one binary counter (such as counter 78 of FIG. 2) to the base p= is required, with a carry to a cascaded series of counters (such as counters 79, 80, 81 of FIG. 2) operating to the base n=6. The latter counters use the remaining six mutually exclusive states available out of the 16 possible binary combinations of length 4 and may be expanded indefinitely. Although such a code does not generally provide a perfect match, it approximates with relatively high accuracy the optimal varying word lengths needed for encoding runs while using simple hardware. A classical prior art Huffman type code, on the other hand, would generally require much more hardware to perform an encoding process that requires consultation of tables.
It should further be noted that a significant advantage of my run-length encoder resides in the fact that it provides a geometrically increasing, weighted infinite overflow capability.
DECOMPRESSION P10. 4 illustrates, by way of example, an exemplary decompressor for use with my invention. Although various elements of the compressor and decompressor and decompressor can be shared by switching between compress and decompress modes, they are for simplicity shown here as separate units.
The compressed buffer memory 140 contains part of I a page of compressed error data in the dual-base counting form. Conceptually this data is assembled in the A- shift registers 281-284 and is then transferred on for count down in the B-shift and count registers 291-294. A third set of L-shift registers 280A-280D contain special case data to be loaded upon receipt of the special character 1010" (hexidecimal A). Details of these operations that describe the routing of data between major registers will follow a paragraph on general register control and definitions.
All transfers of data from the compressed buffer memory 140 down through the aforementioned A, B and L registers are parallel, by four-bits (half-bytes). A data half-byte from compressed buffer memory 140 first goes into register 285. Meanwhile, the previous half-byte is routed into A-shift registers 281-284 by switch 259 under control of the four decoded states of counter 220. At some point, receipt of input data is temporarily suspended because stop cycle flip-flop 288 is set, which acts to inhibit the gated clock A from advancing address counter 261 and inhibits further data routing by switch 259. The stop cycle" also causes all the registers 281-284, 280A-280D and 291-294 to shift simultaneously. Meanwhile, switches 3018 and 301A provide data routing under the control of blank and copy flip-flops 267 and 289, respectively. During a shift cycle, indicated by flip-flop 286 in a 1 state, data in A-shift registers 281-284 is rightjustified under the control of counter 220. During fblank cycle, indicated by flip-flop 287 in a 1 state, switch 301B loads special data from L shift registers 280A-280D into the A-shift registers 281-284. This loads a decimal count of 1056 (hexidecimal C F D 6 representing a blank" line of no error data. During a copy cycle," indicated by flip-flop 289 in a 1 state, switch 301A routes output data from A-shift registers 281-284 to the B-shift registers 291-294. All flipflops and registers are initialized by system reset flipflop 280 to a 0 state, with the exception of registers 292-294 (see initial stage in TABLE of FIG. 4) which are reset to 1010 (system reset lines and normal clock lines to flip-flops and registers are not shown for simplicity). The inverted signal from flip-flop 260 then gates clock A 251 through an AND gate into counter 220 and address counter 261. The gated clock signals cause address counter 261 to advance and access successive half-bytes of data which are transfered from compressed buffer memory to register 285. Counter 220 is a conventional two bit up-counter whose four states are decoded for output control signals. As the counter advances from state 00" through 11," switch 259 gates successive half-bytes from register 285 into registers 284, 283, 282 and 281, respectively.
The decoding logic attached to register 285 checks all incoming half-bytes for the condition of not having an ((8 and 4) or (8 and 2)). This test for the occurrence of any of the 10 p-states of a lower-order subword, which in this embodiment indicates the end of a varying length word. When one of the 10 p-states is detected the shift cycle flip-flop 286 is set to 1," and sets stop cycle" flip-flop 288 to halt the incoming data and start the shifting action. Counter 220, which has not stopped, continues to increment and counts the shifts until it overflows and returns to state 00. This state 00 is decoded with shift cycle" and used to set copy cycle flip-flop 289, and used alone for resetting shift cycle" flip-flop 286. As a result, just enough shifts will have occurred to right-justify the data in A-registers 281-284 before flip-flop 286 is reset.
With the copy cycle indicated, switch 301A is gated such that output data from A-shift registers 281-284 is now routed to the B-shift and count registers 291-294. Counter 220 continues to increment and again overflows to state 00 when the four half-bytes have been copied from the A to B registers. The decoded counter 220 state 00 in conjunction with the presence of a copy cycle causing flip-flops 288 and 289 to be reset to 0, and alone causes count down flip-flop 260 to be set to a l. The count-down process follows, as will be described further on.
If the first half-byte to be received is a 1010" (hexidecimal A), it will be detected by the decode logic attached to register 284. This special code causes blank cycle flip-flop 287 to be set to 1" and sets stop cycle flip-flop 288, to halt incoming data and start the shift register action. The special code also causes 220 to be reset to state 00 (with flip-flop 287 not yet in a 1" state). With the blank cycle initiated, switch 3018 is gated such that special data from L-shift register 280A-280D is now routed to A-shift registers 281-284. Counter 220, which has been reset but not stopped, continues to increment and overflows to state 00" when four half-bytes have been copied from the L TO A-registers. The decoded state 00 is 'used with blank cycle to set copy cycle flip-flop cycle if it is the leading subword in a word and falls into register 284. This is then a leading-zero (which is not a permissible state in the kind of variable-length counting with leading zero" suppression) and is utilized for indicating the start of a special code word. For this embodiment there is only one special code word and hence it is only one half-byte long. However, all of the special code words previously defined are recognizable as special by this leading-zero" property, which can then be used to initiate subsequent decoding to isolate it and implement the corresponding special action.
Although flip-flop 288 is reset at the end of a copy cycle" to allow transfer of input data to resume, this transfer is actually inhibited until the count down process is completed.
If not a numeric data half-bytes are successively transferred to registers 284, 283, 282, 281 (in that order) from register 285 under the control of the conductor 220. This process is called cycle mode.
This disconnects clock A, 251 and allows Clock B, 257 to count down the B-register group. This group consists of conventional binary count-down registers with the added restriction that certain states are not used. After being loaded from the A-registers, they are counted down with carry until they reach dual-base count of zero (AAAO" in hexidecimal for this embodiment). Register 291 has 1 subtracted from it for each pulse from clock B. A carry from register 291 is detected by detecting l l 11, which results from subtracting l from 0000. The carry is implemented by subtracting 1 from the next register 292 and carryresetting register 291 to 1001. Similarly, register 292 is carry-reset to 1111 when 1001" is detected, and l s subtracted from the next register.
In the late part of each cycle of clock B, 257, logic circuits 381-384 test for the states representing zero conditions in their related registers, and are ANDed to set stop count-down register 206 to 1, when all registers are at the equivalent to zero. During the countdown, a 0 isput into register 207 during each cycle When stop count-down register 206 is set to l, a l
bit is sent through AND gate 310 to register 207.
During each cycle of the count-down and during the 1" bit cycle afterward, a shift pulse is sent through AND gate 209 which shifts shift register 302. With each shift of register 302, the latest picture point, D and three previous-line points A, B and C are sent to the predictor 270. The predictor predicts the value of the next picture point and sends the predicted value to register 208. FIG. 3A shows the details of exemplary predictor 63. The error bit and the predicted bit are exclusive ORed to regenerate an original picture point, which is then loaded into a register for input to line shift register 302.
The occurrence of a l at AND gate 310 resets register 260 to 0 to allow clock A 251 to control the transfer of another code group from the compressed buffer to the A-register group.
It will now, therefore, be seen that I have provided a new and improved data compaction system for digitized image information. The system concept affords flexibility in that a predictor or dual-base counter can be tailored to an application, while also lending itself to compatible use with a byte addressable standard computer for processing image representative information.
While in accordance with the Patent Statutes, l have described what at present is considered to be the preferredembodiment of this invention, it will be obvious to those skilled in the art that various changes or modifications may be made therein without departing from the present invention.
What I claim is:
l. A system for compressing a stream of digital data representing an original image, said system comprising:
an input stream of digital data representing said original image;
an exhaustive, non-linear predictor stage having its input connected to said stream for predicting the value of a current picture element represented by said digital data, based on the values of adjacent previous picture elements represented by said digital data, said predictor stage including:
means for comparing the output value of said predictor with the actual value of the current picture element, thereby to provide a stream of digital data representing a new image correlated to errors produced by said predictor:
and a run length encoder stage connected to the output of said predictor stage for encoding the new error correlated image,
said run length encoder stage using a variable word length, which is a multiple of subwords of length L whose 2" possible states are divided into two mutually-exclusive, unequal groups such that L= log (p-l-n) bits, where:
p the number of states in the lowest order subwords n the number of states in successive higher and highest order subwords; and a buffer for receiving and storing the digital data after said data has been processed by said predictor and said run length encoder stages. 2. The system of claim I wherein the subword length unit is 4 bits. I
3. The system of claim 1 wherein said run-length encoding stage additionally includes:
a first binary counter to the base p having a carry output, and a cascaded series of binary counters connected to said carry output, thereby providing an overflow capability for said stage. 4. The system of claim 1 wherein the subword length unit is 3 bits.
5. The system of claim 1 wherein the subword length unit is 5 bits.
6. A system for compressing a stream of digital data representing an original image, said system comprising:
an input stream of digital data representing said original image;
an exhaustive, non-linear predictor stage having its input connected to said stream, said predictor stage including:
first, second, and third registers for holding bits representative of adjacent picture elements of a previous scan line,
a fourth register for holding bits representative of a picture element preceding a predictable picture element of a current scan line,
a predictor unit for logically predicting the value of the predictable picture element of said current scan line based on the binary values of the bits held in the first, second, thirdand fourth registers of the predictor stage,
a predictor register for receiving the output of said predictor logic unit,
and means for comparing the output value of said predictor register with the actual value of said predictable picture element thereby to provide a stream of digital data representing a new image correlated to errors produced by said predictor stage;
a run length encoder using a variable word length, which is a multiple of subwords of length L whose 2 possible states are divided into two mutuallyexclusive, unequal groups such that L log (p+n) bits, where:
p the number of states in the lowest order subwords n the number of states in successive higher and highest order subwords;
and a buffer for receiving and storing the digital data after said data has been processed by said predictor and said run length encoder stages.
7. The system of claim 6 wherein p 12, n' 4, and
the subword length unit is 4 bits.
8. The system of claim 6 wherein p 10, n 6, and
the subword length unit is 4 bits.
9. The system of claim 6 additionally comprising:
logic means connected to said run length encoder stage for selecting a predetermined otherwise unused subword combination in response to detection of a totally errorless scan line.
10. The system of claim 6 wherein p 5, n 3, and
the subword length unit is 3 bits.
11. A method for compressing digital data representative of images, said method comprising the steps of:
encoding the run lengths of errors to obtain an en- I coded new error correlated image,
said encoding step using a variable word length, which is a multiple of subwords of length L whose 2' possible states are divided into two mutuallyexclusive, unequal groups such that L log (p n) bits, where: p the number of states in the lowest order subwords step of storingsaid predicted and run-length encoded data for selective reproduction of said images, 13. A system for compressing a stream of digital data representing an original image, said system comprising:
an input stream of digital data representing said original image;
an exhaustive, non-linear causal predictor stage having its input connected to said stream for predicting the value of a current picture element represented by said digital data, based on the value of at least one previous picture element represented by said digital data, said predictor stage including:
means for comparing the output value of said predictor with the actual value of the current picture element, thereby to provide a stream of digital data representing a new image correlated to errors produced by said predictor;
and a run length encoder stage connected to the output of said predictor stage for encoding the new error correlated image,
said run length encoder stage using a variable word length, which is a multiple of subwords of length L whose 2 possible stages are divided into two mutually-exclusive, unequal groups such that L log (p n) bits, where p=the number of states in the lowest order subwords n the number of states in successive higher and highest order subwords;
and a buffer for receiving and storing the digital data after said data has been processed by said predictor and said run-length encoder stages.
14. The system of claim 13 wherein subword the length unit for the (p, n) number system is any integer value.
15. A method of compressing digital data representative of images, comprising the steps of:
providing a stream of digital data representing an image,
encoding the run lengths of said stream of data, by using a variable word length, which is a multiple of subwords of length L whose 2'" possible states are divided into two mutually-exclusive, unequal groups such that L log; (p n) p the number of states in the lowest order subwords 20 line and end of page." 18. The method of claim 17 wherein: said specially encoding step additionally comprises encoding another special event from said data stream with another predetermined unused subword combination from said encoding step to denote totally errorless scan line/jump to to end of scan line in place of the last run code in a line.
|Cited Patent
|Filing date
|Publication date
|Apr 13, 1951
|Jan 24, 1956
|Oct 24, 1961
|May 25, 1965
|Data compactor
|Oct 24, 1961
|May 25, 1965
|Adaptive data compactor
|Apr 22, 1970
|Feb 15, 1972
|Rca Corp
|Variable length coding method and apparatus
|Citing Patent
|Filing date
|Publication date
|Dec 26, 1973
|Dec 9, 1975
|Apparatus for data compression encoding and decoding
|Mar 6, 1975
|Sep 14, 1976
|International Business Machines Corporation
|Encoding logic for reduced bandwidth pictorial data transmission system
|Sep 29, 1975
|Jun 7, 1977
|International Business Machines Corporation
|Apparatus for compression coding using cross-array correlation between two-dimensional matrices derived from two-valued digital images
|Sep 8, 1975
|Aug 2, 1977
|Kokusai Denshin Denwa Kabushiki Kaisha
|System for coding information change picture elements in facsimile signal
|Nov 24, 1975
|Oct 11, 1977
|Hughes Aircraft Company
|Modular programmable digital scan converter
|Apr 5, 1976
|Feb 21, 1978
|Nippon Electric Co., Ltd.
|Composite feedback predictive code communication system for a color tv signal including a carrier chrominance signal
|Nov 4, 1974
|Feb 28, 1978
|Dell Harold R
|Data compression
|Feb 19, 1976
|Jul 11, 1978
|U.S. Philips Corporation
|Facsimile system
|Nov 1, 1976
|Sep 19, 1978
|Kokusai Denshin Denwa Kabushiki Kaisha
|Facsimile signal coding method
|Jul 20, 1977
|Jan 9, 1979
|Kokusai Denshin Denwa Kabushiki Kaisha
|Method for interline-coding facsimile signal
|Sep 12, 1977
|Sep 18, 1979
|Xerox Corporation
|Regenerative decoding of binary data using minimum redundancy codes
|Jun 30, 1976
|Apr 22, 1980
|Israel Paz
|Tri-state delta modulator
|Sep 21, 1979
|Sep 15, 1981
|International Business Machines Corp.
|Method and means for preserving original continuity/discontinuity among same colored pel clusters upon array compression
|Jun 5, 1984
|Dec 24, 1985
|Codex Corporation
|Data compression
|Jun 5, 1984
|Dec 31, 1985
|Codex Corporation
|Data compression
|Jun 20, 1983
|Mar 25, 1986
|At&T Bell Laboratories
|Image coding technique
|Nov 16, 1982
|Apr 1, 1986
|Real Time Design, Inc.
|Color video system using data compression and decompression
|Dec 13, 1982
|May 20, 1986
|International Business Machines Corporation
|Multi-function image processing system
|Jun 1, 1984
|Sep 23, 1986
|Bell Communications Research, Inc.
|Conditional quantization grey level and color image coding apparatus
|May 22, 1985
|Jul 21, 1987
|Ricoh Company Ltd.
|Data transfer system
|Dec 1, 1978
|Mar 29, 1988
|Nippon Telegraph & Telephone Public Corp.
|Video/audio information transmission system
|Sep 24, 1991
|Aug 4, 1992
|Canon Kabushiki Kaisha
|Image encoding method
|Jan 31, 1991
|Jan 26, 1993
|Fujitsu Limited
|Modem having speed notifying means
|May 14, 1992
|Jul 19, 1994
|Canon Kabushiki Kaisha
|Image encoding method
|Dec 6, 1993
|Apr 16, 1996
|Xerox Corporation
|Method for converting CCITT compressed data using a balanced tree
|Apr 28, 1994
|Apr 30, 1996
|Avid Technology, Inc.
|System for compensating data rate between a storage device and a data compression processor using a buffer memory mapped twice into contiguous address space of a host processing unit
|Feb 17, 1993
|Oct 8, 1996
|Zenith Electronics Corporation
|Method of processing variable size blocks of data by storing numbers representing size of data blocks in a fifo
|Jul 5, 1994
|Nov 19, 1996
|Avid Technology, Inc.
|Media editing system with adjustable source material compression
|Jun 23, 1997
|Nov 23, 1999
|Seiko Epson Corporation
|Method and system for encoding and decoding data using run prediction
|Jun 24, 1997
|Feb 8, 2000
|Avid Technology, Inc.
|Quantization table adjustment
|Aug 29, 1997
|Apr 25, 2000
|Seiko Epson Corporation
|Data encoding and decoding method and device of a multiple-valued information source
|Jul 10, 1996
|Sep 12, 2000
|Avid Technology, Inc.
|Media composition system with enhanced user interface features
|Jul 17, 2002
|Apr 22, 2003
|Avid Technology, Inc.
|Quantization table adjustment
|Apr 22, 2003
|Feb 3, 2004
|Avid Technology, Inc.
|Quantization table adjustment
|Mar 28, 2002
|Jul 11, 2006
|International Business Machines Corporation
|System and method of automatically determining the dominant periodicity in sequential binary data
|Jul 25, 2008
|May 15, 2012
|Hewlett-Packard Development Company, L.P.
|Encoder and decoder and methods of encoding and decoding sequence information with inserted monitor flags
|Mar 28, 2002
|Oct 2, 2003
|International Business Machines Corporation
|System and method of automatically determining the dominant periodicity in sequential binary data
|Jul 25, 2008
|Jan 29, 2009
|Hewlett-Packard Development Company, L.P.
|Encoder and Decoder and Methods of Encoding and Decoding Sequence Information
|Aug 2, 1979
|Nov 18, 1986
|Kokusai Denshin Denwa Kabushiki Kaisha
|System for coding information change picture elements in facsimile signal
|Dec 11, 2007
|Aug 24, 2010
|Lg Electronics, Inc.
|Method of processing variable size blocks of data by storing numbers representing size of data blocks in a fifo
|May 20, 2009
|Feb 15, 2011
|Lg Electronics, Inc.
|Method of processing variable size blocks of data by storing numbers representing size of data blocks in a fifo
|Sep 8, 1976
|Apr 7, 1977
|Schaltungsanordnung fuer die kompressionscodierung unter verwendung einer korrelation zwischen zweidimensionalen, aus zweiwertigen digitalen bildern abgeleiteten matrizen
|Aug 30, 1989
|Mar 7, 1990
|Canon Kabushiki Kaisha
|Image encoding method
|Aug 30, 1989
|Nov 6, 1991
|Canon Kabushiki Kaisha
|Image encoding method
|U.S. Classification
|382/238, 348/552, 375/240, 382/244
|International Classification
|Cooperative Classification
|European Classification


text:
Search by
Build-a-Valentine Family Art Studio
This event has already taken place. Click here for the latest events.Add to Calendar 09-02-2013 09-02-2013 15 Build-a-Valentine Family Art Studio Make a little art with heart. Join Not Just Art to celebrate the Oyster Bay Valentine's Day Fair. Design your own one-of-a-kind valentine sculptures and projects with a fun and festive buffet of LOVE-ly craft materials. Call to reserve your spot. http://www.nymetroparents.com/2015neweventinfo.cfm?id=127713 Not Just Art true DD/MM/YYYY
If you go: Please tell them you saw this event on
Venue Description:


text:
Call our experts: 888.808.FINE
Custom Stationery from luxury designers!NEW! Wedding Invitations Customize any Address Stamp to match your style!
Select a quantity and printing method. Changes are easily made later.
Host a stylish party for friends and family and use this elegant card as the ideal invitation. This layered card features your personalized text printed on a small white card that is mounted atop a shimmering lagoon back card. The lagoon back card is further accentuated by a black floral design to complete the look.


text:
What Content Reddit Users Are Clicking On
People like to dump Digg, Netscape, and Reddit all in one basket and label then as "social news sites". In reality, however, not all these sites are the same, and not all of then are as news driven as others would have you believe.
When referring to these sites, I prefer the label "social driven sites" or "socially driven news and content sites" because while news is an important part of the content that gets promoted, a lot of the content is from niche oulets and blogs that cannot be classified as news (as much as opinion or just "interesting stuff"). The content here is voted on by the users and is more of what they find interesting or entertaining, and while this content varies from site to site, what is considered as "news" is often left-leaning and sensationlist. Pundits have long been predicting great things for these sites but these content aggregators are far from a reason to not read news-specific sites.
While technology-related articles rule on Digg, politics and breaking news is popular on Netscape, people have had a hard time figuring out Reddit. Here is a look at what content Reddit users are clicking on:
As you can see, Reddit users prefer pictures and images that present a mishmash of news, politics, science, and some totally bizarre content that can best be described as offbeat.


text:
Beef And Bacon Shish Kabobs
|Steak sauce
|1⁄2 Cup (8 tbs)
|Sherry cooking wine
|1⁄4 Cup (4 tbs)
|2 Tablespoon
|Beef sirloin steak
|1 Pound, cut
|Bacon slices
|14 , halved
|1 Large, cut into wedges
|Green bell pepper
|1 Large
|12 Small
In small bowl, blend steak sauce, sherry and honey.
Place beef cubes in nonmetal dish; coat with 1/4 cup steak sauce mixture.
Cover; chill 1 hour, stirring occasionally.
Remove beef cubes from marinade.
Wrap half bacon slice around each cube.
Alternately thread beef and bacon cubes, onion, pepper and mushrooms onto 4 (10-inch) metal skewers.
Grill over medium heat for 8 to 10 minutes or until done, turning and brushing occasionally with reserved steak sauce mixture.
Serve immediately.
Recipe Summary
Rate It
Nutrition Rank
Nutrition Facts
Serving size
Calories 371 Calories from Fat 156
% Daily Value*
Total Fat 17 g26.9%
Saturated Fat 6.9 g34.4%
Trans Fat 0 g
Cholesterol 59.3 mg19.8%
Sodium 574 mg23.9%
Total Carbohydrates 26 g8.8%
Dietary Fiber 2.4 g9.6%
Sugars 18 g
Protein 27 g53.6%
Vitamin A 3.4% Vitamin C 71%
Calcium 5.1% Iron 12.1%
*Based on a 2000 Calorie diet


text:
Excellent budget hotel. Clean rooms and friendly service, close to the airport. Popular among solo travelers.
Hotel Types
- Fine for a budget trip
Guest Review Highlights
- Great location
- Near city centre
- Good access to airport
- Accessible parking
- Best value for money
- Free internet
- Free internet
- Clean rooms
- Great room
- Impressive bathroom


text:
Deviled Cheese
|Cheddar cheese
|8 Ounce, finely grated
|4 Teaspoon
|Curry powder
|3 Teaspoon
|White bread slice
|6 (toasted, buttered and kept hot)
Preheat the grill [broiler] to moderately high.
In a medium sized mixing bowl, mix the cheese, chutney and curry powder together with a fork.
With a knife, spread the mixture on one side of each slice of toast.
Place the toast on the grill [broiler] rack and grill [broil] for 4 minutes or until the mixture is bubbling.
Remove the toast from the heat and serve at once.
Recipe Summary
Rate It
Nutrition Rank
Nutrition Facts
Serving size: Complete recipe
Calories 1287 Calories from Fat 691
% Daily Value*
Total Fat 77 g118.8%
Saturated Fat 48.2 g240.8%
Trans Fat 0 g
Cholesterol 238.2 mg79.4%
Sodium 2171.1 mg90.5%
Total Carbohydrates 76 g25.5%
Dietary Fiber 7.6 g30.5%
Sugars 1.6 g
Protein 66 g132.6%
Vitamin A 59.1% Vitamin C 7.3%
Calcium 170.7% Iron 33.2%
*Based on a 2000 Calorie diet


text:
Photo is NOT the moped helmet wearer from story below.
May 7th City of Marshfield
A 78-year-old landlord came into the Police Department to a report a dispute with one of his tenants. The landlord alleged that, during an argument, the tenant flipped the top of landlord's moped helmet down and walked away. The tenant stated that he did not touch the 78-year-old landlord's moped helmet and that the helmet fell down on its own several times while the two were arguing.
May 9th City of Wisconsin Rapids
A resident called police to report that someone below his apartment was pushing his floor up. The caller also indicated that his upstairs neighbors were pushing his ceiling down.
May 11th City of Sheboygan
Police responded to a report of a man sitting outside of Wendy's, talking to himself and throwing water at passersby.
May 12th City of Marshfield
A man called police and reported his wife was throwing his items into the garbage contrary to a previous agreement made with officers that she would not throw away the man's things. The woman had reportedly thrown out her husband's nozzle.
May 14th City of Sheboygan
A vehicular chase on Kentucky Avenue ended with the driver throwing his hat over a fence.
May 6th Village of Pewaukee
A cleaning crew at the county technical college caught a student security officer in the act of eating two bags of potato chips and drinking a soda.
May 5th City of Delafield
A representative for an area company called police to report the theft of 600 pounds of used cooking oil.
April 25th City of Neenah
A caller reported a female walked out of the grocery store with a cart full of groceries she didn't pay for. The woman then left the groceries sitting in the parking lot and got into a vehicle and left.
April 27th City of Neenah
The principal of a school called police and reported some sort of blue marker was used to write graffiti on different parts of the school. Based on the height of the graffiti, it is likely a fifth-grade student or younger and not gang related.
May 1st City of Neenah
A resident called police about a problem she was having with a robin's nest above her porch light. The birds are attacking her when she goes outside. She has requested assistance from the landlord and stated they are bird lovers so will not help her. An officer assisted in moving the robin's nest to a nearby tree.
May 2nd City of Waukesha
A caller reported that the boy living in a neighboring apartment was yelling "I am going to kill you," and "I am going to stab you in the head." Police talked to the boy and he told them he was saying those things while playing a computer game with his on-line friend — not to anyone in the home. Police advised the boy to have more self-control.
May 7th City of Marshfield
A man told police that a woman threatened to have him incarcerated because he ate at Burger King instead of buying her son a new pair of shoes.


text:
Happy New Year 2013 from all of us at Second City Style. We're taking the day off and will be back on Wednesday!
KAUFMANFRANCO Sequin-embellished Silk-chiffon Gown, $9595See the Top Ten Summer 2016 Trends for Women Over 40
Tags: fashionable new year 2013, Happy New Year 2013, KAUFMANFRANCO Sequin-embellished Silk-chiffon Gown


text:
Ricard "eAgLe" Di Renzo (born August 20th, 1992) is a Canadian Counter-Strike: Global Offensive player who currently plays for OneTap.
Oh, you're one of those awesome people who already has an account on Player.me? Cool, you can just log in below!
Discover a lot in Player.me and start growing your gaming network.
By signing up, you are agreeing to our terms and you have read our privacy policy.
This account is protected by a one-time password. Please enter the code below in order to continue.


text:
Socar of Azerbaijan Pumped Less Oil in First Two Months of 2013Zulfugar Agayev
State Oil Co. of Azerbaijan, or Socar, pumped less crude oil and natural gas in the first two months of the year, reflecting a slump in total Azeri output.
Oil output at the national energy producer fell 1.2 percent from a year earlier to 1.35 million metric tons, the company said today on its website, without giving a reason for the drop. Gas output retreated 2.8 percent to 1.12 billion cubic meters.
Total oil volumes from the Caspian Sea nation, the largest crude producer in the former Soviet Union after Russia and Kazakhstan, fell 3.6 percent in the period, while output of marketable gas shrank 5 percent, the State Statistics Committee said March 15. Production also declined in 2012 and 2011.
Socar First Vice President Xosbaxt Yusifzada said last year that production had dropped because of aging wells. The Baku-based company holds a stake in BP Plc's Azeri-Chirag-Guneshli oilfield, which cut production 7 percent in 2012.


text:
Alumnae Library
Debra Gomes
Associate Director & Head of Library Technology
A Guide for Survival in the Information Jungle
Export Bibliography | Insert Bibliography | Word 2003 Version| Word 2007 Version | Parenthetical Reference
This page gives step-by-step directions to export the bibliography or list. Use the Related Links on the right to view directions for other sections in the NoodleBib program.
Copy & Paste
Insert the Bibliography Using "Insert File" into the Paper - Office 2003 Version
Insert the Bibliography Using "Insert File" into the Paper - Office 2007 Version
We are a private Catholic coeducational liberal arts college founded in 1928 by the Sisters of St. Joseph of Springfield, Massachusetts. Elms College is located in Chicopee, Massachusetts, and grants associate's, bachelor's, master's, and doctoral degrees.


text:
Carl Joseph Duplantis Jr., 48, a native of Bayou Cane and a resident of Raceland, passed away at 7:45 p.m., Friday, August 3, 2012 after a 5 year battle with multiple meloma.
Visitation will be held at Samart-Mothe Funeral Home of Raceland on August 7, 2012, from 5 p.m. until 9 p.m., and at St. Mary's Nativity Church in Raceland on August 8, from 9:30 a.m. until funeral time.
Funeral services will be held at St. Mary's Nativity Church, at 11 a.m., with burial following in St. Mary's Cemetery in Raceland.
He is survived by his wife, Renee Reynolds Duplantis; daughter, Carlie Renee; son, Charles Duplantis; mother, Margie Kinney Duplantis; two brothers, Cody John Duplantis and his wife, Linda, and Casey Duplantis and his fiancée, Jessica Lalumia; and his niece (Casey's daughter) Kate Elizabeth Duplantis. He is also survived by Phillip and Deneen Naquin; his "little sister" Heidi Cortez; Kye Duet and wife, Lisa; he was "Uncle Fun" to Dennis and Kamilla Rogers; Marci and fiancé, Louis Shawn; Phillip "Bud" Naquin; Kasie "BoBasie" Cortez; Kyelee and Keelie Duet; and great niece, Kallie Rogers. He was the son-in-law of M. David and Pat Duet.
Mr. Duplantis was preceded in death by his father, Carl "Magoo" Duplantis; grandparents, Patsy and Margarette Kenney; and Wilber Sr. and Adele Duplantis.
Carl worked at KWBJ television in Morgan City. He was an avid Saints fan and will be greatly missed.
Family and friends are invited to celebrate his life as a great son, brother, husband, father and friend.
(Paid Obituary)
- Log in to post comments


text:
Is The Design Store incorrect or missing key business information? Update your Hotfrog listing today.
Contact details
Are these details correct?
Opening hours
Payment options
MasterCard, American Express, Cash, Invoice, PayPal, Cheque, Finance, Insurance, ATM / Debit, Traveler's Checks, Discover
Products & services
Furniture - living and dining suites, Sofas & Dining Room Table, NZ Made Furniture, Homewares, Design Store Read more
Is The Design Store in 61 Silverdale Street, Silverdale Auckland 0932 your business? Claim your listing and attract more leads by adding more content, photos and other business details.
We have more Homewares services in Silverdale Auckland available on Hotfrog NewZealand. You can update your search for Silverdale Homewares by location, keyword or service options.
2157 East Coast Road Silverdale Auckland
PO Box 109 Silverdale Auckland
33 Anvil Road Silverdale Auckland 0932
38 Forge Road Silverdale Auckland 0932
Small Business Hub
Sharing tips, ideas and advice to help grow your small business.
Your profile without ads
Have you considered upgrading to Hotfrog AdVantage? No competitor advertising means exclusive focus on your business. You take centre stage.
Create your free Hotfrog business profile
Follow Hotfrog on:
Share on:
Hotfrog Small Business Hub


text:
I am very excited that we have a "blessed" package management story with NuGet. And this week I found a cool thing you can do with it and Windows Live Mesh (formerly Windows Live Sync).
As Phil Haack describes in this post NuGet supports package sources (what some call "repositories" or "feeds") that are hosted in at some http:// URL or simply a folder on a local drive or file share.
The hosted feed is great if you want to publically share packages, but what if you simply need to have your custom set of packages available on all your machines – especially if those machines are not always in the same network? To illustrate this scenario imagine I want my special FOOBAR package available on on my dev boxes at home, at work, and roaming.
The solution is simple: Use Windows Live Mesh!
In my existing windows live mesh folder I simply created a folder called "nuget-feed" somewhere in my live-mesh file synchronization path and copied my private packages there along with the NuGet.exe (you can get this command line tool from here)
Of course now Windows Live Mesh is now synchronizing this folder across all my machines.
So, to use this package I open the Package Manger console and change the settings to add this new location. Note: This has to be done on each machine, of course.
And after adding, it I can select it and find and install any of the packages from my private feed across all my machines. that are synchronized my Live Mesh.


text:
List the categories that are peer (i.e. share the same category parent) to all lowest-level assigned categories for the specified post.
If an assigned category is the parent for one or more other assigned categories for the post, then the category parent is not included in the listing. Only peers to the lowest-level assigned categories are considered.
Requires: 3.6 or higher
Compatible up to: 4.7.2
Last Updated: 9 hours ago
Active Installs: 100+
Got something to say? Need help?


text:
When it comes to grip, speed and braking, driving a car fully set up for racing is a completely different experience to driving a road car.
Even a high performance road car does not have the same feel or handling power that a fully prepared race car effortlessly delivers.
Hire one of Trackschools fully prepared racing cars and you will appreciate the difference first hand at every turn of every corner as well as on the straight.
With our cars starting at $695 per person at our own track days, we believe this is fantastic value for money. This price includes a Professional Instructor sitting beside you and 5 sessions of drive time. We can customise a package or car to suit your needs and budget. Contact us for more information.
We have 3 x MX5s in our fleet. These cars are super fun, light weight race cars. Make no mistake, these cars are fitted with huge aftermarket brakes, roll cages, after market coil over suspension, race seats, harnesses, sticky Hankook race tyres, are extremely popular, and are perfect for a track day. These are great value for money at $695 per day.
You can use your own car, or one of our track prepared race cars. Our 1-1 Tuition days are a relaxed way of giving you a full day of qualtiy driver training. These days are for first timers, to experienced track racers.


text:
Jan 19, 2017
Don't wait for federal arts funding to come under attack—take action with us now! Sign our Arts Action Fund pro-arts petition to the President, then ask five friends to sign too. The arts are worth fighting for!
Jump to navigation
Stimulating Local, State, and Federal Advocacy for the Arts
Action-Oriented Research to Make a Case for the Arts
Building Stronger Communities Through the Arts One Person at a Time
Forging Strategic Alliances that Propel the Arts Forward as a Solution
Offering Programs and Initiatives to Help You in Your Work as an Arts Leader
Focusing in on Topics of Interest to Provide Facts and Links to Resources
Shining the Spotlight on Arts Programs and Advocacy Work in States Across America
Six short weeks ago, the Americans for the Arts Arts Education Advisory Council met in Washington, DC to discuss trends in arts education, brainstorm how to be change agents in our...
Arts marketers, have you ever experimented with so-called "dark posts" on Facebook? A dark post (also called an unpublished post) is a post that doesn't show up on your page but can be promoted through an advertising campaign.
Dark posts can be really handy when...
As a young theater artist, I could always be counted on to step up and make a passionate plea when arts funding was on the line. I shared stories about myself and my colleagues with my legislators about how the arts are fundamental to our humanity. I wrote about how the arts ennoble and inspire...
Americans for the Arts is proud to announce the complete pARTnership Movement essay series, featuring case studies that profile successful business-arts relationships and illustrate eight reasons businesses partner with the arts.
On Wednesday, February 15, Americans for the Arts' president and CEO Robert L. Lynch was awarded the JFK Commonwealth Award at the 2017 Commonwealth Awards at the Massachusetts State House in Boston. The inaugural award recognizes Lynch's long career as an arts leader, champion, and ambassador.
Using funds slated for holiday gift baskets for clients and partners, Situation Interactive, a digital advertising agency, invested in world-class arts and culture experiences for Bronx middle schoolers. Their investments in arts experiences in high performing, arts-deficient schools pay dividends for their community and for their company.
Christin Crampton Day brings 30 years of professional experience in both the for-profit and nonprofit sectors, as well as a strong background in communications, fundraising, management, and strategic planning, to her new role as Executive Director of CBCA.
ASC announced the new grant in August 2015 in response to the Charlotte-Mecklenburg community's interest in arts, science, history, and heritage programming, and a desire to experience more community-focused and innovative cultural programs.
A response to start-up culture around the country and in St. Louis, the competition is open to individuals in the 16-county bi-state region with an idea on how to use the arts to address a community need or challenge.
The Hall of Fame Award, selected by the BCA Executive Board, recognizes companies for their exceptional leadership, vision and long-term commitment to supporting the arts.
Every year, Americans for the Arts, through its Business Committee for the Arts program, recognizes 10 businesses of all sizes for their exceptional involvement with the arts that enriches the workplace and the community.
The Leadership Award was established by the Business Committee for the Arts to recognize individuals whose vision, commitment and leadership champion the arts.
Americans for the Arts presents the 29th Annual Nancy Hanks Lecture on Arts and Public Policy on Monday, March 7, 2016 at 7:30 p.m. at the Eisenhower Theater of the John F. Kennedy Center for the Performing Arts.
Americans for the Arts presents the 29th Annual Nancy Hanks Lecture on Arts and Public Policy on Monday, March 7, 2016 at 7:30 p.m. at the Eisenhower Theater of the John F. Kennedy Center for the Performing Arts.
For more than 150 years, U.S. Bank has provided funds to help organizations throughout the United States build audiences for the arts, particularly among underserved communities.
The Leadership Award was established by the Business Committee for the Arts to recognize individuals whose vision, commitment and leadership champion the arts.
Advocate for the Arts in DC - March 7-8, 2016. Register Today!
Americans for the Arts serves, advances, and leads the network of organizations and individuals who cultivate, promote, sustain, and support the arts in America. Founded in 1960, Americans for the Arts is the nation's leading nonprofit organization for advancing the arts and arts education.


text:
In 10.5, context menus have rounded corners. We should have the same.
I believe bug 307204 is required for us to be able to do this. Not 100% sure.
I don't want to "fake" that stuff with translucent windows. The rounded corners should be a window API option in 10.5, a switch we can flip. If that isn't the case we need to file an urgent bug with Apple to fix that.
Removing the dependency until we're sure these two are tied together.
filed a request for rounded corners on NSWindow as rdar://problem/5430472
Got a response from Apple in the bug:
We need to set the window to transparent, and then use HITHemeDrawMenuBackround to draw the background, with kThemeMenuTypePopUp as the menuType param for the MenuDrawInfo.
Should be a piece of cake.
Adding CGContextClearRect() (which is what Apple suggested we use) in NS_THEME_MENUPOP and NS_THEME_MENUITEM seemed to do *something* on my 10.4 machine (added additional transparency). Tried it earlier today while sheriffing.
*** Bug 391985 has been marked as a duplicate of this bug. ***
Created attachment 283096 [details]
screenshot 1
With the window set to .95 opacity following the steps in comments 4 and 5 leads to this (screenshot).
josh do you want to take back this bug, per our discussion a few days ago?
With all the work we've done to on controls it would be a shame if this bug got lost in the shuffle.
Nominating for blocking so we don't forget about it (p5 would be an appropriate priority, imo)
I assume this will also take care of the blurring that appears to go on behind menus on leopard? how about the fading out of menus as they close?
(In reply to comment #10)
> I assume this will also take care of the blurring that appears to go on behind
> menus on leopard? how about the fading out of menus as they close?
Probably to the first, no to the second.
Filed bug 406997 for the second.
This is a purely aesthetic issue and not a regression. blocking1.9-
*** Bug 414498 has been marked as a duplicate of this bug. ***
Any update on the status of the radar bug? I tried the steps in comment #4 and comment #5 on 10.5.2, but no rounded corners :-/
I can't imagine blocking on this but we want it for sure.
I'll work on this when bug 418454 lands (it changes some stuff about frame transparency).
Created attachment 334362 [details] [diff] [review]
WIP fix v0.1: Ask nsITheme if a themed frame is transparent, make the rounded corners draw inside the frame
This patch is on top of those in bug 450939 and bug 450944.
I haven't tested in on 10.4 yet, it might mess things up.
The patch works on 10.4, too. Even there, HIThemeDrawMenuBackground draws outside the frame (i.e. the drawn rect extends 4px above and below the requested rect).
Do we really want it on 10.4?
The patch doesn't result in rounded corners on 10.4, HIThemeDrawMenuBackground does its job quite well. :-)
In comment 19 I meant to say that it doesn't break 10.4, i.e. it doesn't change the context menu's size there, although we make the drawRect smaller.
(In reply to comment #10)
> I assume this will also take care of the blurring that appears to go on behind
> menus on leopard?
It won't. And there's no way of doing that without using private, undocumented methods. :-(
Created attachment 343058 [details] [diff] [review]
patch v1
Comment on attachment 343058 [details] [diff] [review]
patch v1
+ if (aTransparencyMode)
+ *aTransparencyMode = theme->GetWidgetTransparency(aDisp->mAppearance);
braces arond this non-control-flow statement
Comment on attachment 343058 [details] [diff] [review]
patch v1
This patch isn't ready. :(
I just tested it again and noticed that it eats the shadow of XUL popup menus...
(In reply to comment #22)
> (In reply to comment #10)
> > I assume this will also take care of the blurring that appeas to go on behind
> > menus on leopard?
> It won't. And there's no way of doing that without using private, undocumented
> methods. :-(
If aero glass was possible, maybe this is possible too ? As i look at latest iTerm.app code (with has abbility to set blur for transparent background) in cocoa you need only set prepared window filter with blur radious.
Created attachment 349939 [details] [diff] [review]
fix shadow bug
For some reason, mIsTransparent isn't set correctly on the view. I need to find out why that's the case, but for now this patch works.
(In reply to comment #26)
iTerm.app uses CGSAddWindowFilter; that's the private function I was referring to.
pushed: http://hg.mozilla.org/mozilla-central/rev/58f409bbc149
Comment on attachment 349939 [details] [diff] [review]
fix shadow bug
pushed to mozilla-1.9.1:
Verified fix on Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.5; en-US; rv:1.9.1b3pre) Gecko/20090129 Shiretoko/3.1b3pre Ubiquity/0.1.5
Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.5; en-US; rv:1.9.2a1pre) Gecko/20090129 Minefield/3.2a1pre
10.4 builds still show square corners as expected.
Mozilla/5.0 (Macintosh; U; PPC Mac OS X 10.5; en-US; rv:1.9.2a1pre) Gecko/20090218 Minefield/3.2a1pre
My PPC machines have square corners under Leopard.
This bug's priority relative to the set of other polish bugs is:
P2 - Polish issue that is in a secondary interface, occasionally encountered, and is easily identifiable.
Context menus are a secondary interface, however this issue was widely reported on OS X as a polish problem.


text:
Issue: : URGENT MESSAGES
Thoughts: : Hello Barack OBAMA
Which ever of the above scenarios is used for announcing the existence of
extraterrestrial life or technology, President Obama will figure prominently.
Behind the scenes, powerful institutions are ensuring that nothing derails the
planned disclosure announcement. The disclosure will follow upon a year of
greater govern...ment openness on UFOs in accord with a policy secretly developed
at the United Nations. If extraterrestrial disclosure does occur at the end of
2009 or early 2010, President Obama will lead an unprecedented effort to promote
global governance through the United Nations. The Obama administration and its
supporters are poised to take a bold step forward in helping our planet become
an interplanetary culture that openly deals with the challenges posed by
extraterrestrial life.
Your oliver kronshage
Visitor Ip: 126.96.36.199