text: Do want bacon comp 1 Flag By: ilovetehcheezeburg (More by author: Most viewed, Newest, Most Thumbs) previous next random - Fav + Fav Comment Bacon make the world go round. Tags: Bacon | comp | do | want | funny Recommend tagsx +9 Views: 538 Favorited: 0 Submitted: 11/04/2011 Share On Facebook Remove from favorites Add to favorites Unsubscribe from ilovetehcheezeburg Subscribe to ilovetehcheezeburg So I see you're using adblock. This site costs a lot of money and time to run. It's also in danger of shutting down since everyone uses adblock and ads used to pay the bills. You can donate here or just post some content so we get new visitors from google (who don't use adblock).


text:
You are currently browsing comments. If you would like to return to the full story, you can read the full entry here: "What All Big Gov't Types Have In Common".
6 thoughts on "What All Big Gov't Types Have In Common"
Jan Brown
"It is hardly too strong to say that the Constitution was made to guard the people against the danger of good intentions. There are men of all ages who meant to govern well but they do intend to govern. They promise to be good master, but (they mean to be masters)" said Daniel Webster..
L.E. Liesner
To expand on Jefferson's statement, just how many Presidents, Congressmen, and Senators have we elected that should not be trusted to govern their own lives but we trust them to govern ours? Politics has become a big business and it's primary goal is fleecing the people they govern. When we do get a politician that believes in the Constitution, the other elected politicians and the MSM do their damnest to destroy him. Our government today is an upside down, backward organization of self serving corrupt fools. But, smart enough fools to fool a great majority of the people they are suppose to govern.

subset: commoncrawl


text:
Shop now and get Free Value Shipping on most orders over $49 to the contiguous 48 states, DC and to all U.S. Military APO/FPO/DPO addresses.
We want to ensure that making a return is as easy and hassle-free as possible! If for any reason you decide that your purchase just isn't for you, simply return the item within 30 days of receipt and we'll cover the cost of return shipping. Learn more about our Return Policy.
Fobus Taurus 24/7 Pro Belt Holster RU97BH is an efficient holster that will allow you to carry your handgun with comfort and without detection. These concealed holsters are designed with a low profile, barely betraying the fact that you're carrying a handgun on your belt. Fobus has built the Fobus Ruger 90 Concealed Belt Holster with a passive retention system near the trigger guard that allows you to draw your weapon without having to fumble with a thumb break. The passive retention of the Fobus holster enables you to present your handgun without worrying about the safety of the gun in the holster. These durable belt holsters are able to accommodate the Ruger 90 and 93, CZ P01, the Taurus 24/7 and 24/7 Pro Millennium. Keep your weapon safe, concealed, and at the ready with the Fobus Concealable Taurus 24/7 Belt Holster.
Connect with OpticsPlanet
Become our fan, follow us, & subscribe for the latest updates and deals
Subscribe to our email list
Sign up and receive $5 Off and get exclusive access to promotions, sales
events, pre-order sales & more!
Contact Information
Toll-Free: 800-504-5897
Intl.: 847-513-6201
Fax: 847-919-3003
Email: firstname.lastname@example.com
Hours of Operation
7AM-8PM CST Mon-Fri9AM-5PM CST Sat-Sun
Our Guarantees


text:
Loading stream...
Now Playing
Connect with Us
People of Northwest Public Radio
Morning Edition Host & Producer
Classical Music Host
Classical Music Host
All Things Considered Host & Producer
Inland Folk Host, Editor & Producer
Station Manager
Assistant Manager of Programming and Operations
News Director
Weekend Edition Host
Music Coordinator
Classical Music Host
Wait Wait...Don't Tell Me!
3:11 pm
Fri July 13, 2012
Who's Carl This Time?
By editor
Originally published on Sat July 14, 2012 9:10 am
Carl reads three quotes from the week's news: A Chilly Reception, Tour de Courtroom, and An Amicable Split.


text:
Strapless Style
Innovation has come to the industry in the form of a new type of pool cover that eschews the traditional grid of straps across the width of the cover in favor of a welded single-piece design. This makes the cover more aesthetically pleasing to customers, says Bob Hotaling, inventor of the cover and president of Pen-Fabricators, Emigsville, Pa., and also lighter in weight and easier to maintain.
Most new products result from an inventor's dissatisfaction with the conventional version. Hotaling says he noticed that standing water on traditional covers had a tendency to leach through the sewn webbing and into the pool. "In addition, that wet webbing is heavy, and over time it can develop rotted threads — these are the threads that hold the webbing to the cover itself. If they rot they have to be repaired."
So Hotaling came up with the idea of welding the entire product — webbing and cover — together using the same radio frequency welding technology that fuses pool liners. In this case, it vulcanizes the strap material to the cover, fusing it into one piece.
"The cover does have straps," he adds, "just not the grid all over the cover above and below. In that traditional cover, they need the straps to go all the way across the pool to keep the overall integrity of the cover. In this case, by welding everything together, including the straps, it becomes all one piece. And it's much lighter in weight because the cover doesn't have all this criss-crossed webbing, which, once it gets wet, doubles or triples in weight. These new covers are impervious to water, and there's no webbing to hold water."
It's the first cover of its kind in the industry, Hotaling says, and the company has applied for a patent. It was introduced into a test market in late 2009, then expanded in 2010.
Jim Titus, an installer at Arnold Pools in Maryland, has tried the new cover and says his customers have been satisfied so far; they like the way it looks and Titus appreciates that "it's a little easier to put on and easier to line up. On the regular covers, sometimes the woven material comes apart on the cover over time. But the way they've made this, it's all made right into the cover."
Scott Webb has been with AQUA magazine in one capacity or another since April 2001; he now serves as executive editor. Scott has a degree from University of Cincinnati in Aerospace Engineering and lives in Madison, Wisc.
Features: covers, winter covers, safety covers
Absolutely love the idea that there's no strapping showing. I presume that since the cover has the straps infused into the cover, that it will have the proper ASTM rating to be a "certified safe" safety cover?
Brian Lane
And this is different from Anchor's Industry's solid covers with springs how?
Scott Bair
So, I have installed so many Anchor 5-Star covers that this looks like, I can't count them,And so now I rep for Anchor and I know this is just another knock off, a replica, a copy, surely not an invention. And notice he is not showing the needed cover pump.
Rich Westerwelle
I completely agree with the opening statement of this article..."Innovation has come to the industry". However, the article is unfortunately incorrect with regards to the timing and the company responsible for that innovation. Anchor Industries has been manufacturing safety pool covers using the "welded" technique described in this article as a "new type of pool cover" for over 35 years.
The article does accurately describe the significant benefits of this type pool cover. Anchor has manufactured thousands of covers using this technology. The Anchor "Five Star" and "Classic Solid" have been a great success and proven performers for many years.
Tim Lillpop
I've been ordering Anchor's classic solid welded covers for over 26 years! We also do a good bit of Anchor mesh covers as well.
Linda Wright
This cover is different because it uses springs not bungie cords. And in the install I saw there were like 5 or 6 anchor points eliminated replacing an old style cover on a kidney pool. They have this batwing thing that spreads the load. So springs vs. bungie cords and less install time and less anchors = savings.
Bryan Todd
Anchor's Five Star cover uses springs
Finding Your Niche — And Branding It
Thanks for sharing. So often, as a trade, we look at the $ and not the sense. Treating a customer or client like you would like to be treated is …
Finding Your Niche — And Branding It
Great article. It's so important to look at your own company and see what you are and what you're not. I think to take that further you should know who …
A Better Way to Sell More Inground Pools
Nice advertisement for Direct Mail company... not much else.
World Class Aquatic Center Nears Completion
Trinidad and Tobago will soon have a world-class aquatic facility.
2015 Spa Steps, Surrounds and Enclosures
The portable spa itself is step one. Step two: accessories. Check out our roundup of stairs, surrounds, gazebos and more. Sometimes, it's not just what's in the hot tub, but what's around it that makes all the difference.
Why You Need a Responsive Website
Desktop. Phone. Tablet. In a world where mobile is the new standard, your website needs to work equally well across all devices to attract new customers. Here, a marketing expert shares her advice.
© AQUA Magazine 2015 All Rights Reserved


text:
Jack Wilson is an impeccable Criminal Lawyer. He is very knowledgeable about the law and kept me informed at... more
Nick and his partners were great to work with. They were quick to respond to any questions that I had and... more
Jason law firm make you feel good about yourselffrom the day I met him he made me feel so good and I knew I... more
Maria helped me with the Naturalization Application and the Interview. She is very knowledgeable and guided... more
Continuous efforts produced the end results we needed. Thanks so much Brian, you made a stressful time alot... more
My home is set for foreclosure and I have seen several "lawyers" in Dallas. I say "lawyers" because all... more
I lost my job and missed a few payments on my car. They came and repossessed it and I thought it was gone... more
All the people at this office are very nice and helpful. I met with Jason and another attorney. 2 attorneys... more
The history of Dallas Love Field airport is rockier than its name suggests. In 1964, city officials decided to shift operations at Love Field to the planned Dallas-Fort Worth International. DFW opened in 1973, but Southwest Airlines refused to move. Southwest had begun operations at Love Field in 1971, and argued that they never agreed to move.
The Supreme Court agreed, ruling that Southwest could do business at Love Field as long as it remained an airport. Congress, however, soon passed the Wright Amendment, a law that restricted passenger traffic out of Love Field. The law was conditionally repealed in 2006, and all restrictions on Love Field expire in October 2014.


text:
A self-emulsifying domestic laundry fabric active softener base comprised of N-methyl, N,N-di-( beta -C14 - C18-acyloxy ethyl), N- beta -hydroxy ethyl ammonium metho sulfate characterized by good softening, outstanding whiteness-retention and excellent rewetting properties and has a light color having an index on the Gardner scale in the range of about 1 to 2. The active softener base is dispersed in an inert vehicle such as isopropanol and/or water and may be intermixed with other additives, such as perfumes, nonionic wetting agents, optical brighteners, etc.
Claims available in
Description (OCR text may contain errors)
United States Patent 1191 Kang et a1.
[ DOMESTIC LAUNDRY FABRIC SOFTENER [73] Assignee: Stepan Chemical Company,
Northfield, I11.
221 Filed: Apr. 24, 1973 21 Appl. No.: 353,981
[52] US. Cl 252/8.8; 260/402.5 [51] Int. Cl. D06M 13/00; D06M 15/00 [58] Field of Search 252/8.8, 8.75; 260/404, 260/567.6 R, 402.5
[56] References Cited UNITED STATES PATENTS 3,178,366 4/1965 DuBrow 252/8.8 3,223,718 12/1965 Scherr 260/404 3,325,404 6/1967 Cohen 252/8.8 3,503,890 3/1970 Davisson..... 260/567.6 R
3,537,993 11/1970 Coward 252/8.75 3,697,423 10/1972 Sundby 252/8.8
11/1973 Berg ..252/8.8 3/1974 Wixon ..25Z/8.75
OTHER PUBLICATIONS Chemistry & Industry, July 5, 1969, pp. 893903.
Primary Examiner-Benjamin R. Padgett Assistant Examiner-Donald P. Walsh Attorney, Agent, or Firm-Hill, Gross, Simpson, Van Santen, Steadman, Chiara & Simpson [57] ABSTRACT A self-emulsifying domestic laundry fabric active softener base comprised of N-methyl, N,N-di-(B-C C acyloxy ethyl), N-B-hydroxy ethyl ammonium metho sulfate characterized by good softening, outstanding whiteness-retention and excellent rewetting properties and has a light color having an index on the Gardner scale in the range of about 1 to 2. The active softener base is dispersed in an inert vehicle such as isopropanol and/or water and may be intermixed with other additives, such as perfumes, nonionic wetting agents, optical brighteners, etc.
9 Claims, N0 Drawings DOMESTIC LAUNDRY FABRIC SOFTENER BACKGROUND OF THE INVENTION 1. Field of the Invention The invention relates to fabric softeners and more particularly to light colored self-emulsifying domestic laundry fabric softeners which exhibit excellent rewetting and whiteness-retention characteristics.
2. Prior Art A large number of domestic laundry fabric softeners which generally include cationic quaternary compounds are known, and reference is made to W. P. Evans, Cationic Fabric Softeners", Vol. 5, Chemistry and Industry, July 1969, pages 893-903 for a general discussion thereof. Repeated use of such quaternary softeners tends to discolor or yellow fabrics, causing user dissatisfaction. This yellowing characteristic is particularly noticeable when the fabrics are laundered with nonionic detergents at high pH levels. A nonionic containing detergent composition built with sodium carbonate is an example of a detergent material which tends to produce severe yellowing. Further, repeated use of at least certain known softeners tend to waterproof fabrics causing laundering difficulties.
Laundry-related products, especially those which are intended for domestic use, are judged by consumers for effectiveness on the basis of various factors, including the color of the product. A consumer generally assumes that if a product has a light color, it will be less vlikely to yellow clothes. A light colored product is generally equated with white colored fabrics after washing. Softeners having a white color, as opposed to a creamy or yellowish color are not readily available. Some manufacturers have either attempted to convince consumers that blue or green colored products are desirable as white products but in fact have incorporated coloring agents, bleaches, dyes, optical brighteners to mask less appealing creamy or yellowish colors. The consumers have generally resisted accepting offwhite products and the addition of various coloring agents have, at best, only achieved an approximation of the desired whiteness and merely increased the cost of the ultimate product.
7 Prior art workers have suggested that various surfactants of the general class comprising condensation products of alkylol amines and higher fatty acids quaternized with various quaternization reagents, such as dimethyl sulfate, diethyl sulfate, methyl chloride, etc., have some softening properties and that such surfactants may be capable of functioning either as commercial textile lubricants or as domestic softening agents. However, such surfactants either do not perform as expected, discolor fabrics, lessen rewetting of the fabrics, require various additives for successful domestic applications or are themselves of a color unappealing to domestic users.
SUMMARY OF THE INVENTION The invention provides an economical self-emulsify ing domestic laundry fabric softener which does not discolor fabrics or prevent rewetting thereof with repeated use and which is characterized by a clean light color.
it is a novel feature of the invention to provide -a selfemulsifying domestic laundry fabric softener agent comprised of a mixture of N-alkyl-N,N-di(,B-C C -acyloxy ethyl), N-fi-hydroxy ethyl quaternary ammonium compounds and an inert vehicle thereof; which agent is characterized by a light color having an index on the Gardner scale in the range of about 1 to 2.
The domestic laundry fabric softeners-of the invention are characterized by excellent fabric softening properties, excellent whiteness-retention(non-yellowing) properties, outstanding rewetting characteristics and are of a consumer-appealing light color. The light color of the instant softeners should be differentiated from the whiteness and non-yellowing property imparted to the laundered fabrics with which suchsofteners are used.
The rewetting characteristics of the fabric softeners of the invention allow fabrics treated thereby to be easily rewetted with aqueous solutions, such as encountered in domestic laundering operation. Conventional softeners are generally combined with various rewetting agents to prevent waterproofing" softener treated fabrics. The softeners of the invention do not require any rewetting agents and exhibit improved rewetting characteristics over conventional fabric softening formulations which include rewetting agents. Further, the fabric softeners of the invention are self-emulsifying and require no auxiliary emulsifying agents, such as conventional nonionic surface-active agents. Studies have shown that while active softeners of the invention are compatible with nonionics, generally insufficient benefits result for economical justification to include nonionics in softeners formulations utilizing the active softener of the invention.
The light color characteristic of the softeners of the invention render formulations based thereon appealing to consumers. While a dark color of a softener does not necessarily indicate that it is inefficient or will discolor fabrics, nevertheless, consumers prefer light color softeners for domestic laundry usage.
The fabric softeners of the invention are prepared from a C C fatty acid alkyl ester mixture, preferably methyl esters. These fatty methyl ester mixtures are staple articles of commerce and their synthesis is well known so that no further explanation thereof is required. In the preferred embodiments, the softeners of the invention is formed from 2 molecules of the above fatty acid alkyl ester mixture, which for practical purposes is a mixture of oleic, palmitic, stearic acid alkyl esters, along with minor amounts of other fatty material constituents. Generally, these materials are hydrophobic, especially the saturated entities and require the addition of hydrophilic groups thereto for effective use in aqueous systems. Quite unexpectedly it was found that two molecules of a C C fatty ester mixture, (which is primarily comprised of oleic, palmitic, and stearic acid methyl esters) when combined with triethanolamine and quaternized yield a product which is very light colored, is a good softener, and exhibits excellent whiteness-retention and rewetting properties.
The self-emulsifying fabric softeners of the invention form stable suspensions over a wide temperature range and can be diluted as desired without phase separation or the like. The active softener of the invention is, in undiluted form, a somewhat viscous gel or solidlike mass which is not readily handleable and must be combined with minor amounts of an inert vehicle for either fabric base formulation or for domestic formulation.
For a fabric base formulation (after synthesis and prior to packaging for consumer usage), any C -C aliphatic alcohol, C C aliphatic glycol, C, C aliphatic alcohol alkali sulfate, urea, alkyl benzene alkali sulfonates, water, other similar hydrotropic agents and mixtures thereof provide a suitable vehicle. Although from a point of economic availabillity, lack of disagreeable odors, compatibility with laundering environments, etc., water, isopropanol and mixtures thereof are preferred. For consumer or domestic formulations, water is a preferred vehicle for obvious reasons and any amount of water can be intermixed with the fabric base formulation. For a fabric base formulation one of the enumerated organic vehicles, such as isopropanol is preferred since a relatively concentrated formulation is preferred.
In preparing softener base formulations which include the active softener of the invention, it has been noted that a ratio of active softener to vehicle of about 3:] provides a practical solution. Larger amounts of vehicle and/or softener may be utilized, but as a practical matter a mixture of about 75% by weight of softener and about 25% of vehicle, such as isopropanol, is preferred.
In preparing softener formulations for domestic use, a ratio of active softener to vehicle of about l: or provides a practical solution in the retail sales field. Again, larger amounts of vehicle and/or softener may be utilized, but as a practical matter about 0.l% by weight active fabric softener based on weight of fabrics is sufficient in actual wash machine use. Generally, a mixture of about 6% to 8% by weight of softener and about 92% to 94% by weight of vehicle is often sold in the market place. As indicated earlier, preferred vehicles include isopropanol, water and mixtures thereof.
The active softener of the invention is, in its solidified form, an attractive clean, light color, which on the Gardner scale has a color index of about 1 to 2. As will be understood by workers in the art, the Gardner scale here referred to is based on a Gardner-I-Iellige colorimeter. The Gardner color scale is a designated scale to aid one in subjectively determining the color of a given substance. It ranges in value from I to 18 in designating light to dark colors. The softeners of the invention have a milky-white color in 6% to 8% formulations, which comprise the typical domestic consumer formulations. The Gardner color scale is not directly usable on such consumer formulations since they are emulsions as contrasted to clear solutions. However, the softeners of the invention are readily placed in clear solution by intermixing a fairly small amount (i.e. about by weight) of an organic vehicle, such as isopropanol or ethanol with a fairly large amount (i.e. about 75% by weight) of the active softener and heating the resultant mixture to about C. whereupon the solution becomes clear and is suitable for color comparison on the Gardner scale. Accordingly, the term color index on the Gardner scale as utilized herein and in the claims will be understood to refer to the value attained when a clear solution containing about 75% solids in about 25% isopropanol or the like is read at about 55C. It should also be pointed out that a clear solution of a material may have a Gardner scale index of 8 or 9 and be of a brown color. The active softener of the invention has a Gardner color index of about 1 to 2 and, in a clear solution, has the appearance of a water-white solution but in an emulsified formulation has the appearance of a milky-white solution. If desired, the Gardner scale 4 color index can be fairly accurately translated to other color scale systems.
The fabric softeners of the invention generally comprise the reaction products of a purified C C fatty acid alkyl ester mixture, triethanolamine and a quaternizing reagent, preferably dimethyl sulfate. The select fatty acid alkyl esters are preferably a mixture of substantial amounts of methyl esters of stearic, palmitic, myristic and oleic and may include minor amounts of other fatty substances.
Through extensive studies, it has been found that care must be utilized in selecting a particular fatty acid alkyl ester mixture if one is to attain a clean light colored product, a functional fabric softener and a product which exhibits excellent rewetting and whitenessretention (non-yellowing) properties. Crude or insufficiently purified fatty acid alkyl esters, when reacted with triethanolamine and a quaternizing agent, yield dark colored products which are not appealing to consumers. A convenient test for determining whether a select fatty acid alkyl ester mixture is of suitable purity for use in synthesizing the softener of the invention, is to briefly shake a sample of the select fatty esters with a small amount of sodium methoxide methanol solution and observe the resulting color. If the resulting solution turns reddish-brown or brown within about 10 minutes at room temperature, it indicates that the fatty esters contain minute amounts of matter which will discolor the ultimately formed softener. On the other hand, if the resultant solution remains water-white or pale yellow, it indicates that the ester mixture is of sufficient purity and that the ultimately formed softener will have a white color index on the Gardner scale of about I to 2.
Attention is also directed to the fact that a select pure fatty acid alkyl ester generally does not yield commercially acceptable softener products. Studies were conducted on the reaction products of substantially pure oleic methyl ester, triethanolamine and dimethyl sulfate and such oleic-based products failed to exhibit good fabric softening characteristics. Similar studies were conducted on the reaction products of substantially pure stearic methyl ester, triethanolamine and dimethyl sulfate and such stearic-based products failed to exhibit good emulsification characteristics. In contrast, the reaction product of a mixture of C C fatty acid methyl esters, triethanolamine and dimethyl sulfate has good softening, outstanding whiteness-retention, selfemulsification and excellent rewetting properties, along with a light color, having anindex on the Gardner scale in the range of l to 2.
Once a fatty acid ester mixture of sufficient purity is obtained, the softener is readily synthesized in the following manner. About two moles of a select fatty acid ester mixture are mixed with about 1 mole of triethanolamine, along with a small amount of a transesterification catalyst, such as sodium methoxide. The mixture is reacted at about to l 15C. for a period of time to attain the amine ester. The amine ester is then mixed with a mole equivalent of dimethyl sulfate (or other quaternizing reagent) and reheated to about 70 to C. for a period of time to obtain a viscous quaternary ammonium methol sulfate product, identified as N-methyl-N,N-di-(B-C C -acyloxy ethyl), N-B- hydroxy ethyl ammonium metho sulfate. This active softener is then mixed with an inert vehicle, such as isopropanol to form a softener base which may be later combined with other additives and increased amounts of vehicle to provide a domestic softener formulation. Such formulations are milky-white and have extended shelf-life over a wide range of temperatures.
A specific exemplary embodiment of a synthesis route for producing a preferred embodiment of the active softener is set forth below.
DEMONSTRATlON A A commercially available fatty acid methyl ester mixture, Stepan C 65-P (a purified C C fatty acid methyl ester mixture comprised of about 40% to 55% palmitic, about 30% to 40% oleic, about 7% to 12% stearic, about 4% to 8% linoleic and about 1% to 4% myristic along with minor (less than 1%) amounts of other fatty acid substances, available from the Stepan Chemical Company, assignee of the instant application, was tested for purity by placing a small sample thereof in a conventional test tube along with a small amount of 25% methano'lic solution of sodium methoxide and vigorously shaken. The color of this solution remained light for more than minutes and was judged to have a color index on the Gardner scale of about 1. From previous experience, this demonstrated that Stepan C 65-P was of sufficient purity to produce a clean light colored softener.
A 4-neck, l-liter reaction flask fitted with a stirrer, thermometer, nitrogen inlet and a vacuum distillation assembly was charged with 500 grams (1.78 moles) of Stepan C 65-P, 133.2 grams (0.893 moles) of triethanolamine and 8 grams (25% solution in methanol) of a sodium methoxide solution. The mixture was stirred and heated to 9l-l05C. under vacuum (28 inches of Hg) and nitrogen flow (about 50 cc/min.) for about 1 hour and 45 minutes. Approximately 80 ml. of methyl product was obtained. This product was mixed with 145 grams of isopropanol at a temperature of about 79C. to form a 75% by weight fabric softener base solution.
This base solution was of a light color characterized by a color index on the Gardner scale of about I (read at 55C., 75% solids in 25% isopropanol). The base solution was then diluted and mixed with large amounts of water. The resultant emulsion was milky-white and did not separate upon standing.
This aqueous softener formulation (i.e. containing about 8% by weight active softener) was then compared for softening and non-coloring characteristics against commercially available softeners by treating identical fabrics laundered with identical detergents in a select cycle laundering operation. White terry cloth towel swatches were placed in a typical domestic washing machine, along with a select amount of detergent, washed in a conventional manner and then, during the rinse cycle, treated with a softener. Each towel was subjected to this cycle a select number of times, adding a fabric softener to the rinse cycle after each washing. The towels were then removed, dried and evaluated for softness and whiteness by a select panel. Each panel member was individually required to list his preference in descending order of whiteness and softness on each towel. Thereafter, the numerical value assigned to'each towel was compiled and tabulated so that a towel which had the lowest number under a given characteristic indicated that a majority of the panel members placed this towel most often in first place. In other words, a low numerical value indicates that a large percentage of the panel judged that towel to be whiter or softer than other towels in the test. The average and compiled alcohol was collected in a trap under a dry-ice-acetone results are tabulated below.
TABLE I A batch of towels was laundered with a typical Na CO built detergent (Sears Roebuck Laundry Detergent) for a select number of cycles, adding softener to the-rinse after each wash. and were then judged for the characteristics noted.
A batch of towels was laundered with a typical phosphate built detergent (Tide) for a select number of cycles, adding softener to the rinse after each wash. The towels were then evaluated by the panel.
whiteness Softness Softener 1 cycle 5 cycles 10 cycles 1 cycle 5 cycles l0 cycles None 14 l l 12 48 48 48 Nu-Soft 48 48 I9 25 34 T-di-C6SQ 24 32 29 34 26 2t "Nu-Soft" is a registered trademark ofCPC International Inc. for a fabric softener containing about 8% to 9% solids in an inert vehicle. The active softener is a quatemized ditallow imidazoline.
Downy is a registered trademark of Proctor & Gamble Co. for a fabric softener comprised of about 6% to 7% solids in an inert vehicle. The active softener base is dimethyl ditallow ammonium chloride. T-di-C6SQ" is an 8% by weight of N-methyl-N,N-di-(B-C C -acyloxy ethyl). N-fl-hydroxy ethyl ammonium metho sulfate of the invention in an aqueous-alcohol solution.
bath and about 579 grams of the amine ester were obtained. The amine ester was light in color, with a color index of the Gardner scale of about 1.
369 grams (0.56 moles) of this amine ester was then slowly reacted with 71 grams (0.5 6 moles) of dimethyl sulfate for about 2 hours at a temperature of about 97C. A viscous quaternary ammonium metho sulfate It will be noted that the preferred softener of the in vention does not yellow fabrics over prolonged usage and provides softening action to treated fabrics at least as good as obtainable from presently available softeners. Further, the softeners of the invention are not adversely affected by carbonate built detergents or by phosphate built detergents, where either anionics or 7 nonionics are utilized as the primary surface active agents.
To demonstrate the outstanding rewetting characteristics of the softeners here disclosed, a swatch-sink test was utilized. Generally this test comprises placing 2 X 2 inch swatches of softener-treated toweling on the surface of distilled water and timing, as with a stop watch, the amount of time required for each swatch to absorb water and sink below the surface of the water. Each swatch was subjected to a single wash cycle, adding a softener at the rinse cycle, dried and then carefully placed in the distilled water. The average of four determinations for each softener was recorded and is tabu- All of the softeners used contained approximately equal amounts of a nonionic wetting agent.
As indicated earlier, the softener of the invention, i.e. T-di-C65Q does not require additions of nonionic wetting agents and in the above tests nonionic wetting agents were included to facilitate a direct comparison with known softener formulations containing nonionic wetting agents.
The softeners of the invention may be formulated with various additives which include perfumes, optical brighteners, nonionics, viscosity control agents, and other like additives conventionally included in domestic softener formulations.
Various changes and modifications to the above described embodiments of the invention may be made without departing from the spirit and scope thereof and it is intended that all matters contained in the above description shall be interpreted as illustrative and not as limiting.
We claim as our invention:
l. A self-emulsifying domestic laundry fabric softener agent consisting essentially of a mixture comprised of N alkyl-N,N-di-(B-C, C -acyloxy ethyl), N-B-hydroxy ethyl ammonium compounds and a substantially inert vehicle, said agent being characterized by good fabric softening, whiteness-retention and rewetting properties and by a light color index on the Gardner scale in the range of about 1 to 2, said C C acyloxy group comprised of a mixture of substantial amounts of palmitic, stearic and oleic radicals.
2. A softening agent as defined in claim 1 wherein said agent is N-methyl, N,N-di-(B-C, C -acyloxy ethyl), N-B-hydroxy ethyl ammonium metho sulfate.
3. A softening agent as defined in claim 1 wherein said inert vehicle includes water.
4. A softening agent as defined in claim 1 wherein said inert vehicle includes isopropanol.
5. A softening agent as defined in claim 1 wherein said inert vehicle comprises a mixture of isopropanol and water.
6. A softening agent as defined in claim 1 wherein said inert vehicle is selected from the group consisting of a C C aliphatic alcohol, a C C aliphatic glycol, a C C aliphatic alcohol alkali sulfate, an alkyl benzene alkali sulfonate, water and mixtures thereof.
7. A softening agent as defined in claim 1 wherein said mixture includes about by weight of said agent and about 25% by weight of said inert vehicle.
8. A softening agent as defined in claim 1 wherein said mixture includes about 8% by weight of said agent and about 92% by weight of said inert vehicle.
9. A method of softening domestic laundry fabrics comprising treating said fabrics in an aqueous media containing an amount of cationic quaternary ammo nium softener agent comprising N-methyl-N,N-di-(B- C C -acyloxy ethyl), N-B-hydroxy ethyl ammonium metho sulfate.
Patent Citations
Referenced by
Original Image


text:
"Very good for a teenager audience"
This book was selected for the literature portion of a parochial school academic decathalon among Los Angeles area schools to be held in March 2012. As grandparents. we listened to it with a sense of participation and interest that was fully gratified. We found it a very good story, well suited to a teenage audience, and worthy of its selection.
Report Inappropriate Content
If you find this review inappropriate and think it should be removed from our site, let us know. This report will be reviewed by Audible and we will take appropriate action.


text:
Email: firstname.lastname@example.com
© Copyright 1996-2014 Archiseek.com
Archiseek is an online magazine dedicated to, but not exclusively to, Irish architecture. Featuring news from Irish architecture, encouraging discussion between architects and those interested in our built environment, Archiseek is the leading Irish architecture publication. We always welcome submission from Irish architects of recent projects, and unbuilt competition entries for publication.
Architect: Edward Burgess The Town Hall is situated on the south side of the Market Square. It was first built...


text:
By Errol Castens Daily Journal NEW ALBANY – A 40,000-gallon tank of fuel exploded at the JNS Biodiesel plant just north of New Albany early Wednesday morning, rattling homes and sending a fireball hundreds of feet into the air, followed by a tornado-like column of smoke that could be seen for miles. No one was […]
Tag Archives | Jimmy Edwards
Big blast rocks Union County; no one injured
By Floyd Ingram | 8:16 AM | January 23, 2014 | Business, News
AG: Gun ruling doesn't apply statewide
By Floyd Ingram | 11:28 AM | July 16, 2013 | News
By Bobby Harrison Daily Journal Jackson Bureau JACKSON – Attorney General Jim Hood says the ruling last week by a Hinds County circuit judge blocking the enactment of a law clarifying Mississippi as a state where people can openly carry a weapon doesn't apply outside the judge's Hinds County jurisdiction. "I do not believe that […]
- Battle of Egypt marked and remembered March 22, 2015
- Hilltopper tennis squeezes in games March 26, 2015
- Ole Miss rallies for Jones March 26, 2015
- Region's jobless rate rises March 27, 2015
- IHL, Jones mull possible contract extension March 27, 2015
- BIRTH: Emmitt Verell Wright March 29, 2015
- State releases detailed bass summary March 29, 2015
- First Turkey March 28, 2015
- One dead in crash south of Okolona March 28, 2015
- Yokohama Mississippi nearing completion March 28, 2015
- Tg007.net: if you want the town to grow stop taxing the busin...
- i'm engaged, you can be too | architecture | equality: […] the design and related impacts of a new...
- Royal Chocolate: Great to see progress in my hometown!...
- Cherry Walker: I had heard this woman's name before so I did som...
- Kathryn: I'd say that Mr. Scott nailed it. Well said, sir...
aberdeen amory Army arrest Baptist basketball Bruce business Calhoun City Calhoun County chickasaw Chickasaw County Christmas city County Court crime education Eupora featured fire floyd football Franklin houlka Houston ingram Jones Mantee Mississippi Money Moore MSU Okolona Parker police Pontotoc Prairie school schools Smith Tupelo Vardaman west point Woodland


text:
Products like Street View are now expected by tourists and residents of globally-renown cities. Dubai is the first city in the Arab world to offer Google Street View. Read More »
Dec 9, 2014
Lei Jun, founder of China's largest smartphone vendor Xiaomi, spent half an hour Tuesday waxing lyrical...
Products like Street View are now expected by tourists and residents of globally-renown cities. Dubai is the first city in the Arab world to offer Google Street View. Read More »
The mobile version of Google Maps is morphing from a navigation tool into a sophisticated remote control.
The Maps app is integrating OpenTable's restaurant reservation service as well as getting a new look, Google announced on Wednesday. Read More »
There was one conspicuous absence from the suite of products Apple announced on Tuesday – TV.
But Chief Executive Tim Cook says Apple is still interested.
"This is an area we continue to look at," Cook told Charlie Rose in an interview scheduled to air Friday night. Read More »
Apple acquired the mass-transit app company Embark, the latest move in the company's long-running effort bulk up its mapping service.
An Apple spokeswoman confirmed the acquisition. "Apple buys smaller technology companies from time to time, and we generally do not discuss our purpose or plans," she said. The news was earlier reported on jessicalessin.com.
Apple didn't disclose the price or the timing of the deal. A look at Embark's Twitter account shows the company stopped tweeting on July 1. Read More »
Apple said on Friday that it had acquired two companies, Locationary and HopStop, as it bulks up its mapping offerings.
An Apple spokeswoman said in a statement that Apple buys smaller technologies from time to time, but generally does not discuss its plans. Neither Locationary nor HopStop responded to a request for comment.
Both companies have technology that could help bulk up Apple's products. Locationary helps manage points of interest in mapping databases, while HopStop offers customers access to local transit information.
Nice lede on John Paczkowski's article on All Things D about Apple snapping up a small local data company to bolster its mapping service.
Last September Grant Ritchie, CEO of crowdsourced location data company Locationary, penned an article for TechCrunch describing five challenges Apple faces as it builds out its new mapping service. Ten months later he's become part of the effort to overcome them.
Per usual, the terms are unknown and Apple won't talk about its plans. But as Paczkowski points out, there really is only one goal when it comes to maps: Make the app better. Read the rest of his article. Read More »
By Sven Grundberg
Google Inc.'s brand new maps application for iPhone quickly claimed the spot as the most downloaded free-of-charge application on Apple Inc.'s App Store on Thursday, just hours after it was released. And judging by the top ratings the application has been awarded with — by more than 8,000 users since it became available — it has also succeeded to win the hearts and minds of consumers.
As much as the new iPhone maps application is a triumph for Google and an embarrassment for Apple, it also bothersome for Finland's Nokia Corp, which tried to capitalize on the widespread outrage that met Apple's maps software when it was released in September.
Having Apple's CEO issue an apology over their maps controversy was a good move, public relations crisis management expert Michael Robinson discusses on digits. Read More »
InboxQ, a service that helps people connect with experts on Twitter, has combined its data with Google Maps to create an interactive heat map of expertise worldwide–a visualization that could be handy, the company hopes, for marketing agencies mapping trends.
When users type in a topic, a world map shades in areas occupied by those Twitter users that demonstrate a greater than average knowledge on the topic as determined by InboxQ. "Hollywood" yields a yellow blob emanating from California, indicating a heavy concentration of experts. "Tea," meanwhile, gives the U.K. a similar treatment. "Beer" seems to have experts in multiple areas.
Currently the map is limited to English speaking countries.
The map, according to InboxQ co-founder Joe Fahrner, began as a "throwaway project" handed over to an intern to keep him busy. But it quickly became clear that the end result dove-tailed with the company's goals of connecting users with online experts. Read More »
You'd think that by now Internet maps would know where every single building in America is, every single street and bike path. But sometimes, when you're using Google maps, you can't find what you want, or road construction means a route has changed.
On Tuesday, Google announced that it's bringing a Wikipedia-like tool to its maps, allowing users to contribute changes for areas that they know well, and incorporating them into the map if they're approved by other users.
The tool, called Google Map Maker, already has been used in 183 countries and regions world-wide — often relatively remote places where there weren't good maps to begin with. But this is the first time Map Maker has been available for the U.S. Read More »
Digits delivers breaking news and insights about the technology landscape, including Q&As with newsmakers, product news and strategic moves. Send news items, comments and questions to email@example.com.
Content engaging our readers now, with additional prominence accorded if the story is rapidly gaining attention. Our WSJ algorithm comprises 30% page views, 20% Facebook, 20% Twitter, 20% email shares and 10% comments.


text:
Google Adwords Campaign Design
Closed - This job posting has been filled and work has been completed.
Job Description
I am looking for a Google AdWords Campaign Designer for an inbound marketing company focused on procuring attorneys searching for SEO, Content Creation, Web Development and Reputation Management services. I have a large list of competitors keywords from SpyFu. This campaign will start out locally and evolve to a national campaign.
I need:
- Composition of keyword research with the goal of keeping the cpa at it's lowest point.
- Display ads composed for my company's website.
- Campaign management from contractor's MCC account.
- Analytics integration and weekly follow up and adjustments.


text:
Want to get away but still be in the city? Want to get some recreation and some quiet? This open space is for you. Located at the top of Woodmen Valley, this park is worth the drive.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?
TM + © 2015 Vimeo, LLC. All rights reserved.
Made with k in NYC.
Your content preferences apply to any Vimeo videos you view. Learn more about content preferences in our FAQ.


text:
We present a mathematical construct which provides a cryptographic protocol to (verifiably shuffle) a sequence of (k) modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of (k) modular integers, each of which is the same secret power of a corresponding input element, but the order of elements in the output is kept secret. Though it is a trivial matter for the "shuffler" (who chooses the permutation of the elements to be applied) to compute the output from the input, the construction is important because it provides a linear size proof of correctness for the output sequence (i.e. a proof that it is of the form claimed) that can be checked by one or more arbitrary verifiers. The protocol is shown to be honest-verifier zeroknowledge in a special case, and is computational zeroknowledge in general. On the way to the final result, we also construct a generalization of the well known Chaum-Pedersen protocol for knowledge of discrete logarithm equality ([3], [2]). In fact, the generalization specializes (exactly) to the Chaum-Pedersen protocol in the case (k)=2. This result may be of interest on its own. An application to electronic voting is given that matches the features of the best current protocols with significant efficiency improvements. An alternative application to electronic voting is also given that introduces an entirely new paradigm for achieving (Universally Verifiable) elections.
1. A computer system for receiving a sequence of elements, comprising:
a computer coupled to a computer network and configured to:
receive a sequence of electronic data elements representing individual data files,
apply a cryptographic transformation using at least a first secret value to anonymously permute the sequence of electronic data elements and produce a first shuffled sequence of electronic data elements, wherein the server computer knows a correspondence between the first shuffled sequence of electronic data elements and the sequence of electronic data elements, and
generate a first proof of correctness for the first shuffled sequence of electronic data elements based on an iterated logarithmic multiplication proof employing a binary operator, wherein each of the data elements in the sequence of data elements is associated with a common base value, and wherein verifying the proof of correctness employs a three-move, public coin proof of knowledge wherein in response to a verifying request, the computer computes a series of exponents by solving an associated series of linear equations.
2. The system of
receive a series of randomly generated values ei from a verifier computer;
secretly generate a series of values Di based on a secret, one-way cryptographic transformation that employs the received series of values ei and secretly generated values;
permute the sequence of electronic data elements to produce the first shuffled sequence of elements based on the series of values Di and a secret value γ; and
provide the values Di and a series of proof values based on the cryptographic transformation as a proof of knowledge that the server computer has access to how the cryptographic transformation permuted the sequence of electronic data elements to produce the first shuffled sequence of elements without revealing the cryptographic transformation to the verifier computer.
3. The system of
receiving a plurality of public keys from a corresponding plurality of individuals, wherein each of the plurality of individuals have a private key corresponding to one of the plurality of public keys;
receiving a request from one of the plurality of individuals having a one private key;
providing at least a subset of the plurality of public keys to the requesting individual;
receiving a file and a shuffle of the plurality of public keys and a proof of correctness for the shuffled public keys based on an iterated logarithmic multiplication proof and a value corresponding to the one private key, wherein the value is associated with the file and provides proof that the one individual has knowledge of the one private key without revealing the one private key;
checking the proof of correctness;
checking that the value is mathematically related to a one of the public keys and the file; and
reducing the plurality of public keys by the one public key.
4. The system of
if so, issue a certificate to the one individual.
5. A computer-implemented cryptographic method between a prover computer and a verifier computer, the method comprising:
secretly shuffling a first series of electronic data elements with respect to a second series of electronic data elements to produce a shuffled set;
generating a proof of correctness for the shuffled set based on proving that a first set of roots for a first polynomial equation is equal to a fixed constant multiple of a second set of roots for a second polynomial equation; and
wherein the proof of correctness that the first set of roots is equal to a fixed multiple of the second sets of roots is obtained by: specifying a second fixed constant, evaluating the first polynomial equation at a first random point to obtain a first value, evaluating the second polynomial equation at the first random point to obtain a second value, and determining that the second value is equal to a product of the first value and the second fixed constant.
6. The method of
7. The method of
8. The method of
9. The method of
receiving an anonymous certificate if the verifying computer verifies the proof of correctness.
10. A computer system for receiving a sequence of elements, comprising:
a server computer coupled to a computer network and configured to:
receive a sequence of electronic data elements representing individual data files,
apply a cryptographic transformation using at least a secret key to anonymously permute the sequence of electronic data elements and produce a shuffled sequence of electronic data elements, wherein the server computer knows a correspondence between the shuffled sequence of electronic data elements and the sequence of electronic data elements,
wherein the server computer is further configured to:
generate a proof of correctness for the permutation based on a proof that the product of unencrypted values of elements of a first sequence of encrypted data elements is equal to the product of unencrypted values of elements of a second sequence of encrypted data elements.
11. The system of
receive a series of randomly generated values ei from a verifier computer; and
generate the proof of correctness as an non-interactive proof based at least in part on at least some of the randomly generated values ei.
12. The system of
receiving a plurality of public keys from a corresponding plurality of individuals, wherein each of the plurality of individuals have a private key corresponding to one of the plurality of public keys;
receiving a request for a certificate from one of the plurality of individuals having a one private key;
providing at least a subset of the plurality of public keys to the requesting individual;
receiving a shuffle of the plurality of public keys and a non-interactive proof of correctness for the permutation based on a proof that the product of unencrypted values of elements of a first sequence of encrypted data elements is equal to the product of unencrypted values of elements of a second sequence of encrypted data elements;
checking the proof of correctness;
issuing a certificate to the one individual; and
reducing the plurality of public keys by the one public key.
13. The system of
if so, issue a certificate to the one individual.
14. The system of
15. The system of
16. The system of
17. A computer-readable medium whose contents store a sequence of electronic data elements and associated data, wherein the sequence of electronic data elements are processed by a computer-implemented method for a shuffling of the sequence of electronic data elements, the method comprising:
receiving the sequence of electronic data elements;
applying a secret, one-way cryptographic transformation using at least a first secret key to anonymously permute the sequence of electronic data elements and producing a first shuffled sequence of electronic data elements; and
generating a proof of correctness for the permutation based on a proof that the product of unencrypted values of elements of a first sequence of encrypted data elements is equal to the product of unencrypted values of elements of a second sequence of encrypted data elements.
18. The computer-readable medium of
19. The computer-readable medium of
20. The computer-readable medium of
21. The computer-readable medium of
22. The computer-readable medium of
23. The computer-readable medium of
24. The computer-readable medium of
25. The computer-readable medium of
26. The computer-readable medium of
This application is a U.S. national phase application of PCT/US2002/009264 filed Mar. 25, 2002, which claims priority to: U.S. patent application Ser. No. 09/816,869 filed Mar. 24, 2001 (now U.S. Pat. No. 6,950,948); U.S. Provisional Patent Application Nos. 60/311,680 filed Aug. 9, 2001; 60/312,671 filed Aug. 15, 2001; and 60/313,003 filed Aug. 16, 2001, all of which are incorporated herein in their entireties by reference.
The notion of a shuffle of a collection of objects, records, or tokens is simple and intuitive, and useful examples abound in various daily human activities. A gambler in a casino knows that among the cards in his hand, each will be one of 52 unique values, and that no one else at the table will have duplicates of the ones he holds. He does not, however, have any knowledge of how the cards are distributed, even though he may have recorded the exact card order before they were shuffled by the dealer.
In the context of electronic data, the problem of achieving the same kind of random, yet verifiable permutation of an input sequence is surprisingly difficult. The problem is that the data itself is either always visible to the auditor, or it isn't. If it is, then the correspondence between input records and output records is trivial to reconstruct by the auditor, or other observer. If it isn't, then input and output records must be different representations of the same underlying data. But if the output is different enough (that is, encrypted well enough) that the auditor cannot reconstruct the correspondence, then how can the auditor be sure that the shuffler did not change the underlying data in the process of shuffling?
Most of the paper is devoted to giving an efficient (linear) method for solving this problem in an important context—ElGamal, or Diffie-Hellman encrypted data. In order to make the exposition as clear and concise as possible, the majority of the paper explicitly refers to the specific case where the operations are carried out in a prime subgroup of Zp*, the multiplicative group of units modulo a large prime, p. However, the only properties of the underlying (multiplicative) group that we use is that the associated Diffie-Hellman problem is intractable. Thus, the shuffle protocol is also useful when the ElGamal cryptosystem is implemented over other groups such as elliptic curves.
The general Boolean proof techniques of [1] and [4] can also be used to construct a proof with the same properties, however, the resulting proof size (complexity) is quadratic, or worse, in the size of the input sequence.
The technique of this paper also offers several advantages over the cut-and-choose technique used in [8]. In this approach, the size of proof is dependent on the probability of a cheating prover that is required to satisfy all participants. In the shuffle protocol of this paper, this cheating probability is essentially k/q, where k is the number of elements to be shuffled, and q is the size of the subgroup of Zp* in which the elements are encrypted. Although no analysis of the proof size dependence on cheating probability is done in [8], it appears that, in order to obtain similarly low cheating probability, it will need to be orders of magnitude larger than the size of the proof given in this paper. (Moreover, if the [8] protocol is implemented non-interactively, the cheating probability would need to be chosen exceedingly small, because a malicious participant might use considerable off-line computation to generate a forged proof by exhaustive search. This of course, could be the case with the protocol of this paper as well, but the probability k/q is, for all practical values of k and q, certainly small enough—even for offline attacks.)
The results of this paper provide for several ways to implement a universally verifiable election protocol. Some of these are presented in the final sections. In this context, it is worth comparing the elegant homomorphic election protocol of [2]. That protocol works well when ballots have only questions of a simple "choose (at most) m of n" type. This effectively precludes "write-in" responses, as well as "proportional type" questions where the voter is expected to indicate answers in preferential order, and questions are tabulated in accordance with this preference. (Theoretically, proportional type questions can be handled by mapping each valid permutation of selections to a single yes/no response. However, in practice this is infeasible unless the number of choices is quite small.) A couple of somewhat less important disadvantages of the [2] scheme are that it expands vote data size considerably, and that it requires a voter validity proof. This proof further expands the vote data size by about an order of magnitude, and is unattractive from a practical perspective, because it presumes special purpose code to be running on the voter's computer.
The shuffle protocols herein are constructed entirely from elementary arithmetic operations. They are thus simple to implement, and are imminently practical for the anonymous credential application described herein.
1.1 Applications to Voting
The voting application that occurs immediately is that which employs the usual tabulation/mixing center approach to provide anonymity. In this setting, the protocols of this paper offer important advantages. They are much more efficient, and allow the mixing centers to be completely independent of the authorities who hold some share of the key necessary to decrypt ballots.
Perhaps, however, a more valuable and exciting application of the new protocol is for creating "anonymous credentials". A member of an authorized group, identified only by a set of DSA, or Diffie-Hellman public keys, can authenticate group membership, and/or sign in a one time way, without revealing his/her individual identity. This leads to a novel solution to the voting problem that is universally verifiable, but does not require any special set of "authorities" in order to tabulate. It also offers a better privacy model to the voter, and speeds tabulation enormously since ballots do not need to be encrypted/decrypted. In effect, instead of mixing encrypted vote cyphertexts after ballots have been received at the vote collection center, voter credentials are mixed before the start of the election. This mixing can naturally be done by the voters themselves to achieve "anonymous authentication". (See section 7.1.) (It should be noted that the mixing could also be done by a set of authorities, thus providing a more efficient means to implement a threshold privacy election. One where, again, ballots do not need to be encrypted/decrypted.)
In the following, unless explicitly stated otherwise, n will be a positive integer, p and q will be prime integers, publicly known. Arithmetic operations are performed in the modular ring Zp (or occasionally Zn), and g∈Zp will have (prime) multiplicative order q. (So, trivially, q|(p−1).) In each proof protocol, P will be the prover (shuffler) and V the verifier (auditor).
We recall the Chaum-Pedersen proof of equality for discrete logarithms. For G, X, H, Y ∈Zp this is a proof of knowledge for the relation
It is not known to be zero-knowledge, however it is known to be honest-verifier zeroknowledge. In the next section, we will give a natural multi-variable generalization of this protocol which also has these properties. These are sufficient for our main application where the verifier is implemented via the Fiat-Shamir heuristic. (See [5] and [2].)
In each of the notations in the preceding definition, the subscript g may be omitted when its value is clear from context.
We note the following collection of well know results, since they will be heavily used in the remainder of the paper.
For the rest of this section, all logarithmic multiplications will be computed relative to a fixed element g, and hence we will omit the subscript in notation. The following problem is fundamental to the shuffle protocols which are to come later.
Iterated Logarithmic Multiplication Problem: Two sequences {Xi}i=1 k and {Yi}i=1 k are publicly known. The prover, P, also knows ui=logg Xi and vi=logg Yi for all i, but these are unknown to the verifier, V. P is required to convince V of the relation
The protocol we give is precisely a higher dimensional generalization of the Chaum-Pedersen protocol discussed at the beginning of section 2. In fact, we will see that in the case k=2, the protocol is exactly the Chaum-Pedersen protocol. The presentation will be considerably simplified by restricting the problem instance to a case where
Clearly, if any of these inequalities do not hold, then there is no sense in constructing a proof since equation (5) can be seen to hold or not by inspection. (If Xi=1 then xi=0 and so equation (5) holds if and only if Yj=1 for some j. Similarly with the roles of X and Y reversed.)
Iterated Logarithmic Multiplication Proof Protocol (ILMPP):
Completeness means that, given arbitrary {right arrow over (θ)}=(θ1, . . . , θk−1) and γ, P can always find {right arrow over (r)}=(r1, . . . , rk−1) satisfying the system of equations in (8). To see that this is the case, take logg of each side of the equations in (8), and set
The (k−1)×(k−1) subsystem
However, under the hypotheses of the problem, (10) actually implies (9). This is because
If the first column vector of the matrix on the left of equation (12) is not a linear combination of the remaining k−1 column vectors, then there can be at most one value of γ∈Zq for which equation (9) holds. Thus, if γ is chosen randomly, there is at most a chance of 1 in q that P can produce r1, . . . , rk−1 which convince V.
Special Honest-Verifier Zeroknowledge
Honest-verifier zero-knowledge holds because, for random γ and random {right arrow over (r)}=(r1, . . . , rk−1), and for
It is easy to see that the distribution so generated for {right arrow over (A)} is identical to that generated according to (7), again because the first column vector of the matrix in (12) is a fixed linear combination of the remaining column vectors. So if V is honest, the simulation is perfect. Since the challenge, γ, can be chosen freely, we also have special honest-verifier zero-knowledge.
However, this will not work if some of the yj are 0. In the case of equation (11), this problem was avoided by assumption (6). Of course, the main part of the solution could just have well been set up under the assumption that yi≠0 for all 1≦i≦k−1—the choice of expression for ri just needs to be kept consistent with the form of the assumption.
As is the case with the Chaum-Pedersen protocol, which proves that P knows s=logg X=logH Y, the ILMPP proves that P knows s1, . . . , sk such that logg Xi=logg Yi, and Πi=1 k si=1. This is clear because from two accepting conversations, ({right arrow over (A)},γ,{right arrow over (r)}) and ({right arrow over (A)},γ′,{right arrow over (r)}′), with the same first move and γ≠γ′, a witness,
Since w=γ−γ′≠0, it follows that ρi≠0 for all 1≦i≦k−1. Thus, with an appropriate small modification to the statement of the problem, it satisfies special soundness.
The first shuffle proof protocol we construct requires a restrictive set of conditions. It will be useful for two reasons. First, it is a basic building block of the more general shuffle proof protocol to come later. Fortuitously, it also serves a second important purpose. A single instance of this proof can be constructed to essentially "commit" a particular permutation. This can be important when shuffles need to be performed on tuples of Zp elements, which is exactly what is required when shuffling ElGamal pairs, as in the voting application.
There are obvious ways to handle these special cases. Moreover, in practice, they will "essentially never" occur since elements are usually random.
The protocol of the previous section, in combination with corollary 2, provide the tools necessary to solve this problem in a fairly straightforward manner.
Simple k-Shuffle Proof Protocol:
The protocol succeeds (V accepts the proof) if and only if V accepts this ILMPP.
If V generates challenges randomly, the probability of a forged proof is less than or equal to
Both the size and complexity of the simple k-shuffle protocol can be improved by a factor of 2. Instead of using corollary 2, we use corollary 4. Intuitively, we would like to replace the k copies of D and k copies of C in equation (16) with single entries gd
Simple k-Shuffle Proof Protocol II:
If V generates challenges randomly, the probability of a forged proof remains less than or equal to
An obvious limitation of the simple k-Shuffle protocol is that the shuffler, P, must know all the original exponents x1, . . . , xk and y1 . . . yk. In many applications, this will not be the case. The goal of this section is to eliminate that restriction.
General k-Shuffle Problem: Two sequences of k elements of Zp, X1, . . . , Xk, and Y1, . . . , Yk are publicly known. In addition, constants c,d∈Zq are known only to P, but commitments C=gc and D=gd are made public. P is required to convince V that there is some permutation, π∈Σk, with the property that
(For the sake of presentation, we consider the case d=1. The general case can be reduced to this case simply by changing the group generator from g to C, and making the substitution c=c/d.)
Much of the setting for the conventional voting application can be found in [2]. Votes are submitted as ElGamal pairs of the form (gα
On output of the final shuffle, the final collection of encrypted ballots is decrypted in accordance with the threshold scheme, and the clear text votes are tabulated in full view by normal election rules.
The authorities who participate in the sequential shuffles, may be arbitrary in number, and they may be completely different from those who hold shares of the election private key. The sequence of ballots which are finally decrypted can only be matched with the original sequence of submitted ballots if all of the shuffling authorities collude, since each of their permutations is completely arbitrary.
Although the form of each shuffle is different from the shuffle discussed in section 5, a proof protocol can be constructed with minor modifications. We present the details in the following subsection.
6.1 Shuffles of ElGamal Pairs
In the standard mix-net implementation, it is assumed that two distinct phases must take place:
If the set, SD, of decryption authorities (or even just some subset of it) is included in the set of shuffling authorities (this is almost always the case in practice), a disadvantage of this procedure is that it requires each authority that is in both sets to receive two separate communications, each of which may be quite large. The disadvantage is particularly severe when the authorities are connected by a slow communication link.
We observe that it is possible for some or all of the decryption to take place at the same time as mixing. This is accomplished simply by combining, during the shuffling phase, shuffling step 3 with decryption step 2 for each of those shuffling authorities who are members of SD. Those shuffling authorities who are not members of SD can follow the steps unmodified.
So, if Aj is a member of SD, in shuffling step 4, rather than just send B to Aj+1. Aj sends both
In this way, if all of the decryption authorities are also shuffle authorities, as is usually the case, then the final output will be a set of decrypted ballots, thus eliminating the need for a seperate decryption phase. If only t0<t decryption authorities are also shuffle authorities, then the final shuffled ballot box will consist of elements that are encrypted with a public key which is shared among the remaining t-t0 decryption authorities. Thus, in this case there is still a need for a decryption phase, but the amount of communication required is reduced by the corresponding amount.
The general k-shuffle is ideally suited to verifiably permuting a set of DSA, or Diffie-Hellman public keys. By this we mean that a new set of DSA public keys is produced, which is computationally unlinkable to the original set, but which verifiably represents the same set of private keys. This can be extremely valuable when one wishes to anonymize a set of authenticated keys while still protecting the integrity of the original group of private keys—the election setting is just one such example.
We only sketch the technique here, but the details should then be completely obvious to the reader. It is assumed that initially all the public keys are of the form (g,H), H=gs, where g is some fixed generator and s is the private key. That is, loosely, "all the keys use the same base". The protocol proceeds as follows:
In the voting application, it is often said that for election integrity one must know "who voted", but for privacy, one must not know "how voted". The technique of this section solves the privacy/integrity dilemma in a new way. Instead of knowing "who voted", one only knows that the person who voted is a member of a set of authorized voters! As a consequence, we are left with a voting solution that
Of course, one must look after the problem of "double voting", but the technique of this section is easily modified to take care of that as follows.
The resulting election protocol is Universally Verifiable if all the shuffle transcripts and signatures are maintained.
Although this election scheme offers superior privacy characteristics (the secrecy of each voter's ballot is protected by the voter, rather than by a distributed set of authorities), there is a potential practical drawback. The amount of computation required both of the voter (that is, the voter's computer) and the vote collection server computer for the purpose of authentication is much larger than in standard election protocols, where the voter must only compute a standard public key signature. However, if this additional computation is expected to cause a problem, then the same anonymization can be performed well in advance of the election, before the ballot is available.
This is accomplished by issuing standard PKI certificates issued in response to a certificate request which is anonymously signed exactly as the ballot is signed in step AV-1 above. Of course these certificate requests would contain no identifying personal information, but they would otherwise be completely standard, including, most importantly, a standard public key for which the voter has the corresponding private key. At vote time, the ballot can be simply signed with this ordinary private key. With this strategy, it is possible to re-use the anonymous certificates. Thus the computational cost of the anonymous signatures can be amortized over many elections.
It should be clear that in section 5, the simple shuffle generated essentially "froze" the permutation that could be proved. This makes it easy to see how to extend the previous section to shuffles of k l-tuples of elements of <g>), or k l-tuples of ElGamal pairs. Thinking of a sequence of k l-tuples as a k×l array, a single simple k-shuffle can serve to prove that all columns have been permuted according to the same permutation. Precisely, this means that the same values of Ai, Bi, Ci and Di in both the General k-Shuffle protocol, and the ElGamal Shuffle protocol are used for all columns. (In the General k-Shuffle, the same value of t can be used for all columns, while in the ElGamal Shuffle, the same value of c can be used for all columns, though this is not essential.)
8.1 DSA Key Shuffles without Common Base
The observation of this section also allows a generalization of the DSA key shuffle protocol of section 7. Rather than maintaining the entire set of public keys to the same base, g
The invention can also be practiced in distributed computing environments where tasks or modules are performed by remote processing devices, which are linked through a communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), or the Internet. In a distributed computing environment, program modules or sub-routines may be located in both local and remote memory storage devices. The invention described herein may be stored or distributed on computer-readable media, including magnetic and optically readable and removable computer disks, stored as firmware in chips, as well as distributed electronically over the Internet or other networks (including wireless networks). Those skilled in the relevant art will recognize that portions of the protocols described herein may reside on a server computer, while corresponding portions reside on client computers. Data structures and transmission of data particular to such protocols are also encompassed within the scope of the invention.
Unless described otherwise, the construction and operation of the various blocks shown in
Referring to
A server computer system 108 or "vote collection center," coupled to the Internet or World Wide Web ("Web") 106, performs much or all of the ballot collection, storing and other processes. A database 110, coupled to the server computer 108, stores much of the web pages and data (including ballots and shuffle validity proofs) exchanged between the voter computers 102, one or more voting poll computers 112 and the server computer 108. The voting poll computer 112 is a personal computer, server computer, mini-computer, or the like, positioned at a public voting location to permit members of the public, or voters who may not have ready access to computers coupled to the Internet 106, to electronically vote under the system described herein. Thus, the voter computers 102 may be positioned at individual voter's homes, where one or more voting poll computers 112 are located publicly or otherwise accessible to voters in a public election. The voting poll computer 112 may include a local area network (LAN) having one server computer and several client computers or voter terminals coupled thereto via the LAN to thereby permit several voters to vote simultaneously or in parallel. Note also that the term "voter" is generally used herein to refer to any individual or organization that employs some or all of the protocols described herein.
Under an alternative embodiment, the system 100 may be used in the context of a private election, such as the election of corporate officers or board members. Under this embodiment, the voter computers 102 may be laptops or desktop computers of shareholders, and the voting poll computer 112 can be one or more computers positioned within the company (e.g., in the lobby) performing the election. Thus, shareholders may visit the company to access the voting poll computer 112 to cast their votes.
One or more authority or organization computers 114 are also coupled to the server computer system 108 via the Internet 106. If a threshold cryptosystem is employed, then the authority computers 114 each hold a key share necessary to decrypt the electronic ballots stored in the database 110. Threshold cryptographic systems require that a subset t of the total number of authorities n (i.e., t<n) agree to decrypt the ballots, to thereby avoid the requirement that all authorities are needed for ballot decryption. In other words, the objective of a threshold cryptosystem is to share a private key, s, among n members of a group such that messages can be decrypted when a substantial subset, T, cooperate—a (t, n) threshold cryptosystem. Protocols are defined to (1) generate keys jointly among the group, and (2) decrypt messages without reconstructing the private key. The authority computers 114 may provide their decryption share to the server computer system 108 after the voting period ends so that the server computer system may decrypt the ballots and tally the results.
Furthermore, under the depicted embodiment, each of the authority computers may perform one shuffle of the ballots, as described herein. In conjunction with each shuffle, each authority computer generates a shuffle validity proof, which may be encrypted and forwarded to the server computer 108, or stored locally by the authority computer. In an alternative embodiment, an additional set of authority computers are provided, where one set of authority computers shuffle the encrypted ballots and generate shuffle validity proofs, while the second set of authority computers employ keys shares for decrypting the ballots.
One or more optional verifier computers 130 may also be provided, similar to the authority computers 114. The verifier computers may receive election transcripts to verify that the election has not been compromised. For example, the verifier computers may receive the shuffle validity proofs from each of the authority computers, as described herein. The verifier computers may perform verifications after the election, and need not be connected to the Internet. Indeed, the verifications may be performed by other computers shown or described herein.
The server, verifier or authority computers may perform voter registration protocols, or separate registration computers may be provided (not shown). The registration computers may include biometric readers for reading biometric data of registrants, such as fingerprint data, voice fingerprint data, digital picture comparison, and other techniques known by those skilled in the relevant art. Voter registration and issuing anonymous certificates for use with verifiable shuffles is described below.
The server computer 108 includes a server engine 120, a web page management component 122, a database management component 124, as well as other components not shown. The server engine 120 performs, in addition to standard functionality, portions of an electronic voting protocol. The encryption protocol may be stored on the server computer, and portions of such protocol also stored on the client computers, together with appropriate constants. Indeed, the above protocol may be stored and distributed on computer readable media, including magnetic and optically readable and removable computer disks, microcode stored on semiconductor chips (e.g., EEPROM), as well as distributed electronically over the Internet or other networks. Those skilled in the relevant art will recognize that portions of the protocol reside on the server computer, while corresponding portions reside on the client computer. Data structures and transmission of data particular to the above protocol are also encompassed within the present invention. Thus, the server engine 120 may perform all necessary ballot transmission to authorized voters, ballot collection, verifying ballots (e.g., checking digital signatures and passing verification of included proofs of validity in ballots), vote aggregation, ballot decryption and/or vote tabulation. Under an alternative embodiment, the server engine 120 simply collects all electronic ballots as a data collection center. The electronic ballots are then stored and provided to a third party organization conducting the election, such as a municipality, together with tools to shuffle ballots, decrypt the tally and produce election results. Likewise, election audit information, such as shuffle validity proofs and the like may be stored locally or provided to a municipality or other organization.
The web page component 122 handles creation and display or routing of web pages such as an electronic ballot box web page, as described below. Voters and users may access the server computer 108 by means of a URL associated therewith, such as http:\\www.votehere.net, or a URL associated with the election, such as a URL for a municipality. The municipality may host or operate the server computer system 108 directly, or automatically forward such received electronic ballots to a third party vote authorizer who may operate the server computer system. The URL, or any link or address noted herein, can be any resource locator.
The web page management process 122 and server computer 108 may have secure sections or pages that may only be accessed by authorized people, such as authorized voters or system administrators. The server computer 108 may employ, e.g., a secure socket layer ("SSL") and tokens or cookies to authenticate such users. Indeed, for small elections, or those where the probability of fraud is low (or results of fraud are relatively inconsequential), the system 100 may employ such simple network security measures for gathering and storing votes as explained below, rather than employing complex electronic encrypted ballots, as described in the above-noted patent application. Methods of authenticating users (such as through the use of passwords), establishing secure transmission connections, and providing secure servers and web pages are known to those skilled in the relevant art.
The election scheme and system may use a "bulletin board" where each posting is digitally signed and nothing can be erased. The bulletin board is implemented as a web server. The "ballot box" resides on the bulletin board and holds all of the encrypted ballots. Erasing can be prevented by writing the web server data to a write-once, read-many (WORM) permanent storage medium or similar device.
Note that while one embodiment of the invention is described herein as employing the Internet to connect computers, other alternative embodiments are possible. For example, aspects of the invention may be employed by stand alone computers. Aspects of the invention may also be employed by any interconnected data processing machines. Rather than employing a browser, such machines may employ client software for implementing aspects of the methods or protocols described herein.
Referring to
A second shuffle of the (previously shuffled) ballots is performed, to generate a second shuffled set of ballots, shown as block 212. Again, a shuffle validity proof is generated, shown in block 214. The shuffled ballots of block 212 are shuffled a third time, to produce a final shuffled set of ballots under block 216. A third validity proof 218 is likewise generated based on the third shuffle. In sum, a three-by-three shuffle array is provided under this example. Following, the shuffling, the ballots are decrypted to produce a tally, shown as block 220: A third party may verify that the election by analyzing, among other things, each shuffle validity proof to ensure that each shuffler has preserved election integrity.
The shuffle protocol is presented above as effectively separate subroutines that may be employed for various applications, such as in a electronic voting scheme. A first subroutine provides the functionality of scaled, iterated, logarithmic multiplication proofs between a prover and a verifier. A second subroutine provides the functionality of a simple shuffle protocol and employs the scaled, iterated, logarithmic multiplication proofs. Thereafter, a third subroutine implements general shuffle functionality, where the shuffler does not know the exponents, building upon the second subroutine of the simple shuffle. A fourth subroutine extends the third subroutine to shuffling k tuples of elements. Other routines are of course also provided.
One skilled in the art will appreciate that the concepts of the invention can be used in various environments other than the Internet. For example, the concepts can be used in an electronic mail environment in which electronic mail ballots, transactions, or forms are processed and stored. In general, a web page or display description (e.g., the bulletin board) may be in HTML, XML or WAP format, email format, or any other format suitable for displaying information (including character/code based formats, bitmapped formats and vector based formats). Also, various communication channels, such as local area networks, wide area networks, or point-to-point dial-up connections, may be used instead of the Internet. The various transactions may also be conducted within a single computer environment, rather than in a client/server environment. Each voter or client computer may comprise any combination of hardware or software that interacts with the server computer or system. These client systems may include television-based systems, Internet appliances, mobile phones/PDA's and various other consumer products through which transactions can be performed.
In general, as used herein, a "link" refers to any resource locator identifying a resource on the network, such as a display description of a voting authority having a site or node on the network. In general, while hardware platforms, such as voter computers, terminals and servers, are described herein, aspects of the invention are equally applicable to nodes on the network having corresponding resource locators to identify such nodes.
Unless the context clearly requires otherwise, throughout the description and the claims, the words 'comprise,' 'comprising,' and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in the sense of "including, but not limited to." Words using the singular or plural number also include the plural or singular number, respectively. Additionally, the words "herein," "above," "below" and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application.
The above description of illustrated embodiments of the invention is not intended to be exhaustive or to limit the invention to the precise form disclosed. While specific embodiments of, and examples for, the invention are described herein for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. The teachings of the invention provided herein can be applied to other encryption applications, not only the electronic voting system described above. For example, the protocol has applications in electronic commerce where both anonymity and auditability are requirements. Examples of this are electronic payment schemes ("e-cash").
These and other changes can be made to the invention in light of the above detailed description. In general, in the following claims, the terms used should not be construed to limit the invention to the specific embodiments disclosed in the specification and the claims, but should be construed to include all encryption systems and methods that operate under the clams to provide data security. Accordingly, the invention is not limited by the disclosure, but instead the scope of the invention is to be determined entirely by the claims.
While certain aspects of the invention are presented below in certain claim forms, the inventor contemplates the various aspects of the invention in any number of claim forms. For example, while only one aspect of the invention is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in computer-readable medium. Accordingly, the inventor reserves the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
- 18 & over
- Two items minimum
Irvine, CA
Comedy Central Certified
Share with your friends:
Purchase Tickets
Show Details
- Ticket Price: $4.00
- Door Time: 10:45 PM
- Show Type: Stand Up
- Tags: Stand Up Comedy
18 & over
Two items minimum
Performing Artists (Click on Artist for Reviews and Previews
Justin Tranz
Hipnotist: JUSTIN TRANZ Justin Tranz has headlined the Las Vegas Strip for over a decade, starred weekly on his own hot television series "Extreme Truth" on Playboy TV 7 years in a row! Justin Tranz is the only hypnotist in history to ever play Broadway/Times Square! With the "Power of Suggestion.", volunteers are placed into a very highly suggestible state of mind (Hypnosis). He puts them into comical situations, that leave his sold-out audiences limp with laughter. See the show or be a part of the Show! No two shows are alike because the participants are taken directly from the audience. The differences in personalities take the show in unpredictable directions. You see the show once, and you will feel compelled to see it again and again!
Upcoming Shows
- Thu 3.26.15 - 8:00 PM TAYLOR WILLIAMSON Buy Tickets
- Fri 3.27.15 - 3.28.15 JEFF ROSS Buy Tickets
- Sun 3.29.15 - 7:00 PM GENE POMPA Buy Tickets
- Tue 3.31.15 - 8:00 PM COMEDYJUICE W/ ADAM RAY, GEOFF KEITH, TODD REXX AND MARK SERRITELLA Buy Tickets
- Wed 4.1.15 - 6.3.15 JIM TAYLOR PRESENTS Buy Tickets
- Thu 4.2.15 - 4.4.15 SEBASTIAN MANISCALCO Buy Tickets
See All Shows


text:
On the Run: Return of Boston Marathon a day to celebrate, remember
Runners set for changes, emotional run through streets at Boston Marathon
9:14 PM, Apr. 16, 2014
Most Viewed
Email this article
On the Run: Return of Boston Marathon a day to celebrate, remember
So many things will be the same on Monday as the 118th running of the Boston Marathon kicks off. But, of course, at the same time everything will be different as the record field of 35,000-plus
A link to this page will be included in your message.
Real Deals
Shop and save locallyGET DEALS NOW
Get it all
sign up for delivery
View the last seven days
- Yesterday, Apr 01
- Tuesday, Mar 31
- Monday, Mar 30
- Sunday, Mar 29
- Saturday, Mar 28
- Friday, Mar 27
- Thursday, Mar 26
See our paid archives for news older than a week.
Latest Blogs


text:
Click any word in a definition or example to find the entry for that word
We can now reveal the winners of the Macmillan Love English Awards 2011 They are:
We asked you to tell us which website and which blog deserves a community-chosen award for being the best blog or best website about the English language in 2011?
We also asked you where you go to when you need information, inspiration, guidance or resources in your desire to learn more about English or to satisfy your curiosity about the language? Who do you love, who do you trust, and who do you recommend to your friends or colleagues?
This is your chance to show your appreciation by nominating and voting for your favourite websites and blogs to recognise their contribution over the last year so that they can open the New Year with a badge of honour awarded by you.
Entries were nominated in two categories:
A nominated website or blog is devoted to the English language or language-related issues, whether it's an educational site, a blog about words, a teacher's blog or a resource site.
The winning website and blog may choose a dictionary from the Macmillan Dictionaries range. They also receive a Macmillan Dictionary Love English Awards 2011 winner's badge, and the two runners-up in each category also receive a badge.
If you were nominated and would like a badge for your website or blog please email firstname.lastname@example.com, and we'll send you one.
a course of study which is much shorter than a university course and focuses on the skills you need for a job, especially computer-related skillsBuzzWord Article
More BuzzWordsBuzzWord archive
Open Dictionary
an ancient Roman system of underfloor heating, used to heat houses with hot air; from the Latin 'hypocaustum'add a word
More submissionsview entries
A must for anyone with an interest in the changing face of language. The Macmillan Dictionary blog explores English as it is spoken around the world today.global English and language change from our blog


text:
|Apr 03, 2005, 11:52 PM
DL50 build thread!
well, since nobody has done a mountain models DL50 build thread i decided its time to make one. the DL50 is from www.mountainmodels.com and is said to be a cheap, fun, and durable DLG- i ordered my DL50 on tuesday (3/29) night and was notified it had been sent on wednesday (3/30). it arrived in san diego and was less than 5 feet from my mailbox yesturday (4/2), only 3 days later. unfortunetly, the mailman was too lazy to bring it to my front door and left me a notice saying i wasnt home and that i need to go pick it up on monday.
i will be using the following setup:
rx:berg microstamp
servos: 2 hs-55's
batt: 4 cell 370mah nimh
some items which will be needed in making the DL50 include:
miniwax water based polycrylic
30 and 5 minuet epoxy
sanding block
thin CA
and tools needed to make any model
waxpaper is also neede but i havnt gotten it yet, will run out to local supermarket and fetch some tommorow.
|Apr 04, 2005, 11:19 AM
Fort Wayne, Indiana
Joined Jun 2004
241 Posts
Good luck on your build. Looks like a good start. I really enjoyed building this type of plane. I have mostly done balsa built planes in the past so this was a great eyeopening experience.
|Apr 04, 2005, 01:34 PM
ok and here we go! starting off with the box contents and i was surprised (like everyone else) how thin the airfoil is.
|Apr 04, 2005, 01:45 PM
Joined Mar 2005
19 Posts
Waiting for my DL50
|Apr 04, 2005, 02:11 PM
ok i first cut the trailing edge as per instructions-6.25" at the root chord and 4.75" at the tip. i found it easiest to put the area which your cutting off at the edge a table, then cut through. after that i shaped the one wing, and made the other one as similar as i could.
|Apr 04, 2005, 03:34 PM
next i install the spars. a very easy step first i fit the spar and cut to neccessary length. then pour epoxy into slot, and slode the spar into the slot while twisting it spread the epoxy. then put weights of the spar and wait until dry. i used 30 min epoxy rather than 5 to make sure i do a good job and not feel rushed.
|Apr 04, 2005, 03:39 PM
Garden City, GA
Joined Feb 2004
1,308 Posts
So far so good. Those nicks on the TE will go away once you apply the glass.
|Apr 04, 2005, 03:44 PM
next i get ready to cover the wings. although the instructions say to glue them together and put cf on them, i was told by matt that this way is easier and i should take this route. now 1st i cut the wingbeds into 3 pieces to hold the wings as i cover it. i put the 3/4 fiberglass over the wing and appy miniwax right?
|Apr 04, 2005, 03:45 PM
i found the fiberglass to be in an odd shape and i needed to put off a little less thn 1.5ft of it to get the right size
|Apr 04, 2005, 05:50 PM
covering the wing was easier than i thought. i brused the miniwax on and set it down on the bed. MAKE SURE TO HAVE WAXPAPER ON THE BED. after 1-2 hours i checked the wing and it seemed to look very nice. there were a few bubbles which were erased with a few strokes of the foam brush. now, to repeat the procedure on the other side!
|Apr 04, 2005, 07:05 PM
while waiting for the miniwax to set, i decided to start on the fuse. the fuse assembly is very simple and easy.the only pissible way to make a mistake here would be to put the fuse doublers on the wrong side. the interlocking parts make it idiot-proof.
|Apr 04, 2005, 08:37 PM
Garden City, GA
Joined Feb 2004
1,308 Posts
Remember to flow some thin CA into the threads that you cut with the self tapping screw and then thread it again. You're doing great!
|Apr 04, 2005, 08:52 PM
will do! i was shaping the nsoe and i tihnk i might have goofed. well, its not on there too strong, i can pull it off and re-do or something. anyway, pictures say a thousand words so ill let them explain. mainly what im wondering is, is the nosepiece too short?
|Apr 04, 2005, 11:33 PM
nothing to say on the nose? well i wasa about to start the tail assembly when i realized, im out of CA! so im stuck at where im at for now, but im happy with the progress i made. im a little scared of the end AUW because i tihnk i went a little overboard on the miniwax
|Apr 04, 2005, 11:49 PM
question on the glassing of the wing.
you took the beds and cut them into 3 sections? why 3 sections? so you are glassing each half of the wing separately? are you completely folding over the glass. . . if there are more details on this i would appreciate some of the finer points.
also, did you apply the minwax to the fiber glass on some other flat surface, then peel it up and transfer it to the wing core? i am visualizing all my mess ups as you progress with the build
thanks in advanced for the info,
who said there would be no practical use for an algebra book
|Thread Tools
|Similar Threads
|Thread Starter
|Last Post
|I got some Fan Fold what to build thread part II started by emoone!!!
|Don Sims
|Foamies (Kits)
|Jan 23, 2010 08:28 PM
|Mountain Models Tantrum Partial Build Thread..
|Apr 03, 2004 10:41 PM
|My Bobolink Build Thread (very Colibri like)
|Jim Poor
|Hand Launch
|Dec 10, 2003 04:48 PM
|Laird Super Solution Build Thread!
|Oct 29, 2003 07:20 PM
|Switchback re-build thread (or What the $#*& was that!)
|Jun 23, 2003 09:34 PM