text:
Susan Smith-Harmon
Sandy continues to damage Jersey shore with fire
Wednesday, 18 September 2013 01:16 Published in National NewsTOMS RIVER, N.J. (AP) — Superstorm Sandy still isn't done with the Jersey shore — investigators are blaming the storm for damaging electrical wiring that touched off last week's devastating boardwalk fire in Seaside Park and Seaside Heights.
And they also said similar danger could be lurking elsewhere underneath other boardwalks, businesses or homes that were exposed to flood waters from the Oct. 29 storm.
"I'm sure on every boardwalk everywhere (at the Jersey shore), there may be compromised wiring," said Ocean County Prosecutor Joseph Coronato. "We don't want to start a panic mode; we just want to be reasonable. If you're a property owner and you think your electrical work came in contact with water and sand, we strongly recommend you have it inspected."
Gov. Chris Christie's administration decided the state will use Sandy-recovery money to pay for debris removal. He also pledged $15 million in Sandy money to help rebuild the burned businesses.
Christie said Tuesday the state will let businesses affected by the fire postpone filing sales and use tax returns that were due this month until Oct. 21 to help them recover.
The boardwalk fire began accidentally Thursday in aged wiring that had been compromised by salt water and sand during the Oct. 29 storm, federal and county investigators said at a news conference Tuesday. The wind-whipped blaze destroyed more than 50 businesses in the two towns.
Seaside Heights Mayor William Akers, reached after the briefing, said there is no issue with potentially compromised wiring on the surviving sections of the boardwalk.
"We did a total rebuild. All 16 blocks got all new wiring," he said.
In Point Pleasant Beach, one of the approximately half-dozen Sandy-ravaged towns where businesses with electrical connections are located on the boardwalk, Mayor Vincent Barrella said streetlight wiring is all new in a section of the boardwalk that was rebuilt last winter.
But he said about half the boardwalk, including sections in front of businesses, still needs to be redone this winter. After the prosecutor issued his warning, Barrella said he instructed borough officials to work with the local electric company and identify any wiring that might need to be replaced as part of the upcoming work.
Flood-damaged wiring caused fires in several houses in Sandy-damaged communities once power was turned back on last November. Many homeowners had to replace their electrical wiring and main electrical boxes before moving back in.
Investigators said last week's fire began in wiring that dated to the 1970s, and was located under a Kohr's frozen custard stand and the Biscayne Candies shop last Thursday afternoon.
Jessica Gotthold, a senior special agent with the Bureau of Alcohol, Tobacco, Firearms and Explosives, said investigators located wires under the boardwalk that somehow came in contact with each other, causing an electrical arc that is believed to have started the fire. Coronato said those wires had been exposed to the storm surge and grating sand action of the storm, which compromised them.
But as far as why the wires contacted each other, he said, "we will never know."
The prosecutor said the investigation ruled out all other possible causes of the fire, including careless smoking or a deliberate act of arson. The wiring was inaccessible to the public, he noted.
Authorities even pulled financial records of the businesses involved in the blaze to make sure no one had a financial motive to start a fire.
"We left no stone unturned," he said. "This was not a suspicious fire."
Police searching for Vianney High burglar
Wednesday, 18 September 2013 01:06 Published in Local NewsKirkwood Police are asking for the public's help to catch a burglar who broke into Vianney High School early Sunday morning. Police say a man used a BB or pellet gun to break a door window to get inside about 2 a.m.
Police say he pulled on a mask after getting inside and tried to enter several classrooms. But he was caught on camera, both inside and outside the building.
Police say the suspect approached and left the school on foot via Maryhurst Drive.
He's described as a white male, 18-25 years old, wearing a blue T-shirt with chest emblem, two tone knit hat, blue jeans, and black shoes.
Anyone with information is asked to contact Detective Tim Brand at 314-984-6903 or the Kirkwood Police Department at 314-822-5858.
IL Medicaid cleanup yielding lower-than-hoped savings
Wednesday, 18 September 2013 00:02 Published in Local NewsCHICAGO (AP) - Illinois officials say the state saved about $44 million in five months because of a vendor's work to scrub unentitled Illinois residents from the Medicaid rolls. Department of Healthcare and Family Services Director Julie Hamos detailed the savings Tuesday at a legislative hearing in Chicago.
The work by Reston, Va.-based Maximus resulted in the state canceling Medicaid for more than 125,000 people. Outsourcing that task will cost the state about $70 million over two years.
Hamos says 40 percent of the people kicked off Medicaid had no medical costs in the past six months, resulting in lower than projected savings.
She says Illinois officials still would like to complete the contract with Maximus and will appeal an arbitrator's ruling that would require the contract to be canceled Dec. 31.
Latest News
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
Mason, No. 3 Auburn beat No. 5 Missouri 59-42
ATLANTA (AP) — Tre Mason struck a pose — a Heisman Trophy pose. Looks like the Auburn Tigers running back will get a shot at something he wants even more. A national title. Maso...
Economic bright spots not a sure boost for Obama
WASHINGTON (AP) — To a struggling White House, the economy that was supposed to be a political millstone is losing some drag. An uptick in growth and a downturn in unemployment gi...
NYC good Samaritans risk it all to save strangers
NEW YORK (AP) — At least a dozen good Samaritans in New York City have risked their own safety to save a stranger this year. Personal trainer Dennis Codrington is one of them. He ...
Police investigate East St. Louis' 20th homicide of the…
EAST ST. LOUIS, Ill. (AP) — Ambulance workers have found an 18-year-old man shot dead in East St. Louis, Illinois. The Belleville News-Democrat reports Roman Brooks was found in s...
Police: St. Louis knockout game report was false
ST. LOUIS (AP) — St. Louis police say a reported "knockout game" attack in the city has proven to be false. The Post-Dispatch reports that investigators plan to seek criminal char...
Boeing lawmakers take different approaches in Missouri
JEFFERSON CITY, Mo. (AP) — Two Boeing employees who are Missouri lawmakers took different approaches when the House considered a package of incentives for their company to assemble...
Missouri housing commission delays tax credits
JEFFERSON CITY, Mo. (AP) - Missouri's low-income housing commission has delayed the approval of millions of dollars of tax credits - apparently as an outgrowth of the negotiations ...
Collinsville man accused of drunk driving in fatal acci…
Police say a Collinsville man was drunk when he caused an accident that killed five people. The accident happened on November 23rd just before 10:30 in Hamilton County. Of the six...


text:
French Antique Clocks
Antique French Gold Gilt Bronze & Champleve Enamel Clock & Candlestick UrnsFrench Bronze And Gilded Mantel Clock , Silk Suspension , Strikes On Bell Antique French Rococo Figural Gold Gilt Winged Putti Angel Statue Mantle ClockAntique Clocks Superb 19th C French Gilt Figural & Sevres Porcelain Mantle ClockAntique Carriage Clock Rare French Mantle Clock 8 Day Jewled Mantel ClockAntique French Clock Movement By L P Japy & Cie With Pendulum, Dial & BackplateLarge Antique 19thc Waterbury French Rococo Style Bronze Ormolu Mantle Clock Antique Clocks -early 1800's French Gilt Ormolu Bronze Roccoco Mantel ClockRare Antique French Green Boulle H Marc Bracket Clock For RestorationAntique French Brass Carriage Clock - Time & Strike - Blue Delft Enamel Dial Antique Ormolu Mantle Clock 8 Day French Bronze Cubed Mantel Clock Caddy Top1830 Antique French Empire Marquetry Inlay Charles X Portico Neoclassical ClockHuge Antique Slate Mantel Clock French Striking Sienna Marble 8 Day Mantle ClockAntique Clocks -19th C French Japy Fils 2 Tone Gilt Ormolu Bronze Mantle ClockAntique Clocks -19th C French 2 Tone & Sevres Porcelain 8 Day Bell Mantle ClockOld Vintage Antique Slate / Marble French Mantle / Mantel Clock * See Video *Antique Clocks -19th C French Gilt & Sevres Porcelain 8 Day Mantle ClockAntique 8 Day Mantel Clock Striking French Mahogany Japy Freres Mantle ClockBeautiful Antique French Wall Clock At 1900 With RepetitionFrench Style Solid Rosewood Base 8 Day Waterwheel Industrial Ball Bearing ClockAntique Alarm French Gilt Brass Carriage Clock Travel 8 Day Mantle Mantel ClockGood Antique French Carriage Clock Cylinder Platform (1)Beautiful Antique C1870 Samuel Marti French Slate Clock W/ Exposed Escapement NrAntique White Marble Mantel Clock French Figural Gilt Striking 8 Mantle ClockFantastic C.1900 French Marble ~23" Mantle Clock W/ Columns & Lion; Works GreatBeautiful Antique French Westminster Chime Wall Clock At 19001855 French Vincenti Blue Delft Mantle Clock Medaille D'argent Angels PorcelainVintage French 8 Day Fontenoy Chime Wall Clock - Good WorkingAntique Clock -19th C French Solid Gilt Pierced Bronze Gothic 8 Day Mantel ClockAntique Clocks -early 1800's French Bronze Ormolu & Black Marble Mantle ClockAntique French Gilded Mantel Clock Rare Antique F. Martin French Art Nouveau Marble 8 Day Clock, Time Strike, RunsFrench Enamel Beating Heart Umbrella Clock-1920's Antique French F Marti 19thc Gilt Bronze And Porcelain Mantel Clock Dong BellBeautiful Antique French Fontenoy Westminster Chime Wall Clock At 1910/1920Stunning Cast Brass French Crystal Regulator Clock W/ Real Mercury PendulumFrench Colored Marble Mantle Clock Case With Pillars ProjectAntique Clocks -19th C French A.d.mougin Solid Bronze Architectural Mantel ClockAntique French Marble Portico Clock Set Vintage Georgian Style Elliot Oak Bracket Mantel Clock French Escape MovementAntique French R &co Mantle Clock Brass Carriage 8 Day Bedside Mantel ClockVictorian French Clock Movement Striking With A Bell19th Century Sebres French Bronzed And Gilt Metal Clock Of Cherubs Amazing Huge Ornate French Bronze Brass Copper Baroque Mantle Clock Works Nr YqzVintage Antique French Carriage Repeater Brass Clock With Key Rare Antique 19th C French Japy Freres Gilt&faience Porcelain Mantel ClockLarge Antique Cherub Mount French Porcelain Caramic Wall ClockAntique Brass Carriage Clock French France Complete W/ Original Beveled Glass! Large French Clock Movement With Visible EscapementBeautiful Antique Inlaid French Mantel Clock- Medaille De Bronze Signed MovementAntique Jaeger, Paris Car/truck 8 Day Dash Clock French? Working ConditionOld Brass French Carriage Clock - For Spares Or RepairAntique French Mantel Clock Rare 8 Day Chinoiserie Painted Dome Top Mantle Clock3 French Clock Pendulums & 1 R.a. #3Antique French Open Escapement Marble Granite Mantle Clock Time Strike Works 12"Quality Large Antique French Gilt Metal Momumental Grecian Figural Mantel ClockA Charming Antique French Good Working Order Brass Carriage Clock With KeyMini Square French Style Carriage Clock, 24k Gold PlateGood Small French Clock Movement - Vincenti & CieOval French Style Carriage Clock, Eight Day, Nice!!!C19th French Boulle Bracket Clock Ormolu Mounted Striking The Hour And Half HourAntique Balloon Drum French Mantel Clock Rare 8 Day Shell Boulle Mantle ClockPatented 1891 Antique Miniature French Ormolu Alarm Clock...works2 Japy Freres French Clock Movements For PartsAntique French Wall ClockTall Case Clock Movement Oldie FrenchTop Quality Beautiful Antique French 5 Glass Brass Repeating Carriage ClockFrench Style Floral Blue Cloisonne 4 Column Repeater Calendar Carriage ClockOld French Marble - Mantel Clock - Pendulum Clock To 1860/80Antique Coquerille Coulommiers Marble Slate Gilded French Clock Brocot Mvmt

subset: commoncrawl


text:
- December 6, 2012
- 12:16 p.m.
- Suggest removal
- Reply to this post
whywhywhy writes:
Very well written letter. It reminded me of the film clip of an older gentlemen griping about "Obamacare" at a public meeting and in the same breath saying, "keep your hands off my Medicare".
Want to participate in the conversation? Become a subscriber today. Subscribers can read and comment on any story, anytime. Non-subscribers will only be able to view comments on select stories.


text:
DTES picketers, businesses trade bullying barbs 0
Scott Clark, Aboriginal Life In Vancouver Enhancement Society executive director, has joined Downtown Eastside businesses in criticizing anti-gentrification picket lines outside upscale restaurants. (PHOTO DAVID P. BALL)
The anti-gentrification war in Vancouver's Downtown Eastside is heating up after a group of nonprofits and businesses labelled protesters as "bullies" Thursday.
While the picketers insist they are simply defending their neighbourhood from rising prices due to an influx of upscale businesses, critics have decried the start of a new picket line at Cuchillo, the second restaurant targeted.
"It is bullying," said Scott Clark, executive director of nonprofit Aboriginal Life in Vancouver Enhancement. "I've seen it first-hand myself: picketers yelling and screaming at customers going into Pidgin (restaurant), and all kinds of tactics that intimidate people.
"Gentrification is a real issue, but it's not just happening in the Downtown Eastside... We're just saying they've got to elevate their dialogue."
One picketer, known as "Formerly Homeless Dave," earlier undertook a month-long hunger strike over gentrification.
"We've made this a line in the sand," said the man who declined to give his name. "It's not just about one restaurant. If one is successful, there will be many more ... pushing up rents not only for residents, but also for small businesses that serve the low-income community here."
Crosstown Residents Association chair Fern Jeffries alleged she was bullied.
"I'm not easily intimidated, but I don't like being pushed and shoved and screamed at when I'm going out to dinner," she said. "These so-called peaceful protests can get pretty aggressive."
Resident Gloria Lakes said she hopes rich and poor "can exist together," but adds rents are increasing because of the neighbourhood upscaling.
"They're bringing in all these big restaurants," she said. "It's bringing all these people in who don't want us here. The rents are going up and they're trying to push us away from this part of town. Where are we going to go?"


text:
Browse our mobile site for the best experience on your device.
The Valley's Rock Station -Winchester
Listen to the FOX
Follow @rockwiththefox
John Boy & Billy - 6-10am
Scott Bradley - 10am-3pm
Whiskey - 3pm-7pm
The Sixx Sense - 7pm-mid
Doc Reno - 12am-6am
B-Man - weekends
Greg Travis - weekends
BC - weekends
Racing Rocks
Acoustic Storm
House of Blues
Photos & Babes
Fox Photos
Babe Vault (1000s of Babes)
Red Light District (Amateur Babes)
Thong of the Day
Hot Fox of the Day
Smokin' Fox of the Day
What's Hot!
FOX VIP Signup
FOX VIP - Edit Profile
Contest Rules
Last 10 Played
Videos on Demand
iheartradio Live Performances
Advertise With Us
Events Calendar
Clear Channel Communities
Storm Center
Work For Us
Winchester Deals
Q102 (Country)
Kiss 98.3 (Top 40)
Sports Talk 1550 (Sports)
Mix 95-7 (Hot AC)
Toots & the Maytals
Toots & the Maytals
World Is Turning
Original Release Date: July 29, 2003
Track Listing
1. Border Line
2. The World Is Turning
3. Feel Free
4. Hit Meck
5. Spend the Night
6. Blame on Me
7. Mini Conversation
8. Our Father
9. Love Is the Best
10. Jungle
11. Livity
12. Half Way Tree
13. Who Nuh Know
14. More and More
15. Honestly
Jackie Jackson: Bass
Pam Hall: Vocals (Background)
Barry Bailey: Horn
Noel Brownie: Keyboards
Radcliffe Bryan: Guitar
Glen DaCosta: Horn
Paul Douglas: Drums
Sly Dunbar: Drums
Bobby Ellis: Horn
Dean Fraser: Horn
Winston Grennan: Drums
Marcia Griffiths: Vocals (Background)
Carl Harvey: Guitar
Toots Hibbert: Bass, Guitar, Harmonica, Composer, Conga, Keyboards, Vocals, Producer, Executive Producer
David Madden: Horn
Nambo Robinson: Horn
Larry Silvera: Bass
Uziah "Sticky" Thompson: Conga
Mike Kelly: Executive Producer
Heather Cummings: Vocals (Background)
Dalton Brownie: Guitar
Steven Seagal: Guitar
Garfield McDonald: Engineer
Rudy Valentino: Guitar, Composer, Producer, Engineer
Leba Thomas: Vocals (Background)
Wayne Chen: Executive Producer
Carol Reid: Stylist
Bernie Pitters: Keyboards
Kirk Bennett: Drums
Romeo Gray: Horn


text:
We found 1 results in our internal search. The following list displays all posts that have prices, sales, events or other happenings related to Panasonic THL42E6S LED TV in Singapore, with the latest (December 2013) first. [ Skip to Google Powered Search ]
Courts 39th Anniversary Celebration Deals continue! Celebrate with them and get your dream items now in their 4-Day Celebration deals... MORE >>
Still no dice? Try more general queries or lesser keywords:
Get lots of high fun playtime for your children with this deal: $15 for Unlimited Playtime at SingKids PlaySystem Indoor Playground in 3 Locations (Worth $54) - that's 72% off the usual price! Learn how to get this deal before it ends soon... MORE >>
Create a Photobook at more than 90% off with this deal: $2.99 for 40-page Mini Square Softcover Photobook from Photobook Singapore (Worth $34) - that's 91% off the usual price! Learn how to get this deal before it ends soon... MORE >>
Amazon.com is now giving away FREE shipping to Singapore (with AmazonGlobal Saver Shipping) if your order includes at least $125 of qualifying merchandise... MORE >>


text:
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN. VOL. 9. NO. 4. APRIL 1990 389 Compaction on the Torus KURT MEHLHORN AND WOLFGANG RULLING Abstract-In this paper we introduce a general framework for com- paction on a torus. This problem comes up whenever an array of iden- tical cells has to be compacted. We instantiate our framework with several specific compaction algorithms: one-dimensional compaction without and with automatic jog insertion and two-dimensional com- paction. I. INTRODUCTION Fig. 1. A toroidal sketch. A COMPACTER takes as input a VLSI layout and pro- duces as output an equivalent layout of smaller area. An effective compaction system frees the designer from the details of the design rules, and hence, increases his productivity and on the other hand produces high quality layouts. For these reasons, compaction algorithms have gained widespread attention in the VLSI literature [4], [7], [9], [lo], [12], [15], [17], and are the basis for several computer-aided circuit design systems [2], [4], [ 1 11, [ 191, [211. Regular layouts composed of one- or two-dimensional arrays of identical cells arise frequently in practice, e.g., bit slice architecture or systolic arrays. Let S be the cell to be replicated. We address the following problem. Compact S into a cell S' such that cell S' still can be used to tile the plane (or an infinite strip). This problem is called the compaction problem on the torus, because a layout S can be used to tile the plane iff its left and right, and top and bottom boundaries are com- patible, i.e., if the cell S can be drawn on a torus, cf. Fig. Fig. 2 . Part of a large accumulator consisting of identical cells. This lay- out has been computed by toroidal compaction without jog insertion. 1. The compaction problem on a torus is interesting for three reasons: 1) row-like and array-like arrangements of a single cell arise frequently in practice. In such an ar- paction on a torus was called for. Several simple-minded rangement it is desirable to compact all instances of the approaches failed. Compacting a single cell does not cell identically, 2) to guarantee identical electrical behav- guarantee tileability , compacting the layout using the al- ior of all instances, and 3) to allow further hierarchical gorithm for hierarchical compaction by Lengauer [ 13) processing. does not guarantee that the instances stay identical, and Our own interest in compaction on a torus was stimu- compacting a single cell and insisting that the boundary lated by a Kulisch-arithmetic-chip designed by Lichter stays rectangular wastes area, although it guarantees tile- [ 141. A central component of this design is an accumu- ability. A first algorithm for toroidal compaction was pre- lator consisting of 1152 identical cells which are arranged sented by Eichenberger/Horowitz in [3]. However, in that into a 36 by 32 array, cf. Fig. 2. The fully instantiated paper only the special case of one-dimensional compac- layout overstrained the compacter of the HILL-system tion without jog insertion is considered and the complex- (although it can handle 100 000 rectangles) and so com- ity of the algorithm is not analyzed. In this paper we describe a framework for compaction Manuscript received September 6, 1988;revised March 10, 1989.This on a torus. It can be combined with several known com- work was supported by the DFG under Grant SFB 124,TP B2. This paper paction algorithms, e.g., one-dimensional compaction [4], was recommended by Associate Editor R . H. J . M . Otten. [ 121, one-dimensional compaction with automatic jog in- The authors are with the Department of Computer Science, Universitat des Saarlandes, D 6600 Saarbriiken, Germany. sertion [ 151, [ 171, and two-dimensional compaction [7], IEEE Log Number 8932831. to yield specific compaction algorithms. 0278-0070/90/0400-0389$01 0 1990 IEEE .OO 390 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN, VOL. 9, NO. 4. APRIL 1990 Our approach is very simple. Let the cell S have length L and height H. We draw S on a cylinder of circumference L and height H. If S is supposed to tile the plane (instead of a strip) then we also identify the upper and lower rim of the cylinder and obtain a torus. We now let the circum- ference shrink. In this way the features of the cell will move closer together until a tight cut, i.e., two features reaching their minimum separation, arises. These two features are keDt at their minimum seuaration from now on. We continue in this fashion until a cycle of saturated Fig. 3. A typical cylindrical sketch ( F , W ,P, L ) and its representation in the plane. Dark points and line segments are features, light lines are cuts around the cylinder (or torus) arises. At this point we conceptual module boundaries. Formally, the connected components have minimized the x-width of the cell but still guarantee formed by dark and light lines are the blocks of the partition P. Wires that it can tile a strip (or the plane). are shown as wiggled lines. In Section I11 we describe our approach in more detail and fill in some algorithmic details. We stay, however, used. We consider only the grid model in this paper; our on the generic level. In Section IV we instantiate our results extend, however, to any polygonal wiring norm. framework in three specific cases: one-dimension com- In the grid model wires are rectilinear paths with a mini- paction without jog insertion (Section IV-4. l), one-di- mum vertical and horizontal separation of 1. mensional compaction with jog insertion (Section IV . 2 ) , Of course, in practice, we have to consider different and two-dimensional compaction (Section IV-4.3). Fi- separation widths between wires and modules depending nally, in Section V we demonstrate our approach of to- on the used layers. However, to simplify notation we first roidal compaction by an example. ignore the layer assignment. In Section V we will explain how to extend our framework to more realistical processes 11. DEFINITIONS RESULTS AND and we also give some more details about the implemen- To give a precise definition of the cylindrical compac- tation. tion problem we introduce the notation of layout sketches. A cut C is any open line segment connecting two points It turns out to be an adequate terminology for the speci- of the sketch, say p and q , and not intersecting any fea- fication of layout optimization problems in different ture. The density of cut C is the number of crossings of models. Similar notations have already been used in sev- C by wires which are enforced by the topology of the eral other papers on compaction and routing [5], [6], [8], sketch, cf. Fig. 4. Crossings of C which can be removed [15], [16]. Since from now on we describe a cell S by its by deforming the wires do not contribute to the density. sketch, we also use the symbol S to denote the sketch. The capacity of a cut in the grid model is given by max { x- A cylindrical sketch is a quadruple (F, W , P, L ) con- length ( C ), y-length ( C ) } - 1, where x-length ( C ) ( y- sisting of a cylinder Z of circumference L, a finite set F length ( C ) ) is the length of C in horizontal (vertical) di- of features, which are points ( = point feature) and rection, cf. Fig. 4. A cut is called safe if its density does straight line segments ( = line features) on the surface of not exceed its capacity and it is called tight or saturated Z, a finite set W of wires, which are simple paths on the if its density is equal to its capacity. The following theo- surface of Z, and a partition P of the features F. Each rem was proved by Cole/Siegel [ l ] and Leiserson/Maley block of the partition is called a module. Fig. 3 shows an [8] for the grid model. example of a sketch. The features and wires of a sketch must satisfy the following conditions. Theorem I : A sketch has a routing iff all cuts of the sketch are safe. 1) Distinct features do not intersect and the endpoints of each line feature are point features. Actually, the results are slightly stronger. Let us call a 2) No wire may cross itself. cut p 4 critical, if either p and q are point features or at 3) Each wire touches exactly two features, which are most one of them lies on a line feature and the line seg- point features lying at the endpoints of the wire. They are mentpq is perpendicular to that line feature. Then a sketch called the terminals of the wire. is routable iff all critical cuts are safe. A point in a sketch is a point lying on a feature. Mod- With every cylindrical sketch S we can associate an in- ules form the rigid part of a layout and wires represent the finite planar sketch S" as follows. Let R be any vertical flexible interconnections. line on the cylinder. Then S" is obtained by unrolling the Sketches comprise the information of placement and cylinder and then tiling a strip with the unrolled cylinder, global routing. A (detailed) routing of a sketch (F, W, P, cf. Fig. 5(a). L), w = {P,, * , p , } , is a sketch (F, W', P, L ) , W' We are now ready to define the one-dimensional cylin- = {SI, * - , qm} , such that ql is homotopic to p I and q, drical compaction problem. The goal of compaction is to have the same endpoints and p I can be transformed con- displace the modules in the x-direction such that the re- tinuously into q1without moving its endpoints and without sulting sketch is routable and has minimal period, cf. Fig. allowing its interior to touch a feature in F, such that the 5(b). Let S = (F, W , P, L ) be a routable cylindrical sketch q,'s satisfy the constraints of the particular wiring model and let S" be the associated planar sketch. We denote the MEHLHORN A N D RULLING: COMPACTlON ON THE TORUS 39 1 Note that the pair (0, L), where 0 is the zero-vector, belongs'to C ( S ), since the sketch S is assumed to be rout- able. Also note that the sketch S" (2 ) can be wrapped around a cylinder of circumference 6, and hence, gives rise to a cylindrical sketch which we denote S ( d , 6). ( The essential conjguration space CO S ) of a sketch S consists of that connected component of C ( S ) which con- tains the pair (0, L), i.e., a configuration ( d , 6 ) belongs to CO S ) if the cylindrical sketch S ( d, 6 ) can be obtained ( from S = S(0, L ) by continuously shrinking the cylinder x-length of cut C = W and deforming the layout drawn on its surface while main- Fig. 4. A portion of a sketch with cut p4. The flow across f i is I . taining the routability of the sketch. With this notation we can state the compaction problem in the following way. De$nition: One-dimensional cylindrical compaction problem. Input: A routable cylindrical sketch S = (F, W , P , L). Output: A configuration ( d , 6 ) E CO( S ) such that 6 is minimal. Theorem 2. Let S = (F, W, P, L ) be a routable cylin- drical sketch. Then the essential conjiguration space ( CO S ) of the sketch S is a convex polyhedron. 1!2i +A'- (b) ... Proofi In [15] the analogous result for planar sketches was proved. Because of the correspondence be- tween cylindrical sketches and periodic planar sketches described above the result carries over. Fig. 5 . (a) A cylindrical sketch S with circumference A, its embedding in the plane and its unrolled version 3". The shown cut C has density 2 and We now state our main results. Let m = 1 F I be the wrapping number 1 . (b) The same sketch after cylindrical compaction. number of features. The circumference A has been reduced to A'. Theorem 3: (Cylindrical Compaction with Automatic Jog Insertion). In the grid model the cylindrical compac- different instances of a feature f b y j , i E Z . A displace- tion problem can be solved in time ment (or configuration) of S" is given by a vector d E RIFxZ; a(fl) is the displacement of featureJ. W',,, log m O(m3 + K log m ) = O(m4W',,, log m ) Of course, not all displacements make sense. Firstly, where W,,, = 1 + LH/Amln , H is the height of the J features in the same module must be displaced by the same amount, and therefore, we must have a(J) = d ( g i ) for sketch S,Aminis the period of the compacted layout, and K is the number of times a feature moves across a critical any two feature instances in the same module. Secondly, cut during compaction. features should not cross over during compaction and we, therefore, must have x,, + a(&) < x, + 2 ( g j ) for any The quantity K is a measure of how much the sketch two points p = ( x p , y p ) and q = ( x q , y,) where x,, < xq changes during compaction. We believe that the bound K and y, = y, and p lies on a featureJ and q lies on a feature 5 m4W',,, which we derive in Section IV is overly pes- gj. simistic. Let d be a configuration satisfying the two constraints Compaction without jog insertion is a special case of above. We can now define the sketch S" ( d ) in a natural theorem 3. Let us assume that wires are specified as rec- way. A pointp on feature instanceJ with coordinates (x,,, tilinear polygonal paths; view vertical wire pieces as y p ) in the sketch S" has coordinates ( x p + d ( f l ) , y p ) in modules and horizontal wire pieces as wires in the sense S"(2) and the wires in S"(2) have the "same" homo- of the definition of a sketch, cf. Fig. 6. Then the com- topies as in S";see [15] for a more precise definition. paction of such a sketch is tantamount to compaction We now have to restrict the configuration space C ( S") without jog insertion. of infinite sketches in the plane to cylindrical sketches. Theorem 4: (Cylindrical Compaction without Auto- This can be done by adding a third constraint enforcing matic Jog Insertion). Cylindrical compaction without jog the periodicity of the sketch. The conjguration space insertion can be solved in time 0 ( m2 log m ). C ( S ) G R F X R of a cylindrical sketch S consists of all pairs ( d , 6), d E, R F , 6 E W, such that the configuration Cylindrical compaction without jog insertion was pre- 2 E R F X Z with d ( J ) = d ( f) i6, f E and i E 22, + F, viously considered by Eichenberger/Horowitz [3]. They satisfies the two constraints above and S" ( d ) is routable. did not analyze their algorithm. 392 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN. VOL. 9, NO. 4. APRIL 1990 I I I I L - 1 Fig. 6. A sketch for compaction without jog insertion. Vertical wire seg- ments are treated as modules. -A+ A'=A ~ 6 Fig The effect of shrinking the circumference A by f > 0 in the ex- Our approach can also handle maximum and minimum aniplc of Vie. 8. Since w ( h . A ) = I . feature h moves to the right by an distance constraints which are specified by the user as long amount o E . Note that the cut gh may be tight in S ( A ) but it is not tight f in S(A - e ) . as the constraints are satisfied by the initial layout S. Since toroidal compaction amounts to cylindrical compaction in refer to w ( f,A ) as the wrapping number off and to d ( f, the presence of equality constraints between the upper and A ) as the distance from R to f in S(A ). the lower cell boundary our algorithms carry over to to- With these concepts it is now easy to define the sketch roidal compaction with unchanged running time. Finally, S ( A - E ) . The positionp(f, A - E ) of featurefin S ( A we want to mention that the algorithm underlying Theorem - E ) is given by d ( f , A) mod (A - E ) . The wire homo- 4 can be used for Kedem/Watanabe-like two-dimensional topy in S( A - E ) is defined in the natural way by consid- compaction [7]. ering the continuous transformation ( E grows starting at 0) from the positions p ( f, A) to the positions p ( f,A - 111. COMPACTION A TORUS:THE FRAMEWORK ON E ) , f E F. In this section we describe the general framework for Shrinking the circumference of the cylinder can be vis- compaction on a torus. For simplicity, we deal only with ualized as follows. We cut the cylinder at the reference the cylinder. Let S = ( F , W , P , L ) be the cylindrical line R and obtain a single copy of the sketch with left sketch to be compacted and let A = L . Then we have to boundary R and right boundary R'. We then move each compute an equivalent sketch with circumference 6 ' feature f to the right by an amount E * w ( f,6 ) and move smaller than 6. Intuitively this can be done by shrinking R' to the left by E , cf. Fig. 9. For small E no feature will the cylinder as shown in Fig. 5 . Since the approach of cross R', and hence, a cylindrical layout is obtained by shrinking is the main concept of our framework we have identifying R and R' . to give an exact definition of shrinking before we can de- rive the new compaction algorithm. Lemma 1. Let S( A) be the sketch obtained for the circumference a) Let C =fg be a cut and l e t x ( C , A) : = p ( g , A) - A of the cylinder and let R be a vertical line on the cyl- p ( f , A) + w(C, A ) A be the x-length of C in S(A). inder which we call the reference line. For a feature f let Then the x-length of C in S ( A - E ) is given by x ( C , A p ( f,A) be the distance fromfto the reference line when - e ) = x ( C , A ) + E(W(g,A) - w ( f , A ) - w ( C , A ) ) . going to the left starting inf, cf. Fig. 7. The local mean- b) If T ( A) exists then S( A - E ) is legal for E > 0 ing of "left" and "right" is defined by viewing the cyl- sufficiently small. inder from the outside. We refer to p ( f, A) as the posi- Pro08 a) Let Ar = A - E . Then tion off in the sketch S( A). For a cut C let the wrapping number w( C , A) be the number of intersections between x ( C , A r ) = p ( g , A') - p ( f , A') w(C, A') A' + C and the reference line R . We extend the concept of wrapping number to features = (p(g, A) + w(g, A) A) mod A' A as follows. Consider an auxiliary digraph G with vertex set F U { R 1. For every feature f there is an edge ( R , f ) of cost 0 and for every saturated cut C with endpoints f + w(C, A r ) * A' and g , where the left-to-right orientation is from f to g , = (p(g,A) + w(g,A). ~)modA' there is an edge (f, ) of cost w( C , A). We denote such g a cut C byfg; note that this notation is ambiguous since only the endpoints together with the wrapping number + w(C, A') * A - w(C, A') * E . identify a cut. First let us assume that the auxiliary graph G is acyclic; the other case is treated in the proof of A Let us assume for simplicity that p ( g , A) + w( g, A) lemma 3. E < A' a n d p ( f , A) + w(f, A) * E < A'; the other We then can compute a longest path tree T(A) with case is similar and left to the reader. Then w( C , Ar ) = root R in the auxiliary graph GA. Let w( f,A) be the length w ( C , A > , a n d h e n c e , x ( C , A ' )= x ( C , A ) + E ( w ( g , A ) of a longest path from R to f i n GAand let d ( f,A) = A - W (. " A) - w ( C , A ) ) . f, w(f, A) + p ( f,A), cf. Fig. 8 for an illustration. We b) Let d = f g b e any'cut. Clearly, if C is not tight in MEHLHORN A N D RULLING: COMPACTION ON THE TORUS 393 b) The number of iterations is bounded by m2Wmdx (Amln)where Amlnis the period of the final sketch. Proof: a) The bounds 0 Iw ( f , A ) and w ( f , A ) 5 m W,,, ( A ) follow immediately from the definition of L 2 - A -i R 4 wrapping numbers. We show next that w ( f , A ) is non- (a) (b) (C) decreasing for every f . Consider any S ( A ) and let E be Fig. 8. (a) Apart ofa cylindrical sketch S ( A ) with featuresf, g, and h . maximal such that S ( A - E ) is legal. Then there must be The cuts fg and gh have wrapping number 0 and cut jh has wrapping number 1. (b) The unrolled version of the sketch. (c) The auxiliary graph a cut C = & which is tight in S ( A - E ) and oversaturated CAwith the longest paths to all features assuming that the three cuts fg. in S ( A - E - 6 ) for 6 > 0. Thus by lemma la) we obtain 3, and f h are saturated. From the graph GA we obtain the wrapping w ( g , A ) - ~ ( f A ) - w ( C , A ) < 0. , numbers of features: w ( f , A ) = w ( g, A ) = 0 and w ( h , A ) = I . Now consider the layouts S( A - 6 ) where 0 5 6 < E . In these layouts exactly the cuts D = hk with w ( k , A ) = S ( A ) then C is not tight in S(A - E ) for E sufficiently w ( h , A ) + w ( D , A ) are tight. This follows from Lemma small. If C is tight in S ( A ) then there is an edge ( f , g ) l a and the definition of E . In particular, all cuts in T ( A ) of cost w ( C , A ) in the auxiliary graph, and hence, w ( g , stay tight. Moreover, the tree T ( A - 6 ) , 0 I6 < E , is A ) 1 w( f, A ) +w ( C , A ) by the definition of wrapping independent of 6. This can be seen as follows. As we in- number. Thus x ( C , A - E ) 2 x ( C , A ) . Since the crease 6 from 0 to E , the wrapping number of a feature h y-coordinates of the features do not change during shrink- increases by one whenever h moves across the reference ing, the capacity of C does not go down when passing line R on the cylinder. Note that in this case the wrapping from S ( A ) to S ( A - E ) . Also, the density of C does not number of all cuts incident to h and leaving h to the left change for E sufficiently small. Thus S ( A - E ) is legal goes up by one and the wrapping number of the cuts leav- for E sufficiently small. rn ing h to the right goes down by one. Thus the longest path Lemma 1 is the basis for our compaction algorithm. If tree does not change. The argument also shows that the T ( A ) exists, then the shrinking process yields a legal quantity w ( g , A - 6 ) - w ( A A - 6 ) - w ( C , A - 6 ) sketch of smaller period. This leads to the following al- is a constant independent of 6. gorithm. In S ( A - E ) that cut C becomes tight and is added to A w; S ( A ) + S ( * the initial sketch S has period w the auxiliary graph. Since w ( g, A - 6 ) - w ( f, A - 6 ) - w ( C ,A - 6 ) = w ( g , A ) - ~ ( f A ) - w ( C ,A ) < , *) while T ( A ) exists 0, and hence, w ( f , A - 6 ) + w ( C , A - 6 ) > w ( g , A - 6 ) for all 6, 0 5 6 < E , there is now a longer path to do let E > 0 be maximal such that S ( A - E) is legal; compute S ( A - E ) and T ( A - E ) ; g in the auxiliary graph. Thus we obtain T ( A - E ) by A c A - 6 ; replacing in T ( A ) the edge ( = cut) currently ending in g od; by an edge corresponding to C. Also, w ( g , A - E ) = ~ ( fA - E)+ w(C, A - E). , It remains to prove termination (Lemma 2) and correct- b) We have shown in part a) that the values w ( f,A ) ness (Lemma 3). We, therefore, define(,, ," A ) to be the are nondecreasing, that at least one such value is in- maximal wrapping number of any cut that cannot be re- creased in each iteration and that 0 Iw ( f , A ) Im - placed by a sequence of tight cuts of smaller wrapping W ( A m l n ) .Thus the number of iterations is bounded by number. m2maxr n a x ( A m i n ) * W wrnax(A) = max { W(C, A); Lemma 3. The algorithm constructs a sketch of minimum period. C = fs is a tight cut Proof: Let Sfin the final sketch. It is clearly reach- be and there is no sequence f o , * * ,f k able (the algorithm shows how) from the initial sketch S - by a continuous transformation which only passes through f = fo, g = f k , C, = J J + I is tight for legal configurations. Thus Sfin= S ( do, Ao) for some (do, O ~ i < k , A,) E Co(S). Since the algorithm stops with a cyclic auxiliary graph and w ( C , A ) = c w ( C j ,A ) } . I we obtain a cyclic sequence of tight cuts running around the torus. Because of this sequence further shrinking be- We prove upper bounds for W,,, in various compaction comes impossible. More formally, in Sfin there must be a models in Section IV. In particular, W,,,(A) = 1 for sequence&,__* ,fk of features such thatfo = h Dand the * compaction without jog insertion and W,,,(A) I 1 + cuts C, = J J + I , 0 I i < k , are tight. Let x , be the L H / A J for compaction with jog insertion in the grid x-length of C, and let w, be its wrapping number. Since model. the cuts form a cycle, we obtain xo + + ~ k - 1 = A0 Lemma 2. - (WO + * * -+ Wk-,). a) 0 Iw ( f , A ) Im W,,,,,(A) for a l l f a n d A and Let S' = S ( d , 6 ) with ( d , 6 ) E C o ( S )be arbitrary. For w ( f , A ) is nondecreasing for every f. 0 5 A I1 consider the configuration ( d ( A ) , 6 ( A ) ) with 394 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN. VOL. 9. NO. 4. APRIL 1990 d ( A ) = ( l -X)do+Xdand6(h)=(l -h)Ao+h6. Then ( d ( A ) , 6 ( A ) ) E Co(S) since Co(S) is convex by Theorem 1. Next observe that the cuts C, exist in S( d ( A), 6 ( A ) ) for X sufficiently small and that their density is the same as in Sfin. Thus their capacity must be no smaller than in Sfin, hence, their x-length must be no smaller and (a1 (b' than in Sfin. Their total x-length is 6 ( X ) ( wo * + + Fig. 9 (a) h moves to the left relauve t o the cutfX_and hits this cut in S(A Wk-l), and hence, 6 ( h ) IA for X small. Thus 6 IA . . - c ). The cutfg will then disappear. If the cutfg is tight then both cuts and Sfin have minimal period. 5 a n d 5 will be tight in S(A - c ) , and hence. cases 1 and 3 . 1 . ar& together. (b) /Lalso moves to the left with respect to theline segment fg. At this point we have proved termination and correct- Thus the cut fg will arise, say in_S( A --E). The cut fg cannot be satu- rated because otherwise the cutsf.? and hg would be saturated in S(A - ness of our generic compaction algorithm. We fill in some E ) , and hence,f.? would be oversaturated in S(A - e - 6 ) for 6 > 0 more algorithmic detail next. The data structures are the small. Thus (f, ) E T ( A - E ) and g would never become visible from h longest path tree T = T ( A) and the set A = A ( A ) of cuts. f. With every cut C E A we associate the minimal value E ( C ) IV. SPECIFIC COMPACTION ALGORITHMS of E such that C becomes tight in S( A - E ) . The value In this section we derive specific compaction algo- E ( C ) is easily computed from the density and the capacity rithms from the general framework of Section 111. o f C i n S ( A ) u s i n g L e m m a l a ) . LetEl = m i n { ~ ( C ) ; C E A } . For every feature f let E ( f ) be the minimal value 4. I . One-Dimensional Compaction Without Jog of E such t h a t p ( f , A - E ) mod (A - E ) = 0, i . e . , f moves across the reference line in S(A - E ) . Let €2 = Insertion m i n { E ( f ) ; f E F } . Finally, let e 3 = min{E; A(A - E ) We assume that wires are specified as rectilinear polyg- # A ( A ) } and let E = min(E,, c 2 , c 3 ) . We distinguish onal paths in the input sketch S. We treat vertical wire three cases according to whether E = E , , E = c 2 , or E = segments as modules and horizontal wire segments as t 3 .The three cases are not mutually exclusive. wires in the sense of the definition of sketch. The only cuts which have to be considered are horizontal cuts con- Case I . E = E , : Let E = E ( C ) = fs. Let T8 be the necting pairs of features which are visible from each other. subtree of T rooted at g. We perform the following ac- Thus there are only O ( m ) critical cuts, the set A of cuts tions. does not change and W,,, = 1 since no cut can wrap 1) I f f € Tg then STOP, T(A - E ) does not exist. around twice. 2) I n c r e a s e w ( h ) b y w ( f ) + w ( C ) - w(g)forevery For a feature h , let deg ( h ) be the number of cuts in- feature h E Tg; here w ( h ) denotes the current wrapping cident to h . Since all cuts are running horizontally there number of feature h E Tg. are no crossings between cuts. Thus the set of cuts defines 3) Delete the current edge ending in g from T and add a planar graph on the set of features and we have the edge ( f,g 1. 4) Recompute E ( D ) for every cut D incident to a fea- 2 x number of cuts = c deg ( h ) = O ( m ) heF ture h E T,, recompute E ( h ) for every h E Tg and rqcom- pute e l , c 2 , and e 3 . for example, the number of cuts is linear in the number Case2. E = c2: Let E = c ( f ) , f ~ F . of features. For an illustration see Fig. 7. Also, actions 4 and 5 of our algorithm are executed at most m times for 5) Increase w( f ) and w( C ) by one. For all cuts C each h by Lemma 2a), and hence, the total cost is &,EF m leaving f to the left increase w ( C ) by one and for all cuts leaving f t o the right decrease w ( C ) by one. Update E ( f ) - deg ( h ) log m = O ( m 2log m ) ; the log m factor results from the fact that a change of E ( D )requires a heap op- and c 2 . eration. This proves Theorem 4. Case 3 , E = e3: A either grows or shrinks at A - E . Case 3. I.: A shrinks, say cut C disappears, cf. Fig. 4.2. One-Dimensional Compaction With Job Insertion 10. 6) Delete C from A. Update E, and e 2 . As mentioned in Section 11, the idea of compaction with automatic jog insertion presented in [15] is to replace a Case 3 . 2 . : A grows, say cut C appears, cf. Fig. 10. given layout by a routable sketch and then to compact the sketch preserving routability . Finally a routing algorithm 7) Add C to A, compute E ( C ) and update c l and €3. like the one given in [8] is used to add the final local Remark: In the high level description of the algorithm, routing. The main advantage of this method is that no spe- Cases 2 and 3 did not appear because case 2 does not cial treatment of jogs has to be done when computing the change the longest path tree and the values E ( C ) . Case optimal position of modules. 3.1 either removes an unsaturated cut or occurs together To apply our generic algorithm of Section I11 to cylin- with Case 1. Case 3.2 creates only unsaturated cuts, cf. drical compaction with automatic jog insertion we need a Fig. 10. bound on the maximal wrapping number W,,, of critical LvIcnLnUKIY A N U KULLIIYU: C U M Y A C I I U N U N I HI2 I U K U S 5Y3 u(C,A) mfcmou Linr fs f5 f6 (a) (b) (a) (b) Fig. 1 1 . (a) A cut C = 2 with wrapping number w ( C, A ) > I + H/A in the unrolled version of a sketch S ( A ) . g' is the feature at distance A Fig. Io l a ) A sketch with line featuresf;. . . . .f6. The arrows denote cuts left of g. (QA feature hinside the triangle V (f, g') specifying two g, used for compaction without jog insertion. The sketch of ( a ) specifies cuts D' = jh and D" = hg. the planar graph of cuts given in (b). Let K be the number of times actions 6 and 7 are per- formed. Then the running time is O ( K log m m . + cuts and we need a way to handle the set A of cuts. The (mW,,,) (mW,,, log m ) ) since the maximal wrapping upper bound of W,,, is given by the following lemma. - number of any feature is m W,,, by lemma 2 and since Lemma 4. the maximal number of critical cuts incident to any fea- Let S be a cylindrical sketch of height H and period A . ture is m W,,,; note that for each feature g there can be up Let W,,, be the maximal wrapping number of any tight to W,,, different cuts with endpointsfand g. cut which cannot be replaced by a sequence of shorter Finally, note that K I3m4 W;,,. This can be seen as tight cuts. Then W,,, I1 + L H / A 1 in the grid model. follows. Consider a pair ( f,g ) of features and one of the W,,, possible cuts C with endpointsf and g. Any feature Proofi We use the concept of shadowing, cf. [l], h can cross C at most 3m W,,, times since between con- fs [16]. Let C = be a saturated cut with w ( C , A ) > 1 + secutive crossings the wrapping number of at least one of H / A , cf. Fig. 1 l(a) and let g' be the feature in S" lying the three features must have been increased. Thus the run- at distance A left of g. Then we consider the triangle V ( f, g , g') with sides C = fs, g and C' = f ' C " = If there 2. ning time is O ( K log m + m3 W;,, log m ) = O ( m4 log m ) and Theorem 3 is proved. We believe are no features inside this triangle we define h = g ' ; oth- that our bound on K is overly pessimistic. erwise we chose a feature h inside the triangle such that the line segments D' = @ and D" = are both cuts and 4.3. Two-Dimensional Compaction Without Jog the triangle V (f,g , h ) contains no features, cf. Fig. Insertion ll(b). Finally, we describe how two-dimensional compaction Since there is no feature inside triangle V ( f,g, h ) , all can be done on the torus. Since it is well known that this nets that have to cross cut C also have to cross cuts D' or problem is NP-hard, we cannot expect to obtain a poly- D" or they are terminating at feature h , cf. Fig. Il(c). nomial-time algorithm to compute an optimal solution. Therefore, we obtain for the densities of the cuts dens Therefore, we propose to extend the method of Kedem/ ( C ) Idens (D' ) + dens ( D ") + 1. For the capacities Watanabe described in [7] to toroidal compaction. This we have cap ( C ) = cap (D' ) + cap ( D ") 1 because + method for two-dimensional compaction in the plane is D' and D" both have slope at most 1. Since cut C is sat- based on a branch and bound approach with exponential urated (cap ( C) = dens ( C ) ) we can conclude that cuts running time and it uses a one-dimensional compaction D' and D" are both tight. For this reason D' and D" can algorithm to compute the lower bounds in the bound step. replace the longer cut C . This means that whenever we When we replace the used one-dimensional compaction preserve cuts D' and D" from becoming oversaturated cut algorithm by our algorithm for cylindrical compaction C will be save, too. Therefore, all cuts with wrapping (Theorem 4), we obtain a natural extension of the com- number greater than 1 + H / A can be replaced by a se- paction method from the plane to the torus. The main ad- quence of shorter cuts and we conclude w,,, I 1 + vantage of this extension is that two-dimensional com- H/A. paction of large arrays of processors can be done with a We store the set of cuts as in [17], i.e., for each point running time that only depends on the complexity of one feature f we store the set of critical cuts incident to f in processor. We now give some more details about this ap- clockwise order in a balanced tree. Therefore, we can use proach. the results of [ 171 to derive the running time of the generic The difficulty of two-dimensional compaction is the in- algorithm presented at the end of Section 111. teraction between horizontal and vertical movement of The algorithm consists of several operations labeled by features. For example, one has to decide whether it is bet- numbers 1 to 7. Actions 1 to 5 take time O ( deg ( h ) log ter to separate two featuresfand g by a horizontal or ver- m ) for each feature h whose wrapping number is in- tical cut, cf. Fig. 12. Therefore, in the compaction method creased where deg ( h ) is the number of cuts incident to h presented in [7], decision variables df,g E { 0, 1 } are in- and actions 6 and 7 take time O(log m ) each. troduced for every pair of interacting features. The value 396 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN. VOL. 9, NO. 4. APRIL 1990 onstrate the program we compact the accumulator layout mentioned in Section I. It consists of 1152 identical cells each containing about 1000 elementary rectangles. For this example cylindrical compaction is done as follows. First we create the set A of cuts. Since the HILL design system uses a hierarchical description of symbolical lay- Fig. 12. Sketch (a) gives an example of two interacting featuresfand g . Feature g can either be moved to the left (b) or downwards (c). The outs that is similar to rectilinear stickdiagrams, the cuts decision variable d,8 determines which kind of movement has to be used can be computed by an extension of the plane sweep for two-dimensional compaction. method presented in [lo]. This only takes about 15 CPU seconds for one direction because only one single proces- sor has to be investigated. Our compaction algorithm then of df,.Kdetermines whether a horizontal or vertical sepa- needs 8 CPU seconds to compute the minimal period A and ration betweenfand g has to be used. Let d denote the to compute legal coordinates for all features and wire seg- vector of all decision variables. Then for every fixed d the ments. two-dimensional compaction problem can be solved by Finally we apply the wire length minimization algo- separately applying one-dimensional compaction in the rithm presented in [20] for further layout optimization. horizontal and vertical direction. This works on the torus This can be done within 17 s of CPU time. A part of the as well as in the plane. The remaining problem of com- produced layout is shown in Fig. 2. Similar results were puting the optimal decision vector d can be solved by the obtained for several other arrays of processors. All men- branch-and-bound algorithm. By this method one starts tioned programs are implemented in PASCAL and are with all decision variables being undefined, and then tries running in a UNIX environment on a VAX 8700 com- to fix the variables in such a way that the layout area pro- puter. duced by the two passes of one-dimensional compaction Again please note that the time and space requirements will be minimal. Essentially this is done by investigating of cylindrical compaction only depends on the complexity a decision tree and pruning away subtrees that cannot im- of one single cell of the accumulator. For this reason, in- prove the objective function. For this purpose we need stead of the pessimistic time bound derived in Section IV lower bounds and upper bounds of the layout area. To we expect that also cylindrical compaction with automatic obtain a lower bound we compute the minimal horizontal jog insertion will be practicable. period A : $ and the minimal vertical period A::,","' by one- dimensional cylindrical compaction of the given sketch, ACKNOWLEDGMENT 5 ignoring cuts corresponding to decision variables that are not yet fixed. Obviously, the product A: $) -is The authors wish to thank M. Jermm, St. "her and Th. Schilz for many helpful discussions. M. Jerrum sug- a lower bound of the compacted layout area. Upper bounds can be obtained by inserting a horizontal or ver- gested that toroidal compaction is the adequate approach tical cut for every unfixed decision variable. This way the to compacting regular structures. branch-and-bound method can be used for two-dimen- sional compaction on the torus. REFERENCES [ I ] R. Cole and A . Siegel, "River routing every which way, but loose," V. DETAILS ABOUT THE IMPLEMENTATION AND in Proc. 25th Ann. Symp. on Foundations of Computer Science, pp. 65-73, Oct. 1984. EXPERIMENTAL RESULTS [2] A. E. Dunlop, "SLIP: Symbolic layout of integrated circuits with In the previous sections we have used some simplifi- compaction," Computer Aided Design. vol. IO, no. 6. pp. 387-391, 1978. cations to introduce our framework of toroidal compac- [ 3 ] P. Eichenberger and M. Horowitz, "Toroidal compaction of sym- tion. However, to implement the presented algorithms one bolic layouts for regular structures," in Proc. ICCAD 1987, pp. 142- has to take care of several technical problems. Some of 145, 1987. [4] M. Y . Hsueh, "Symbolic layout and compaction of integrated cir- them are mentioned below. cuits," Ph.D. dissertation EECS Division, Univ. of Calif., Berkeley, For example, we have to handle multiple layers and 1979. we have to respect the minimal separation widths speci- [5] S. Gao, M . Jerrum, M. Kaufmann, K. Mehlhorn, W. Riilling, and C . Storb, "On homotopic river routing," presented at BFC'87, Bonn, fied by a set of design rules. This can be done by creating Germany, 1987. cuts for all relevant pairs of layers separately and then [6] M. Kaufmann and K. Mehlhorn, "Local routing of two-terminal joining all cuts to obtain the set A used in our algorithm. nets," in Proc. 4th STACS'87, LNCS 247, pp. 40-52, 1987. [7] G . Kedem and H. Watanabe, "Optimization techniques for IC layout To avoid changes of layers within one net we treat and compaction," Tech. Rep. 117, Comput. Sci. Dep., Univ. of contacts as modules. Rochester, N Y , 1981. For compaction with jog insertion the definition of [8] C. E. Leiserson and F. M. Maley, "Algorithms for routing and test- ing routability of planar VLSI layouts," in Proc. 17th Ann. ACM capacity and density has to be modified to handle the width Symp. on Theory of Computing, pp. 69-78, 1985. of wires. 191 C. E. Leiserson and R. Y . Pinter, "Optimal placement for river rout- . _ Until now we have only implemented cylindrical com- ing," SIAM J . Computing, vol. 12, no. 3 , pp. 447-462, 1983. [IO] T. Lengauer, "Efficient algorithms for the constraint generation for Paction without jog insertion and we are using it as Pan integrated circuit layout compaction," in Proc. 9th Workshop on of the VLSI design environment HILL ([ 1 13). To dem- Graphtheoretic Concepts in Computer Science, pp. 2 19-230, 1983. MEHLHOKN A N D RULLING: COMPACTION ON THE TORUS J7I [ 1 I] T. Lengauer and K . Mehlhorn, "The HILL system: A design envi- Kurt Mehlhorn received the Ph.D. degree in ronment for the hierarchical specification. compaction. and simula- computer science from Cornell University, Ith- tion for integrated circuit layouts," in Proc. Con5 011 Advunced Rr- aca, NY in 1974. search in VLSI. 1984. In 1975 he became a full professor at the Uni- [ 121 T. Lengauer. "On the solution of inequality systems relevant to IC versity of the Saarland in Saarbriicken. There he layout,'' J . Algorithms. vol. 5 , no. 3, pp. 408-421. 1984. is currently chairman of the Computer Science [ 131-. "The complexity of compacting hierarchically specified layouts Department. His main research interests are in the area of data structures, computational geometry, of integrated circuits," in Proc. 1982 FOCS, pp. 358-368, 1982. [I41 P. Lichter, "Ein Schaltkreis fur die Kulischarithmetik," Diplomar- parallel algorithms and VLSI design. beit. Universitat des Saarlandes, 1988. In 1986 Dr. Mehlhorn received the Leibnitz- [I51 F. M. Maley, "Compaction with automatic jog insertion," presented Award from the Deutsche Forschungsgemein- at 1985 Chapel Hill Conference on VLSI. 1985. schaft. [I61 -. "Single-layer wire routing." Ph.D. dissertation. MIT, 1987. * [I71 K. Mehlhorn and S . Naher, "A faster compaction algorithm with au- tomatic jog insertion," in Proc. 1988 MIT VLSI Conf,, pp. 297-314, Wolfgang Rulling received the Dr. rer. nat. de- 1988. gree in computer science from the University of [I81 R. Y. Pinter, "The impact of layer assignment methods on layout Darmstadt in 1983. algorithms for integrated circuits," Ph.D. dissertation Dep. Elect. In 1984 he joined the Computer Science De- Eng. Comput. Sci., MIT, 1982. partment at the University of Saarland in Saar- [ 191 W . Rulling, "Einfuhrung in die Chip-Entwurfssprache HILL," briicken to work in a research project on VLSI de- Techn. Bericht 04/1987, SFB124, Universitat des Saarlandes. 1987. sign systems. Since 1989 he has been a professor [20] C . Storb, "Minimierung der gewichteten Weglange eines Graphen," at the Department of Computer Engineering and Diplomarbeit, FB10, Informatik, Universitat des Saarlandes, Saar- Microelectronics of the Fachhochschule Furtwan- briicken, 1985. gen. His main research interests in the area of [21] J . D.Williams, "STICKS-A graphical compiler for high level LSI VLSI design are layout generators, layout opti- . - design," in Proc. Nut. Computer Conf.. pp. 289-295, 1978. mization techniques. and design for testability.
views: | 6 |
posted: | 6/15/2010 |
language: | English |
pages: | 9 |


text:
Big Deal London-Based Burger and Lobster Chainlet Opening in Flatiron
Lobster rolls and hamburgers, together at last.
Skip to content, or skip to search.
Skip to content, or skip to search.
Lobster rolls and hamburgers, together at last.
The Chicago restaurant serving it says no one should take offense.
"I never told these people they could use my name for this."
This guy can basically have a burger a day from now on. Or fourteen a day.
The not-so-secret hamburger restaurant steps out of its hotel digs for the first time in ten years.
American cheese? How about Edam?
"When you move to outlaw hamburgers, it's a pretty clear sign that your food system is broken."


text:
OWSLA to send label all-stars on Canadian Good Times Tour
While OWSLA head Skrillex is boarding his own Mothership to go on a fall tour, he's sending label delegates North to spread to good word to his Canadian brethren. The M Machine, Alvin Risk, David Heartbreak, Kill Paris and Blood Diamonds will hit the road this November on OWSLA Presents…Good Times, hitting four provinces in nine dates. Though the tour is something of a pared down version of the label's 2012 outing, the tour recap above gives a taste of what to expect from the insanity. To get down, turn up, and wild out, check the tour dates below.
Skrillex and Alvin Risk release 'Neon Mix' and music video to 'Try It Out' [Updated]
Before there was Dog Blood, Jack U, and Leaving EP, Skrillex was a name almost purely associated with jaw-dropping dubstep. That's not to say it was all he produced, simply, Skrillex had inspired a mass convergence of fans around the colloquially (and satirically) termed genre of "brostep." Out of this reign came many heavy singles — one of the more famous ones being his collaborative stint with Alvin Risk, "Imma Try It Out." Nearly a year after its official release, the OWSLA-nauts have unveiled an interesting "Neon Mix" to the single. Perhaps even more compelling than the boisterous VIP is the video that accompanies it, featuring cameos by Dillon Francis, Diplo, 12th Planet, The Prodigy, Flava Flava, Jack Black, and many more.
The "Neon Mix" will be released on iTunes at an undisclosed date with two more accompanying B-sides.
[Update] Skrillex has uploaded the "Try Harder" mix, one of eight total revisions. The version features a modified intro and heavily syncopated second drop. Click past the break to hear it.
Alvin Risk – Junkfood EP [Free Download]
You certainly can't fault Alvin Risk for experimentation. From his feverish Infinity EP, to remixing the Prodigy, to singing on his own dubstep production "Skyclad," Alvin Risk is a producer who's demonstrated time and time again a will to push his sound to the furthest reaches of his imagination. His newest Junkfood EP is an embodiment of this frenetic, semi-maniacal creative spirit. The four track EP oscillates between familiar obliterating bass on "Put Em Up" and "Wash Dat," to the stuttering synths and engine revving of "Zoom!" and furious breakbeat of "Tronce." Seemingly a sporadic assemblage of genres, Junkfood EP is tied together by its spontaneous drive and carnival-like panache. You can download the entire EP for free from Alvin Risk's website.
Designer Drugs & Alvin Risk – Empty Hearted (Original Mix)
The latest project from OWSLA arbiter Alvin Risk is a boisterous dubstep collaboration alongside New York duo Designer Drugs. "Empty Hearted" begins with a quick four-on-the-floor beat bolstered by transposed lyrics and clicking 8-bit synths. The drop that ensues is a bit rambunctious, but balanced out nicely by an overriding big room melody. Along the same lines as his previous release "Skyclad," Alvin Risk has lent his own voice to the production, warping and tuning it into a robotic and melancholic vocal track.
Designer Drugs & Alvin Risk – Empty Hearted (Original Mix) [Preview]
After returning to the production front with "Skyclad," budding OWSLA talent Alvin Risk has teamed up with New York duo Designer Drugs for a ripping dubstep track entitled "Empty Hearted." While Designer Drugs are known more widely for their harder electro selections, the two have dabbled in dubstep on various occasions, and their newest collaborative effort alongside bass music purveyor Alvin Risk is evidence for their taste in 140 bpm destruction. Just as he did in "Skyclad," it appears Risk has once again lent his own vocals to the track, albeit with a bit more auto-tuning. "Empty Hearted" is scheduled for release on April 16th on Ultra Records.
Dream Hotel's Red Bull Guest House plays host to Miami's greatest intimate events of 2013
For those in the know, the Red Bull Guest House (aka the Dream South Beach Hotel on every other week of the year) was a WMC hot spot this year for catching marquee talents in an intimate setting populated by sunbathing models and A-list onlookers. With eye-opening lineups featuring the likes and labels of Skrillex, A-Trak, and Boys Noize, the poolside performance spot mostly catered to more new-school genres like electro, dubstep and trap over the course of the past week.
Alvin Risk – Skyclad (Original Mix)
It's been a while since we last heard some original material from Alvin Risk – his Infinity EP was nearly a year ago — but the wait is finally over, as the plaid-sporting Skrillex-understudy has released "Skyclad" today on OWSLA. Beginning with an enticing, orientally-flavored string intro, "Skyclad" picks up with sedative broken beat and a yearning vocal track (which we've confirmed as Alvin Risk's own). Risk's lyrics aptly precede the drop, as he sings: "I wanna show you how, to lose yourself." With its roaring undertones and spitting laser-like synths, the ensuing drop is not for the faint of heart.
"Skyclad" is classic Alvin Risk through and through, and a worthy return to original material for the OWSLA protégé. Adoring fans will find much cause to celebrate in Risk's latest output.
Purchase: Beatport
Alvin Risk – Skyclad (Original Mix) [Preview]
Aside from providing remix duties for Monsta and the Prodigy, Alvin Risk has been a bit quiet on the release front. With today's preview of "Skyclad," it appears Alvin Risk is gearing up for his first original production since his Infinity EP. Beginning with a series of chiming synths, "Skyclad" picks up with a deep beat and a yearning vocal track (presumably from Risk himself as no vocalist is cited). The preview ends all too abruptly before the would-be screeching, spastic dubstep drop takes over. "Skyclad" will be released on March 5th via OWSLA.
Zedd releases official music video for 'Clarity'
Last week Zedd captivated audiences with his acoustic performance of "Clarity" alongside Foxes and Alvin Risk on the David Letterman Show. The young producer continues to gain recognition and fans through his evident musical talents, securing himself a permanent position in the dance music elite. This week Zedd released an official video for the acclaimed tune, which heavily features vocalist Foxes in an on-screen love affair. Zedd, who only appears occasionally throughout the video, allows the visuals and Foxes to charm watchers, while his precise production tickles our ears.


text:
Illegal dumping
What is illegal dumping?
Image courtesy of LGAQ
Illegal dumping is the unlawful deposit of waste over 200 litres in volume (about as much as an average wheelie bin holds). In addition, waste over 2 500 litres in volume will attract higher penalties.
Waste dumped illegally commonly includes:
- bags of rubbish
- garden waste
- building material
- household goods, such as whitegoods, mattresses and furniture
- abandoned cars and parts
- tyres
- hazardous substances.
Why does illegal dumping happen?
People dump waste illegally to avoid disposal fees at landfill sites or because they do not want to spend the time or effort disposing of or recycling their waste properly.
Offenders often go to extraordinary lengths to illegally dispose of waste and avoid detection and prosecution. Ironically, legal disposal may have cost far less in fuel, time and effort.
Why is illegal dumping a problem?
Illegal dumping ruins the image of Queensland and damages its reputation. Sites where waste is dumped illegally:
- degrade the local environment and threatens native wildlife
- reduce property value
- attract more dumping, other illegal activities and antisocial behaviour
- decrease community pride
- cause health and safety risks
- attract vermin and insects, such as mosquitoes and mice
- block drains and waterways causing flooding and erosion damage
- increase the risk of fire hazard
- require time, money and energy to be cleaned and repaired.
Where does illegal dumping occur?
Small amounts of illegally dumped waste are generally found:
- roadside
- in parks and reserves
- in car parks
- on vacant blocks of land
- beside charity bins, garbage bins or skips.
Larger items are dumped in isolated areas such as bushland reserves, national parks, and industrial or building sites.
Legal disposal and recycling
Illegally dumped items are a lost resource because many items can be recycled, such as:
- organic garden material
- aluminium cans
- fridges
- computers
- tyres
- car bodies.
Local councils offer a variety of information and services for disposal of excess rubbish, green waste and larger items.
The advice on correct waste disposal is available here.
Reporting illegal dumping
The new Waste Reduction and Recycling Act 2011 gives anyone the opportunity to report littering or illegal dumping from a motor vehicle, trailer or vessel—where a registration number is known and observed by the reporter.
If someone reports illegal dumping from a vehicle, a penalty infringement notice will be issued to the registered owner of the vehicle in the first instance. If the registered owner did not commit the offence, they can lodge a statutory declaration and nominate another driver, another person in the vehicle or vessel who was responsible for the illegal act, or advise of the sale of the vehicle.
The penalties for illegal dumping reflect the seriousness of the offence and range from $1 600 up to $110 000 as the maximum penalty for prosecution of a corporation if contested in court.
* Requires Adobe Reader


text:
Due to the weather conditions from Tropical Storm Andrea affecting the Chapel Hill area, the start of the NCAA Division I Baseball Super Regional between North Carolina and South Carolina will be postponed until Saturday, June 8 at Noon on ESPN.
Click here for the original story.
Welcome to SECTalk.com
Welcome to SECTalk.com -- The Home of 6 Straight National Titles! You are currently accessing our site as a guest which means you can't access all of our features such as social groups, sports betting, and many more. By joining our free community you will have access to all of these great features as well as to participating in our forums, contacting other members, and much more. Registration only takes a minute and SECTalk.com is absolutely free, so please join today! If you have any problems registering or signing in, please contact us. |
Latest Topics
Latest News
Top High Fived
Top Bettors
Super Regional Game Postponed Due To Inclement Weather
Started by GAMECOCK_FAN, Jun 07 2013 08:09 AM
Similar Topics
The First Cold Weather Super Bowl
Started by secsportsfan, 05 Dec 2013 In: Other Leagues → The Pros- 23 replies
- 147 views
Mizzou Basketball To Face Florida On ESPN Super Tuesday Feb. 4
Started by SECTalk.com, 19 Aug 2013 In: The East → Missouri Sports → Missouri News- 0 replies
- 100 views
UK Slated for Super Tuesday Five Times in 2014
Started by UKat, 19 Aug 2013 In: The East → Kentucky Sports → Kentucky News- 1 reply
- 103 views
Florida Selected for Trio of ESPN Super Tuesday Games
Started by gatoraus, 19 Aug 2013 In: The East → Florida Sports → Florida News- 0 replies
- 110 views
Florida Selected for Pair of ESPN Super Tuesday Games
Started by gatoraus, 19 Aug 2013 In: The East → Florida Sports → Florida News- 2 replies
- 106 views
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users


text:
Kelis has just filed her financials with the court, making her case to get support and baby expenses from estranged hubby Nas.
Kelis says from 11/08 to 4/09, her average monthly income was $21,616. Hardly poor, but way less than what she and Nas were pulling in while she was with him.
Kelis, who is ready to give birth, has some pretty hefty expenses -- $80,831 a month ... way more than she says she makes.
Kelis says she hasn't toured in a year and most of her income comes from her concerts.
Kelis says she spends $14,861 on her mortgage. Her nanny costs $3,500 a month. She spends $15,000 a month on entertainment, gifts and vacations -- not too shabby. And she says it cost $175 to have the "baby rug dry cleaned."
And there's this ... Kelis says she wants to buy "storage to bank the baby's blood when he is born. The banking is the collection and storage of the stem cells found in the baby's umbilical cord." It's used to treat 70 life-threatening diseases. It all costs $$$.
Posted at 12:44PM on Jun 18th 2009 by Mike
I say NO. Why should a man STILL have to pay her, when he has the child the SAME amount of time. Is he not incurring the same bills? Does he not have to feed and cloth the child? My brother has 50% custody and still has to give her 50 a week. Why?? She has her own clothes, bedroom, etc just as at her moms. I truly do not understand the partial to women. It is because we go thru hell during labor? GET OVER IT, and yep, Im a woman, I dont get child support, alimony, or anything from their father. He doesnt even have half custody. These are my children. I work MY butt off for them. So should every other mother and quit trying to make a man into a living ATM just because you spread your legs open and said yes to that shiney diamond.
Posted at 1:05PM on Jun 18th 2009 by wow
Wow is right. Hahaha, I think your children are lucky to have a Mother like you. It seems to me that they will be taught independence, self reliance and responsibility. I wish there were more Mothers out there like you.
Honestly, is she stupid? Sell the house, raise your own child or let Nas do it (as you're apparently unwilling to foot your part of the bill), stop entertaining and traveling so much and voila, not only do you have enough, you have extra! You divorced, he's not your meal ticket anymore. He should be paying for the child, not for you to play dress up and vacation every 2 weeks.
For those defending her, remember she gets half his income in CA. Her greedy ass wants more on top of that. Sell the house, raise your own kids! If you can't, let Nas raise them, he's paying for them anyway.
This is why I tell my son everyday not to get married. If its real love the woman won't mind. Get your "female life partner a nice ring. Treat her like a queen. But NEVER get married. EVER.
I just think the monthly expense requests are way too extreme. How can someone pay 55, 000 a month + ??
You are doomed if you are that excessive. It's a sin.
She too should be ashamed of herself asking for that kind of money, even if he is a total punk a**.


text:
BEIRUT: Dar al-Fatwa slammed Monday a security apparatus under the office Prime Minister Najib Mikati, accusing it of fabricating false reports that some Muslim scholars had formed "armed gangs."
However, a statement from the PM's office dismissed Dar al-Fatwa's claims and said the religious body was trying to involve security agencies in political disputes.
"We have received some information recently that the security agency directly linked with the Prime Minister is fabricating reports about some Muslim scholars in Dar al-Fatwa and falsely accusing them of forming armed gangs," the statement from Dar al-Fatwa, Lebanon's top Sunni religious authority, said.
According to the statement, the reports are aimed at tarnishing the reputation of the scholars over their political stances.
"Such slander is a very dangerous issue and we cannot be silent over it and we are not used to giving in to such [fabrications]," the statement said.
Lebanon's Grand Mufti Sheikh Mohammad Qabbani has been at odds with Prime Minister Mikati over a dispute at Dar al-Fatwa.
The PM's office responded to Dar al-Fatwa, saying "the statement issued from Dar al-Fatwa claiming there are fabricated security reports about some scholars in Dar al-Fatwa are full of false claims."
"Unfortunately, some in Dar al-Fatwa are trying to involve security agencies in [political] disputes," the statement said.
"[Such attempts] will not stand in the way of setting things on their right course."


text:
One could surmise from recent discussions at city council in Saskatoon, and certainly at other council tables, that the customer is having their say on what should be done with the proverbial public purse. The debate is getting emotionally charged, but councils and administrations need to be careful not to over-react. It is far too simplistic to suggest the solution is to raise taxes, spend the money and the problem is solved. There needs to be some consideration for the way tax dollars are being spent and whether there is real return for residents and homeowners.
New construction in Saskatoon's industrial sector will likely slow in 2014, according to ICR's 2013 winter industrial survey.
Saskatchewan posted strong year-over-year job growth and the lowest unemployment rate in Canada in November, according to Statistics Canada's labour force survey released Friday.
The Saskatoon Blades practised Friday at Credit Union Centre for the first time since returning from a winless U.S. Division road trip.
There was no shortage of big stories during the fall sitting of the third session of the 27th Legislative Assembly of Saskatchewan, which concluded this week. New essential services laws, potash problems and a scathing auditor's report were among the hot topics at the sitting's end, but other stories dominated the agenda for most of the legislative period.
The Saskatoon Blades practised Friday at Credit Union Centre for the first time since returning from a winless U.S. Division road trip.
There wasn't any shortage of big stories during the fall sitting of the third session of the 27th Legislative Assembly of Saskatchewan, which concluded this week.
New construction in Saskatoon's industrial sector will likely slow in 2014, according to ICR's 2013 winter industrial survey.
Saskatoon is falling behind in sports tourism due to its lack of adequate facilities, says a Tourism Saskatoon executive.
Saskatchewan's premier says PotashCorp shareholders should make sacrifices along with the 440 employees who lost their jobs this week.
Saskatoon's Stefanie Lawton has earned a berth at the Scotties Tournament of Hearts Women's Provincials to be held in Tisdale from Jan. 8-12.
Rick Pilon was known as a stay-at-home defenceman in the National Hockey League.
Saskatchewan's premier says PotashCorp shareholders should be asked to make sacrifices along with 440 employees who lost their jobs this week.
Saskatchewan's privacy commissioner says the Ministry of Highways needs to take responsibility after a worker snooped on a driver.
Premier Brad Wall says he thinks the Saskatchewan Party government, now two years into its second term, is in good shape overall when it comes to public perception — but he doesn't take anything for granted.
Don McMorris hadn't sat long on the government benches before he made it clear that, except for its location on the map, he knew little about Saskatoon and cared even less.
If the Crown has its way, Christopher Sean Pascal stands to become Saskatchewan's youngest designated dangerous offender. Testifying in Regina Court of Queen's Bench on Wednesday, the 21-year-old admitted he needs help dealing with alcohol and anger problems.
Labour Minister Don Morgan says the provincial government's new plan for essential services is based on common sense, but critics of the old system say they're not yet sure if they support the changes.
With a challenge of the existing essential services legislation looming in the Supreme Court of Canada, the Saskatchewan government has preemptively introduced a new plan for essential services in the province.


text:
How many wets should a 3 day old make? Since midnight, we've had one wet and 2 dirty. He's been on my breasts 6 times today for 15-30 each feed. TIA!
BF question
Posted 02/22/2013
Chea +Justin =JLP born 2/19/13
I'm a cding, bfing, baby wearing, baby food making mamma to Jaxon Lee!
( . Y . ) Silver boobies.....so far!
Comments (2)
Posted 02/22/2013
I think it's 6-8 pee diapers in 24 hours.
Proud Mama to Harper Joy (8.27.10) and my Valentine's Day baby, Cohen Conrad (2.14.13)
Posted 02/22/2013
The nurses in the hospital said one for every day old until 4 days old (usually when milk comes in) and then it is like PP said.
DD 1/9/11 via c-section
DS 2/16/13 failed VBAC turned RCS
What's on your mind?
Create a new postYour growing child
Your 9-month-old: Week 4
Your baby's personality is really emerging now. She may be very social, granting broad smiles to everyone she meets, or a little more shy, hiding her face when well-meaning strangers try to engage her. Read More


text:
Cashmere Featherweight Scarf
Scarves are a classic, elegant style that make her feel beautiful. She doesn't want to wait until the middle of winter to put one on. This fashionable lightweight scarf is something she can wear as soon as the air is brisk. More
Don't Miss Out Today! Save 20% on all personalized gifts. Use REDSHOP20 at checkout to get your savings!$129.95 | MORE DETAIL |
Featured Offers
Custom Wedding Gifts
Personalized photo frames, albums & keepsakes. Heirloom quality!
Wedding Day Ownership
A must have for every Bride & Groom. Framed Certificate & Profile
Hot 'n' Spicy Month Club
We know that some like it HOT! So add a little spice to their lives.


text:
Ask Mr. Smarty Plants is a free service provided by the staff and volunteers at the Lady Bird Johnson Wildflower Center.
Can't find the answer in our existing FAQs, submit a question to Mr. Smarty Plants.
Need help with plant identification, visit the plant identification page.
From: Austin, TX
Region: Southwest
Topic: Diseases and Disorders, Trees
Title: Problems with Cedar Elm in Austin, TX.
Answered by: Jimmy Mills
Cedar ElmUlmus crassifolia (Cedar elm) with its glossy green leaves, smaller than those of American Elm, is an attractive landscape plant. (more info)
Mr. Smarty Plant has found that is is very hard to diagnose tree problems from a written description, but you have given some clues that will allow some reasonable guesses. Along with my guesses, I will provide some links that will help you determine what the problem may be.
The symptoms you describe; yellowing , dry leaves with the top-most leaves showing evidence of a chewing insect perhaps, could be caused by several things, but Dutch Elm Disease is probably not one of them.
Dutch Elm Disease (DED) is caused by the fungus Ophiostoma novo-ulmi which is introduced to the tree by the native elm bark beetle, Hylurgopinus rufipes and the lesser European bark beetle, Scolytus multistriatus.
The first symptom observed in American elm is yellow foliage on one or more branches, from late spring to midsummer. The affected foliage soon becomes wilted and brown; this symptom is called "flagging." This doesn't sound like what you described. These three links have more information about the disease.
University of Illinois
Yellowing can be a symptom caused by an aphid infestation, which seems to be common in Austin this summer. This link from UC Davis describes the pests and possible control measures.
Another pest that could account for the yellowing is spidermites. Reading the two links below could make you a neighborhood expert on these little plant suckers.
Colorado State University
UC Davis
Bacterial leaf scorch can cause yellowing, but the images shown in these two sources don't look to me like what you described.
Bartlett Tree Research
The United States Nattional Arboretum
Since aphids and spidermites lack chewing mouth parts, we can't blame the chewed leaves on them, however a possible culprit could be the Elm leaf beetle. The two links below give details about these destructive bugs.
Colorado State University
University of Illinois
The bottom line is that you need someone knowledgeable about tree sto take a look at your elm tree to make an assessment of the situation. This person could be a Certified Arborist , or someone from the Travis County Office of Texas AgriLife Extension.
Apple trees for Dothan, AL
April 01, 2009 - I would like to plant early, mid and late season apple trees in my area Dothan Al.What types can I plant that will help pollinate each other? I have plenty of room and planting some crabapples trees w...
view the full question and answer
Propagating a Magnolia tree from a twig cutting in New Hampshire.
November 02, 2011 - I have a twig cutting from a rare magnolia tree I found on a farm in central New Hampshire. The tree seems to be at least one hundred years old. It was in full bloom in late August and I was told by t...
view the full question and answer
Small tree for Houston
October 27, 2010 - I want to plant a tree southwest of my one-story house. The area is 25 feet wide, from the house to the power line. Desirable qualities include being a Texas native, deciduous, drought tolerant, and h...
view the full question and answer
Non-native Royal Empress tree with only green leaves from Chambersburg PA
July 12, 2013 - I have 3 Royal Empress trees in my yard that are between 2-4 yrs old and have never been any color other then big Green leaves. Do you know when they will turn Purple?
view the full question and answer
Planting live oak trees in summer in Austin
June 09, 2011 - We would like to plant a few live oak trees in our front yard for shade and animal protection. As it is very hot and dry right now, can we plant now? If not, when?
view the full question and answer
Support the Wildflower Center by Donating Online or Becoming a Member today. Mr. Smarty Plants wants you to be his Facebook friend. Click the Facebook icon to add yourself to Mr. Smarty Plants list of friends. |


text: Paul Suffers Narrow Loss to Romney in Maine Rep. Ron Paul narrowly lost the Maine caucuses to GOP rival Mitt Romney Saturday. Paul polled 36 percent of the vote, compared to Romney's 39 percent. Several communities elected to hold their caucuses later, but those votes won't count. (Feb. 11) Tags: Associated Press News Ron Paul Mitt Romney Video Clips Politics


text:
Prosecution builds case against Gary man accused in killing
By Ruth Ann Krause and Carrie Napoleon Post-Tribune correspondents October 3, 2013 6:26PM
Robert Lewis III, was sentenced Monday to life in prison for killing a Griffith woman. | Provided
Updated: November 5, 2013 6:34AM
CROWN POINT — Jurors heard testimony Thursday in the murder trial of a Gary man that described the dead woman's strangulation injuries and surveillance video from a karaoke bar showing the victim talking with the defendant.
Robert Lewis III, 40, faces life without parole if convicted of charges of murder in perpetration of a robbery and murder in perpetration of criminal deviate conduct.
He has pleaded not guilty to those charges and separate counts of murder, robbery, criminal deviate conduct and resisting law enforcement in the April 2, 2011, death of Jennifer Kocsis, 37, of Griffith.
Kocsis' body was found outside Riley School, 1301 E. 43rd Ave., Gary, about seven hours after witnesses saw her leave Pepe's Mexican Restaurant in Griffith with a man who has been identified as Lewis. Kocsis, who had gone there to sing karaoke, told a friend she was giving a guy a ride home.
Dr. John Cavanaugh, a forensic pathologist with the Lake County Coroner's Office, pointed out Kocsis' injuries to jurors on crime scene and autopsy photos. He said Kocsis suffered blunt force trauma injuries around the face, neck and back of the head, as well as cuts, contusions and scrapes, possibly from being dragged or falling and sliding on a hard surface.
He said the head injuries likely rendered Kocsis unconscious shortly after they were sustained.
Additional injuries, including coin-shaped bruises in her neck and throat area, bruises to the right and left side of her larynx and a broken hyoid bone — the bone at the base of the tongue and above the larynx — were consistent with strangulation.
"This is what you see in classical or textbook manual strangulation," Cavanaugh said when asked to describe the injuries.
Gary Police Department Detective Larry Robertson was the last witness to take the stand. He testified Kocsis could be seen on Pepe's surveillance video talking with the man to whom she gave the ride, later identified as Lewis, at the restaurant's bar and then leaving the restaurant with him.
Robertson's testimony regarding clothing found burned in a garbage can at the home of Lewis' girlfriend, information based on witness interviews, drew a steady stream of hearsay objections by the defense and prompted the court to recess for the day.
In earlier testimony, Lake County police evidence technician Kyle Sopko said after Lewis' arrest, he photographed Lewis' hands. Lewis had a small cut on Lewis' right hand and discoloration or apparent bruising in the knuckle area. Sopko also noted the hand and the right index finger were swollen.
At the request of defense attorney T. Edward Page, Sopko looked at Lewis' hands in court and said the apparent discoloration on the back of his hand was still evident and that the cut had left a scar, but that he did not see any swelling on Lewis' hands.
Jurors also viewed several photographs of Kocsis' car, including some showing suspected blood stains on the trunk, back window and steering wheel, as well as a tooth or bone fragment on the driver's side near the rear passenger seat window.
Police found a key amid burned debris at a home in the 4600 block of Buchanan Street in Gary eight days after the homicide. Among the items that had been burned was a shoe with the letters USPA on the sole. One witness recalled Lewis wearing U.S. Polo Association shoes at Pepe's before he left with Kocsis.
The trial resumes at 8:30 a.m. Friday.


text:
Recent Posts
Notes from Last Week's Moodle Meet-up
September 25, 2013 -
FPH Classroom Updates
August 19, 2013 -
Moodle News!
April 22, 2013 -
More on MOOCs
March 01, 2013 -
Time Shifting
January 10, 2013 -
FPH Classroom Updates: Before & After
January 02, 2013 -
MOOC Attack: Confessions of a Coursera Drop-out
October 15, 2012 -
The Kindle Fire: "Appears Serviceable"
October 09, 2012 -
iPads, GPS, and one Bad Elf
September 28, 2012 -
September 21, 2012 -
Classrooms 360°
April 25, 2012 -
Recap on the Spring Moodle Lunch
April 02, 2012 -
Google Presentations for Class Projects
February 28, 2012 -
Open Education: Give and Take
February 16, 2012 -
Tech for Teaching: Fall 2011 Recap
January 18, 2012
Keeping Track of It All
Hello again, Caro Pinto here, ready to talk about tools for managing my media diet.
There are so many blog posts, news pieces, journal articles, and white papers I want to read during the day. Unless it's breaking news or critical for a project that I am working on in the moment, I don't read content I discover immediately. Instead, I use a variety of services to store and organize what I read to read or retrieve later. Generally, I read my treasure trove of articles on my iPad.
Instapaper: Designed for iOS devices, Instapaper allows you to save web pages to read later. Using a bookmarklet in my web browser, I can save current web pages later. Instapaper is embedded in Twitter for iPhone and for iPad which I use daily. I can save links directly from those clients to read later. Instapaper allows you to store articles to read offline, so when I travel, I always make sure I have a long queue of articles and long form journalism pieces to read on the go.
Read It Later: Another service that allows readers to save web pages for later. Operates in all mobile platforms. Another solid choice for those who want to save items to read later online or off.
Reading Lists: Safari allows users to save web pages for later and creates reading lists right into the browser. If you don't have a tablet or smartphone, this is a good option.
Readability: This a neat tool that allows users to clean up web pages for easy reading. For a subscription fee, one can save articles to read later on another device, most notably the Kindle. I use their free Chrome extension to clean up text on the web for easy reading.
Zotero: Not only is Zotero a fantastic bibliographic management system, it's also a great tool to capture web pages and attach pdfs of articles to annotate and share. It is my go to tool for tracking potential library purchases or articles I might want to teach in the future.
Happy Reading!


text:
The promise of viruses as biotech tools will help molecular biology fulfill its true potential.
The promise of viruses as biotech tools will help molecular biology fulfill its true potential.
Researchers studying differences in how individuals respond to stress are finding that genes are malleable and environments can be deterministic.
In an essay entitled "Nurture, Nature, and the Stress That is Life," neurobiologists Darlene Francis and Daniela Kaufer envision a future where science moves past the nature vs. nurture debate in considering differences in human behavioral responses to stress.
A snapshot of the most highly ranked articles in microbiology and related areas, from Faculty of 1000
Nerve signals control T cell responses, helping to explain inflammation and stroke.
A bacterial outbreak at a Chinese University prompts the firing of administrators and highlights more systemic concerns.
September 1, 2011
|In Chapter 13, "Altruism," author Oren Harman discusses how George Price's and John Maynard Smith's 1973 formulation of evolutionarily stable strategy (ESS) meshes with examples of altruism in nature.


text:
Sort by: Date | Relevance
Our client in Fort Worth, TX is looking for a UNIX Administrator for a direct hire opportunity. This global organization is headquartered here in Texas. The selected candidate will have the following skill set: Position Description: The UNIX Administrator is accountable for installing, configuring, monitoring, troubleshooting and maintaining all servers running on an AIX Operating System to ensure...
Full job description at Monster
Posted Wed 27th November
firstname.lastname@example.com About Sedaa Sedaa Corporation was founded in 2000, and is headquartered in Lafayette, CA in the San Francisco Bay Area. Sedaa works with a wide range of businesses across many industries - from organizations in emerging markets with less than 500 employees, to Fortune 100 corporations supported by thousands of employees around the globe.At Sedaa, we specialize in finding the righ...
Full job description at Monster
Posted Mon 18th November
Your Team : Program Software Development Program Software Development uses leading technology and automation to create and support systems that make broadband and phone service affordable to millions of Americans. In cooperation with our internal customers, we build and optimize systems which enable USAC to distribute over $6 billion annually to qualified applicants. We're looking to expand our te...
Full job description at Monster
Posted Wed 13th November
JOB TITLE: Web Systems Administrator - Apache/Tomcat This position is for a mid-level/senior Web Application server administrator. You will be responsible for installing/upgrading Apache/Tomcat and other open-source software on a large number of platforms (primarily Solaris) utilized with the Defense Finance Accounting Service (DFAS). In addition, you will have to work with Java developers on mult...
Full job description at Monster
Posted Tue 26th November
Red Hat Linux Systems Administrator Location: Austin, TX Job number: 132001 Position type: Full-time For immediate consideration, please apply directly at: https://home.eease.adp.com/recruit/?id=7461991 Job Description: The Austin Information Technology Center (AITC) provides System Administration support for many UNIX based servers. These servers must be installed, configured, secured, backed up,...
Full job description at Monster
Posted Mon 2nd December
Overview: We are currently seeking a highly motivated individual to join the TTNET™ Monitoring and Deployment Automation team. The team is responsible for ensuring the TTNET™ environment is monitored 24/7 for any failures – from hardware to services. TTNET™ Systems Administrators need to be familiar with the administration and management of different operating systems, administration and managemen...
Full job description at Monster
Posted Tue 3rd December
Grant Thornton is collaborative, entrepreneurial and on the move. As part of a dynamic global organization of 30,000 people serving clients in more than 100 countries, we have the agility and focus it takes to be a leader. We are committed to capitalizing on our strengths and serving dynamic organizations that share our values and drive. Our global values of collaboration, leadership, excellence...
Full job description at Monster
Posted Tue 19th November
PrincetonOne is currently seeking a Kronos Systems Analyst to act as the technical point of contact for the Kronos Workforce system. This individual will also act as a liaison and a resource between business and technical teams. Responsibilities: Responsible for technical programming/administration of the Kronos Workforce timekeeper system, including but not limited to; Creation and maintenance of...
Full job description at Monster
Posted Fri 6th December
Office managers, executive assistants, secretaries, production assistants, sales assistants, professional shoppers, legal secretaries, and virtual assistants are just a few of the job titles covered in the administrative support industry. According to the Occupational Outlook Handbook, secretaries and administrative assistants ranked among the largest occupations of 2004. Employment, however, is expected to grow more slowly than average through the year 2014. Turnover is also very high within this industry as administrative professionals move on to other opportunities or are promoted. Advancement is possible through developing skills, earning certifications in software applications, business writing, project management, or planning, and proving proficiency within the company.
Find more administrative assistant jobs on Monster.com.
Learn how to write a resume, find relevant resume samples, read through resume tips, and then create your resume on Monster's resume builder.
Employers, get tips on how to write an Administrative Assistant Job Description.