text:
Join us to share the bounty of the season with our Willamette Valley neighbors! We've set a goal to collect 200,000 pounds of food for donations to the Oregon Food Bank network this holiday season. Click here to read more about the food drive and hunger in Oregon.
Visit any of the 80 participating wineries listed below with your donation of non-perishable food items or cash by December 20. Many wineries are offering discounted tasting fees, raffle tickets and special pricing. Note: winery hours vary—please consult individual websites and event calendars before visiting.
Online donations to the Willamette Cares Food Share can be made here.more details

subset: commoncrawl


text: Healthy Recipes Healthified Sassy Cinnamon Cookies Recipe E-mail recipe Print recipe To save this recipe, register now! Quick Info: Servings Contains Nuts Contains Wheat/Gluten Contains Dairy Contains Egg Nutritional Info (Per serving): Calories: 80, Saturated Fat: 1g, Sodium: 35mg, Dietary Fiber: 0g, Total Fat: 3.5g, Carbs: 10g, Cholesterol: 10mg, Protein: 1g Exchanges: Other Carb: 0.5, Fat: 1 Carb Choices: 0.5 Recipe Source: Prep Time: 25 mins Cook Time: 10 mins Rest Time: 15 mins Total Time: 50 mins Ingredients 3/4 cup(s) sugar 1/4 cup(s) butter, or margarine, softened 1/2 teaspoon vanilla extract 1 large egg(s), 1/4 cup fat-free egg product 1 1/4 cup(s) flour, all-purpose 1/2 teaspoon cream of tartar 1/4 teaspoon baking soda 1/8 teaspoon salt 1/2 cup(s) baking chips, cinnamon 1/2 cup(s) nuts, pecans, chopped 2 tablespoon sugar 1 teaspoon cinnamon, ground Recipe Tip: Parents can be a positive influence on children by guiding them toward healthy food choices and active lifestyles, by nurturing them and setting the limits they need. When you are a role model to your children you not only help them, you help yourself as well. Preparation 1. Heat oven to 375°F (if using dark or nonstick pan, heat oven to 350°F). In large bowl, beat 3/4 cup sugar, the butter, vanilla and egg with electric mixer on medium speed, or mix with spoon, until creamy. Stir in flour, cream of tartar, baking soda and salt. Stir in cinnamon chips and pecans. 2. In small bowl, mix 2 tablespoons sugar and the cinnamon. Shape dough by tablespoonfuls into 1-inch balls. Roll balls in cinnamon-sugar. On ungreased cookie sheet, place balls 1 inch apart. 3. Bake 7 to 10 minutes or until set and light brown. Immediately remove from cookie sheet to wire rack. E-mail recipe Print recipe To save this recipe, register now!


text:
Mexican Eats: Downtown Bakery
Downtown Bakery has been serving Mexican food in the East Village for almost twenty years. If you haven't eaten their burritos, swollen with refried black beans and crumbly orange rice, or indulged in the hangover obliterating powers of their huevos rancheros, then you've at least walked under the blue and white awning that shoots over the sidewalk. Downtown Bakery began as an Italian establishment, but over the years it's become a staple taqueria in the East Village. More


text:
Click Here to Watch the Whole Video in HD at Boynapped
Boynapped features young lads who are kidnapped, tied-up, gagged, teased and then either left bound or dumped off on the side of the road by their gay seducers.
Pegs have always been popular on BoyNapped and this scene with newbie London teen Liam Strider and Adam Watson will blow your mind. Hung from the rafters, Liam is powerless to the abuse Adam has in mind. Adam loved dishing out pain and having his boys service him. In this scene Liam takes peg pain to such an extent he almost passes out. This little twink is relieved when Adam cuts him down and demands a blow-job which ends in Liam licking up Adam's dominant load.
Pixels: 320X240 | Bitrate: 350K
Pixels: 640X480 | Bitrate: 700K


text:
A wireless telephone user obtains the telephone number of a vendor by activating the wireless telephone to receive to transmit a prompt signal to an active advertisement source and to receive from the advertisement source a response signal containing the telephone number of the advertising vendor. The telephone number can then be used to automatically place a call to that vendor. Advantageously this arrangement can be used to place a call to a vendor without having to either memorize the telephone number or to write it down.
1. A method of transmitting advertising information from a billboard to a wireless telephone where said wireless telephone is capable of transmitting signals at a regular wireless frequency band and at other than the regular wireless frequency band, comprising the steps of:
receiving a signal transmitted from a wireless telephone at a billboard, said signal being other than the regular wireless frequency band and, in response to receiving said signal, automatically transmitting a second signal from said billboard that is to be received and stored by said wireless telephone, said second signal including the advertising information related to said billboard, whereby the advertising information can be retrieved from the wireless telephone for use by a customer of the wireless telephone.
2. The method of claim 1, wherein the step of transmitting a signal includes transmitting the telephone number of said wireless telephone.
3. The method of claim 2, further including the step of transmitting said telephone number of the wireless telephone from said public display to an entity associated with said public display over a public switched network.
4. The method of claim 1, wherein said advertising information includes a telephone number.
5. The method of claim 4, further including the step of establishing a connection to said telephone number from said wireless telephone over a public switched network.
6. The method of claim 1, wherein the step of transmitting a signal from the wireless telephone includes the step of transmitting the signal over a frequency of a cordless telephone.
7. The method of claim 1, wherein the step of transmitting a signal from the wireless telephone includes the step of transmitting the signal over a frequency of the wireless frequency band adjacent to the regular wireless frequency band.
8. The method of claim 1, wherein the step of transmitting a signal from the wireless telephone includes the step of transmitting the signal over a frequency of an infrared signal.
9. A method of transmitting information from a publicly displayed advertising source to a wireless telephone comprising the steps of:
receiving a signal from a mobile wireless telephone at a billboard, said signal including the telephone number of the wireless telephone;
in response to receiving said signal: a) automatically transmitting a second signal from said billboard that is received and stored by said wireless telephone, said second signal including information related to said billboard, and b) automatically transmitting said telephone number of the wireless telephone from said billboard to an entity associated with said billboard; and
storing said telephone number of the wireless telephone.
This application is a continuation of application Ser. No. 08/343296, filed Nov. 22, 1994, now abandoned.
This invention relates to apparatus and methods for operating wireless telephones in conjunction with advertising or other displays.
Use of wireless telephones especially portable wireless telephones is becoming increasingly prevalent, especially when these telephones are used while the caller is driving a moving vehicle it is inconvenient for the caller to stop to make note of a telephone number of a vendor who has an especially attractive product advertised for example on a billboard. Since the driver frequently cannot stop, a telephone number, possibly the name of the vendor may be forgotten. A problem of the prior art therefore is that it is difficult for a vendor to get immediate response from a wireless telephone user.
The above problem is alleviated and an advance is made over the prior art in accordance with my invention wherein in an exemplary embodiment a caller passing a billboard display presses a single button on or makes a simple manual action on his/her wireless telephone. A moment later the wireless telephone receives a telephone number broadcast by the billboard which is equipped with broadcast facilities and the caller can immediately establish a connection to the telephone number suggested on the billboard. In one preferred embodiment the signals between the billboard and the caller are transmitted as modulated infrared signals similar to the kinds of signals used for communicating between a remote control and a television set.
In one preferred embodiment the billboard constantly repeats the telephone number of the vendor and the caller picks up this telephone number by activating the wireless telephone receiver through a manual operation. In accordance with another embodiment of the invention the caller's wireless telephone first transmits a request signal to the display and the display responds with the desired telephone number. Communications in both directions are via a modulated infrared signal.
FIG. 1 is a block diagram illustrating the operation of applicant's invention; and
FIG. 2 is a flow chart illustrating the method used for implementing applicant's invention.
FIG. 1 shows a wireless telephone 10 equipped with a microprocessor 11. This microprocessor is already available in wireless telephones and need simply be programmed to handle the extra functions required for applicant's invention. The microprocessor controls an infrared transmitter 13 and receives signals from an infrared receiver 14. Units such as Quality Technology Semiconductor's Infra Red Emitter 6266 QT can be used as the transmitter; Panasonic's PN116PA can be used as the receiver. The transmitter and receiver are activated by manual control 12 (essentially a push button) which also transmits the signal to the microprocessor to indicate that the process of finding a telephone number from the billboard is to be activated. The wireless telephone is connected by a radio link to a cell site 31 which is connected to a mobile telephone switching office 30. This mobile telephone switching office is connected to the public switch telephone network 40.
The billboard 20 is also provided with a microprocessor 21 for controlling and receiving signals from an infrared transceiver 22. (In view of the simplicity of the functions executed by the billboard, a few basic logic and small memory chips can be substituted for the microprocessor.) In the preferred mode of operation of applicant's invention the infrared transceiver simply broadcasts the telephone number of the vendor continuously. Shown is a link of that infrared broadcast which carries the telephone number of the vendor in data message 16. The contents of data message 16 are detected by infrared receiver 14 and passed on to to microprocessor 11. Depending on further requests by the caller the call can be immediately established or simply stored for subsequent establishment. The microprocessor 21 is connected to telephone 23 which is connected to the public switch telephone network 40 for accessing the vendor 50. The microprocessor can be used to transmit requests for the vendor's number. If an alternate feature of the invention is used namely one where wherein the wireless phone 10 is also connected to a infrared transmitter 13 and transmits the customer's telephone number in data message 15 when the manual control 12 is operated then the customer's telephone number may be forwarded via telephone 23 and PSTN 42 to the vendor 50. In order to allow the vendor to access records associated with the calling customer or to establish an additional record for a new potential customer.
Message 16 can also be used to convey other data, such as a bank interest rate, current product cost; message 15 can also be enhanced to make a more specific request for one of the items of information that can be supplied by the billboard.
The manual action 12 required to initiate the new process could have various forms, including but not limited to a single dedicated pushbutton, a combination of existing buttons pressed simultaneously (for instance, function and T) or a combination of existing buttons (for instance, Function 17) pressed sequentially.
FIG. 2 is a flow diagram illustrating the operation of applicant's invention. Block 200 indicates that the caller clicks the manual control 12. In response to this the caller number is transmitted from the wireless phone 10 to the billboard 20 (action block 202). The billboard receives and records the caller number (action block 203). Periodically, the record of caller numbers is sent to the vendor (action block 220). The billboard transmits the number of the vendor (action block 204) and the vendor number is received and stored in wireless telephone 10. Test 208 is used to determine whether the caller wishes to call now presumably one of the many buttons available on the wireless telephone can be used to make this request. If so then a call is established to the number which has been stored in the wireless telephone (action block 210) and the caller communicates with the vendor. If the caller does not wish to call now then this action is simply deferred until the customer requests a call be established to the stored number (action block 212) then the call is established to the stored number (action block 210) and the caller is connected to the vendor.
In an alternate embodiment the same functionality would be obtained by the use of radio frequency links between the wireless telephone and the billboard. In accordance with this embodiment the infrared transmitter 13, infrared receiver 14 would be replaced in the wireless telephone by its existing RF circuitry and antenna. The billboard would have an RF transceiver at 22 instead of the infrared transceiver. In a preferred alternative embodiment, a radio frequency adjacent to the regular wireless frequency band is used, which allows the radio frequency circuits of the wireless station to be used. Alternatively, since FCC Regulations Part 15 allows low power signals in the same radio frequency spectrum to be sent on a non-interfering basis, one of the wireless frequencies could be used. Alternatively, a frequency from the band used for cordless telephone could be used. The antenna of the wireless station can be used for this purpose.
It is to be understood that the above description is only of one preferred embodiment of the invention. Numerous other arrangements may be devised by one skilled in the art without departing from the scope of the invention. The invention is thus limited only as defined in the accompanying claims.
Citas de patentes
Otras citas
Citada por
Eventos legales
Imagen original


text:
Published on Thursday, October 02 2014 13:15
The upcoming art show at The Stone Cup/Rise & Shine Bistro titled "rep.e.ti.tion" will feature recent paintings Lyons artist Jake Pinello, which combine paint and burnt cardboard on stretched canvas,
Login to read more: rep.e.ti.tion
Published on Thursday, October 02 2014 12:25
Roads Traveled with Linda L. Osmundson
You can purchase pumpkins from several different sources but the most family fun is to visit a Pumpkin Patch. You may have to drive some distance but the trip will be well worth it. Besides fields of pick-your-own pumpkins, farmers offer mazes, corn stalks, gourds, hayrides, and produce stands.
Login to read more: Fall Is In The Air – Time To Think Pumpkins
Purchase A Subscription: Fall Is In The Air – Time To Think Pumpkins
Published on Thursday, September 18 2014 12:28
Conflu Rap
By Bonnie DiSalvo
Login to read more: Poetry Corner - September 18, 2014
Published on Thursday, October 02 2014 10:53
In the interest of full disclosure, let it be known that the author of this column is an elected official. The opinions expressed in this column are hers, and hers alone and do not necessarily reflect those of the Town of Lyons Board of Trustees.
Life is strange; it was thirty-one years ago in October, that Walt Kinderman, the editor of the Lyons Recorder, kept roasting Mayor Virgil Rigdon. His wife, Fern, was writing the local news, and
Login to read more: About Town - October 2, 2014
Published on Thursday, September 18 2014 12:08
Roads Traveled by Linda L. Osmundson
When you think of grape growing or wine tasting, California's Napa Valley comes to mind. But, did you know Colorado hosts over ninety wineries with more than thirty on the Front Range? And, the state's winemaking began over a century ago? Or, some Colorado climates rival California's grape growing regions?
Login to read more: Wine Tasting Trails
Published on Thursday, September 25 2014 08:14
Another week gone by. A nice week. A time to go to the high country to see the change of colors, and to relax before winter comes. I love the fall!
The papers states that fifty percent of those who voted for marijuana, now wish they hadn't. The Lyons
Login to read more: About Town - September 25, 2014
Published on Thursday, September 18 2014 11:17
The Commemorative of the September 13, 2013 flood was wonderful. Very heartwarming and sincere. Starting Thursday evening at Planet Bluegrass, the Towns 10 Commissions and their Board Liaisons each gave a brief message of their accomplishments during and after the flood and
Login to read more: About Town - September 18, 2014


text:
"Inside Mega: The Second Coming Of Kim Dotcom" shows how out of control certain law enforcement agencies actually are. No agency, before bringing in a helicopter for a nighttime raid, doesn't check the legality of its actions. The Americans knew they were breaking the law. They decided to bring down the site anyway. The Kiwis are already embarrassed. The Americans deserve to go to jail.
Kim Dotcom makes the Donald [Trump] look bland. When will someone do the movie?
Outward Bound
Your "Building Out (of China): Property Tycoons Follow Wealthy Customers Overseas" has aptly described the real estate situation in China. Despite Beijing's stringent control of housing expansion by raising capital gains taxes and restricting second-home purchases, prices remain hot. It is natural for enterprising developers to go offshore to enable rich house owners to own residences overseas, in addition to catering to foreign nations' local needs. After all, with new ventures come new gains, especially when the capital and expertise are already there.
HUA CHEN, Shanghai
Chinese are great builders. Some rich Chinese tycoons are coming to Malaysia in a big way. They have started a joint industrial complex with the government after acquiring a huge piece of land near my hometown of Kemaman. Such is the diligent effort of Chinese entrepreneurs in expanding their businesses to promote development in foreign countries. It is a win-win scenario.
Kemaman, Malaysia
The top three clubs on your list of the world's most valuable soccer teams ("Real Madrid Overtakes ManU To Become the Most Valuable Sports Team In the World") also happen to be three of the most indebted in the sport. Looking at the squads of Man United and Real Madrid in particular you could count the number of players of actual value on one hand. A club is worth simply what someone is prepared to pay for it. No sane businessman would pay billions for Man United or Real Madrid or Barcelona, as there's no prospect of a return. The recent phenomenon of billionaires buying clubs is one of pure vanity. At best you could argue it raises the profile of the owners.


text:
The instructional staff at 21CCCS consists of full-time Pennsylvania state certified teachers and counselors who work from our home office in Downingtown, PA. They modify the curriculum to suit individual student learning styles at varying academic levels.
In most cases, interactions with students are one-on-one. For this reason, teachers have the benefit of getting to know their students and the needs of those students. We are proud to employ passionate, forward-thinking, tech savvy teachers who drive a commitment for excellence. They want to see your children succeed and have the flexibility to direct individual attention, which helps that happen. Many of our teachers also serve as learning coaches. In this role, they are able to get to know students on a deeper level, and help them to achieve their level of success.


text:
Matt Scherer
As someone who is passionate about technology, this is my blog designed to help educate people about social media. As well, I want to use this social media forum to bring our growing tech community together.
Posts filtered on Tag
TYC retreat needs your thoughts and prayers
When it comes to running an ACTS retreat, sleep is a luxury. I am blogging this early this Friday morning, well before the arrival of 19 young men from the Ayres House. The Ayres House is a halfway house that provides help in transitioning teens from prison before returning to their homes. In San Antonio, […] [Read More]


text:
"GameBoard LLC, The" Events
Past Events - Show Coming Events
The GameBoard's Spotlight Sunday! - The GameBoard, Sheboygan
Sun, Feb 03, 2013 (12:00 PM - 05:00 PM)
Join us for our first SPOTLIGHT SUNDAY! This inaugural event will focus on Mayfair Games! You have probably seen or heard of The Settlers of Catan, but did you know that Mayfair produces hundreds of other games?! Come out and join us to learn about any one of our over 30 different open copies of Mayfair Games! We would love to show you some of our favs or, bring your fav Mayfair Game to show off to us!


text:
Sophomore Selby Chidemo scored the go-ahead run in the fifth.
May 6, 2012
PHILADELPHIA, Pa. -- Freshman Derek Hasenbeck went 2-for-4 with a home run to lead Xavier to a 4-3 Atlantic 10 win over La Salle Sunday. With the win, Xavier improved to 24-25 overall and 10-8 in the A-10 while La Salle fell to 18-28 on the season with a 5-13 conference mark.
Junior Tyler Koors picked up his second win of the season in seven innings of action. The XU right hander struck out five La Salle batters and gave up three runs. Junior closer Seth Willoughby picked up his 12th save of the 2012 season in two innings with three strikeouts. Willoughby is just one save shy of the single season record of 13 saves set by Jordan Conley in 2009.
Hasenbeck got the Musketeers on the board in the top of the first when he blasted an 0-1 pitch over the left flied wall for a one-out two-run homer that gave XU a 2-0 lead.
Patrick Paligraf, who singled to lead off the game, got another base hit to start the Xavier third inning and moved to second on a sac bunt by Selby Chidemo. The junior shortstop moved to third thanks to Hasenbeck's second hit of the game and scored his second run on a fielder's choice to sophomore third baseman Tres Eberhardt.
With the score tied at 3-3, it was Chidemo who set up the XU go-ahead run in the fifth. The sophomore led off the inning with a single and stole second. Eberhardt drove in his second run of the game with a single that brought home Chidemo and gave XU the 4-3 lead.
The one-run lead was all the Musketeers needed as Koors and Willoughby shutout the Explorers to close out the game.
The Musketeers return home for their final non-conference game of the season as they host Ohio Tuesday at 4 p.m. at Hayden Field.


text:
Three Fillies Meet Again in Eatontown
The winner and runner-up from Monmouth Park's May 26 Politely Stakes – plus the fourth-place finisher – will meet again at the New Jersey oval June 14, when a field of eight fillies and mares go postward in the $150,000 Eatontown Handicap (gr. IIIT).
The Politely winner, Social Queen, picks up the 118-pound high weight in the Eatontown, but spots just one or two pounds to the rest of the evenly-matched field. Trained by Alan Goldberg for Jayeff B Stables, she seeks her first graded win after eking out her recent score by a neck. In all but one of her four career victories, the 4-year-old daughter of Dynaformer has closed strongly from the outside.
The Christophe Clement-trained Medley chased the pace in the Politely, earned the lead in the stretch, and battled gamely as Social Queen closed to win by that narrow margin. Owned by Queen Elizabeth II, the 4-year-old daughter of Danehill Dancer raced in Europe before transferring to the U.S. last year. From three U.S. starts, she has an allowance score going one mile on the turf.
Trainer Tim Hills gave jockey Carlos Marquez Jr. a leg up aboard Dennis Federico's homebred Maddy's Heart in the Politely, and he expects a big effort from the duo this time around. Hills blames himself for their loss in the one-mile event, when Marquez rode the 4-year-old Lion Hearted filly for the first time and lost all the money in a fourth-place finish. He hopes the 1 1/16-mile Eatontown provides a better result.
"As it turned out," Hills said, "my instructions to the rider turned out to be wrong for the way the race developed. It was the first time Marquez rode her, and I told him to take her back and save ground. But when she tried to move inside, she got bounced around going into the first turn. That made her mad, and she just took off. She went to the lead way too early, and then she had nothing left in the stretch."
Maddy's Heart will be going for her first graded stakes victory in the Eatontown. She won the Maryland Million Ladies Stakes last October at Laurel, when she stalked the pace and closed with a rush to be up by a neck. She also has an allowance victory on Monmouth's turf course, scoring at the Eatontown distance last August.
$150,000 Eatontown Handicap (gr. III, race 9, approximate post 4:42 p.m.), 1 1/16 miles for older fillies and mares, turf
PP, Horse, Weight, Jockey
1. Czarina's Girl, 116, Pedro Cotto, Jr.
2. Maddy's Heart, 117, Carlos H. Marquez, Jr.
3. Montecito, 117, David Cohen
4. Social Queen, 118, Jose Lezcano
5. Chestoria, 116, Daniel Centeno
6. Medley, 117, Joe Bravo
7. Miracle Moment, 116, Pablo Fragoso
8. Beatrix Kiddo, 116, Eddie Castro
Copyright © 2015 The Blood-Horse, Inc. All Rights Reserved.


text:
Single mom accuses San Antonio Housing Authority of preferential treatment
New SAHA work preference pilot incentive program set to launch
SAN ANTONIO - A single mother of three on the the list for San Antonio public housing wants to know if she's a case of 'falling through the cracks.'
When Georgette Maldonado returned home from the hospital after delivering her third child two years ago, she found out she had been robbed.
"I just started bouncing, six months here, two months here, three months there. People try to take us in and there's only so much they can do," Maldonado said.
She applied for public housing two years ago, and she said she has made countless attempts to get help ever since.
"I've called every program. I've emailed, I've written, I've called, I've talked to them and they all just kind of look at me and say I'm sorry you have to wait your turn," Maldonado recalled.
Melanie Villalobos, with the San Antonio Housing Authority, said it's normal to wait two years, in fact it's normal to wait even longer in some cases.
Maldonado complained she's been given a slew of explanations over the years.
"There's not funding for case workers to be able to assist folks who are on the waiting lists, or who want to be informed about what all the opportunities are at that point," Villalobos said.
What has also been frustrating for Maldonado is getting preferential treatment.
"When I personally know people that applied for housing and they get it a month later, it's kind of a bitter pill to swallow," Maldonado said.
The San Antonio Housing Authority does have a list of preferences that can boost some to the top of the list, and there will soon be a new preference, a work preference pilot program.
"We want to encourage working families, we want to encourage self-sufficiency," Villalobos said.
The program, scheduled to kick off in a couple of months, will give working parents like Maldonado the incentive to keep it up.
"I'm not asking for you to give me a house, I'm asking for a hand up," Maldonado said.
Villalobos is hoping a new website, scheduled to launch in October, will help answer questions applicants have and keep all of the information about the various programs in one centralized location.
For a list of recent stories April Molina has done, click here.
Copyright 2012 by KSAT.com All rights reserved. This material may not be published, broadcast, rewritten or redistributed.


text:
Stock quote
Download Centre
SAIS owns massive quality iron sands concessions in Chile, most of which are exploitation concessions whilst the rest are being converted from exploration to exploitation concessions.
Earmarked for development are those concessions along the coast of Chile for ease of transportation and exportation of produced iron sands concentrates.
South American Iron & Steel operates its Ecuadorian projects through its wholly-owned subsidiary, Fierroinca del Ecuador S.A.
Due to the new Mining Law in Ecuador, the Company's concessions were dismissed. The Company is focusing its efforts on reinstating its onshore exploration rights in Ecuador.
The Concession was granted to Weishan Feiste Mining Co. Ltd. (a subsidiary of SAIS) in 2009. The Concession area is 48.15km2, and hosts gold, copper, lead-zinc, iron and antimony mineralisation. The copper, gold and antimony mineralisation areas have been exploited historically by local artisan miners. The Concession is accessible via a combination of paved and dirt roads and tracks. The Concession area is 103km west of Dali City (a major tourist City) where connections to other major cities are available via railway and airplane.


text:
- Officer Commanding
- Old Catholic
Origin of o.c.Classical Latin opere citato in the work cited
- Officer Commanding
- Old Catholic
oc - Computer Definition
The optical signal as defined in Synchronous Optical Network (SONET) for North America and Synchronous Digital Hierarchy (SDH) standards for international applications. All SONET levels are expressed in multiples of OC-1 (51.84 Mbps), which is a T3 signal (44.736 Mbps), or the equivalent, plus SONET signaling and control overhead, converted from electrical to optical format. The SONET digital hierarchy begins at OC-1 (51.84 Mbps) and the SDH hierarchy at OC-3 (155.52 Mbps). From OC-3, the progression of SONET and SDH levels are the same, culminating in OC-768 (39.813 Gbps). OC-1536 (79.626 Gbps) and OC-3072 (159.252 Gbps) have yet to be fully defined. See SONET for a table of OC-N levels. See also overhead, SDH, signaling and control, SONET, and T3.
(Optical Carrier) The transmission speeds in SONET/SDH networks. See SONET. See also DS. SONET CIRCUITS Optical Electrical Speed Channel Channel (Mbps) OC-1 STS-1 51.84 OC-3 STS-3 155.52 OC-3c STS-3c 155.52 OC-12 STS-12 622.08 OC-12c STS-12c 622.08 OC-48 STS-48 2488.32 OC-192 STS-192 9953.28 OC-768 STS-768 39813.12 OC = Optical Carrier STS = Synchronous Transport Signal c = concatenated
Variant of Oc


text:
- archaea (2) (remove)
- Biowissenschaften (2)
- Physik (1)
- Polyploidy in haloarchaea: advantages for growth and survival (2014)
- The investigated haloarchaeal species, Halobacterium salinarum, Haloferax mediterranei, and H. volcanii, have all been shown to be polyploid. They contain several replicons that have independent copy number regulation, and most have a higher copy number during exponential growth phase than in stationary phase. The possible evolutionary advantages of polyploidy for haloarchaea, most of which have experimental support for at least one species, are discussed. These advantages include a low mutation rate and high resistance toward X-ray irradiation and desiccation, which depend on homologous recombination. For H. volcanii, it has been shown that gene conversion operates in the absence of selection, which leads to the equalization of genome copies. On the other hand, selective forces might lead to heterozygous cells, which have been verified in the laboratory. Additional advantages of polyploidy are survival over geological times in halite deposits as well as at extreme conditions on earth and at simulated Mars conditions. Recently, it was found that H. volcanii uses genomic DNA as genetic material and as a storage polymer for phosphate. In the absence of phosphate, H. volcanii dramatically decreases its genome copy number, thereby enabling cell multiplication, but diminishing the genetic advantages of polyploidy. Stable storage of phosphate is proposed as an alternative driving force for the emergence of DNA in early evolution. Several additional potential advantages of polyploidy are discussed that have not been addressed experimentally for haloarchaea. An outlook summarizes selected current trends and possible future developments.
- Analysis of a hybrid TATA box binding protein originating from mesophilic and thermophilic donor organisms (2010)
- The TATA Box Binding Protein (TBP) is a 20 kD protein that is essential and universally conserved in eucarya and archaea. Especially among archaea, organisms can be found that live below 0°C as well as organisms that grow above 100°C. The archaeal TBPs show a high sequence identity and a similar structure consisting of α-helices and β-sheets that are arranged in a saddle-shape 2-symmetric fold. In previous studies, we have characterized the thermal stability of thermophilic and mesophilic archaeal TBPs by infrared spectroscopy and showed the correlation between the transition temperature (Tm) and the optimal growth temperature (OGT) of the respective donor organism. In this study, a "new" mutant TBP has been constructed, produced, purified and analyzed for a deeper understanding of the molecular mechanisms of thermoadaptation. The β-sheet part of the mutant consists of the TBP from Methanothermobacter thermoautotrophicus (OGT 65°C, MtTBP65) whose α-helices have been exchanged by those of Methanosarcina mazei (OGT 37°C, MmTBP37). The Hybrid-TBP irreversibly aggregates after thermal unfolding just like MmTBP37 and MtTBP65, but the Tm lies between that of MmTBP37 and MtTBP65 indicating that the interaction between the α-helical and β-sheet part of the TBP is crucial for the thermal stability. The temperature stability is probably encoded in the variable α-helices that interact with the highly conserved and DNA binding β-sheets.


text:
What You Should Know
|Star Rating
|2 or More Patented Ingredients
|Less Than $5 Shipping
|Trial Offer
|Rejuval Skin (2014 Editors Choice)
|Facial Toner
|IQ Derma
|Juva BioGel
|Meaningful Beauty
The Juva Skin and Laser Center and Medispa were founded by Dr. Bruce Katz in 1999 at the Mount Sinai Hospital in New York. Dr. Katz is a world renowned leader in the field of Laser Dermatology and Cosmetic Surgery, according to the official Juva website. Juva provides customized care in the Juva Health and Wellness Division, and the Juva Skin Laser Center and Medispa was named "The World's Best Medispa" in 2004 by DaySpa Magazine. The company's focus continues to be on maintaining optimal health and wellness through disease prevention, nutrition, weight management, and anti-aging strategies. Juva BioGel is one of the anti-aging products available from the Juva skin care line.
Product Details
The Juva BioGel was created with a special formulation to address many skin care issues and concerns and is a product that is designed for daily use. Juva BioGel claims to restore a vibrant, healthy glow to aged, stressed and sensitive skin, which is generally caused by over-exposure to the sun and environmental free radical damage, as well as skin deterioration which happens from smoking. The Juva BioGel contains an ingredient called PSP (Processed Skin Proteins) which is "a balance of essential skin nutrients including growth factors, interleukins and antioxidants". PSP promises to revive the skin and to create a softer, firmer and younger looking complexion. The formula also contains sodium hyaluronate which, when combined with growth factors, are described as having a key role in wound healing. Juva BioGel is said to be suitable for all skin types including oily and problematic skin. Juva BioGel is free of alcohol, oils, fragrance and color additives.
The Good
- Juva BioGel contains antioxidants and a collagen booster.
- The website offers easy online ordering and a user-friendly website.
- Juva provides access to scientific studies to educate customers about its products.
The Bad
- Juva BioGel is sold for $150.00 which may not be affordable for the average consumer.
- No money back guarantee or return policy is provided on Juva's official product website.
- Does not contain proven ingredients such as Matrixyl 3000 or Argireline.
- Juva does not provide a complete list of product ingredients for BioGel.
The Bottom Line
Juva BioGel may not appeal to a large audience of consumers shopping the anti-aging market due to its high cost. Juva BioGel will likely appeal more to those who buy products from physicians who promote their own product lines. Consumers can expect highly effective anti-aging products that contain proven ingredients known to produce dramatic results. These types of products seem to receive the best customer ratings. Juva BioGel does not seem to offer the components used in many of the best items available. When making a skin care purchase online, it would be helpful if the company offered a free sample of the product and at the very least a 30 day money back guarantee for consumers who may be left unsatisfied with the results.


text:
Counseling Resources
Scheduling Appointments
- Email us at . We typically can respond back to you within 24-hours, M – F.
- Stop by our office in Building 22 during drop-in hours and a counselor will help you schedule an appointment.
- Call the Office of Student Life at 360-596-5306. Your phone call will be transferred to one of the counselors. We typically return phone calls within 24-hours, M - F.
One-on-One Couseling includes these types of Counseling
Career Counseling
Counselors help students examine career and life goals, assess interests, values, and skills, make occupational decisions, select educational programs and majors, and explore the world of work. Career counseling is available through classes, workshops or individual appointments.
Educational Skills Counseling
Educational skills counseling assists students in learning how to improve study skills such as reducing test anxiety, managing time more effectively, establishing and reaching realistic goals, and adjusting to college life. Educational skills counseling and instruction are available through classes, workshops and individual appointments.
Crisis Intervention
Counselors are available to help with a variety of emotional crises or emergencies. When a counselor cannot be reached, call the Crisis Clinic at (360) 586-2800 for personal assistance; call 911 for medical assistance.
Personal Counseling
Personal counseling gives students the opportunity to meet with a professional counselor to discuss issues and concerns that may be interfering with their ability to achieve educational and personal goals. Personal counseling is available by appointment or on an emergency basis.


text:
11 Irresistible Digital Marketing Insights for Lifestyle Brands
As mentioned, last week played host to the inaugural Stylecaster's 'State of Style' Summit in New York City during New York Fashion Week. The day-long conference took place at 92YTribeca and featured over a dozen panels focusing on the digital space. Participants in the industry included Mashable's Lauren Indvik, designer Rebecca Minkoff, Gilt Groupe's Alexandra Wilkis Wilson and Donna Karan's Aliza Licht (aka @DKNY).
Here are FMM's eleven of the most memorable insights taken away from this educational event:
1. Identify your target consumer. According to Minkoff, before launching something new, a company must ask itself the following questions: Who is this customer? What is he/she doing? Where are they going? In doing so, the ideal demographic can be realized.
2. The difference between an individual's voice and a brand's online is the authenticity. Consumers tend to respond best to honest dialogue and story-based content.
3. Recognition is a privilege, not a right. Because social media is a conversation, companies should think about what they think would want to be read if they want to gain attention.
4. Intention converts into action. Make sure your messaging is as simple, clean, and tangible as possible. If everyone can understand the purpose of your program, then it is guaranteed to attract attention.
5. "You don't need to intimidate to rule," voiced Licht. Known across the Internet as the voice of Donna Karan International, she knows better than any brand—particularly in the luxury sphere—the importance of approachability and accessibility.
6. Find out the source of a trend. Who or what makes something go viral? Depending on the craze, the location of its birth can range from street style photography and bloggers, magazine editorials, or even a popular celebrity.
7. Follower count is not the 'be all, end all.' Darren Herman, chief digital media officer of media planning agency MediaKitchen, wants brands to know that "you don't need to understand the numbers, you need to understand the insights." What does this mean? That engagement and response from an online-based project is just as important, if not more important, than the number of followers an account has obtained.
8. Promotions offer limited social engagement. According to the 'State of Style' report, only 20 percent of online followers are driven by a promotion like competitions or discounts. In order to increase engagement, brands must be to-the-point about the purpose and usefulness of new campaigns.
9. M-commerce and apps drive both traffic and revenue. Alexandra Wilkis Wilson, founder and chief marketing officer of Gilt Groupe, reported that her company makes over 30 percent of its total revenue from mobile purchases.
10. Don't exclude f-commerce from your social media plan. The Doneger Group's Catherine Moellering revealed that there will be an estimated 786 percent increase in e-commerce campaigns based on the Facebook platform from 2011 to 2015.
11. Have a hacker mentality. Don't be afraid to put something out there, fail, experiment, and experiment again.
In addition to the discussions, Stylecaster debuted its first 'State of Style' report, a detailed analysis of style and fashion trends commissioned in partnership with Empirica Research. The report is available for purchase for $999.00 by contacting email@example.com.
Sara Zucker – Contributing Writer, New York City
Although she pursued a Masters degree in Library Science, Sara's been trailblazing online since she began blogging in 2008. As the former Community Manager for Glamour magazine and current digital analyst for Nars Cosmetics and one of the fashion world's most popular bloggers on Tumblr (Farpitzs), Sara has been featured in Lucky, Glamour, the Wall Street Journal, Stylecaster, Blackbook, and the Seattle Times, among others. She has also worked with such renowned brands as The Outnet, Club Monaco, Cynthia Rowley, Ann Taylor, and UGG Australia. You can follow her on Twitter @SBZ.
Good Digital Marketing Article


text:
A computerized method employing isosceles triangles for generating boundary surface points includes providing an electronic computer system having instructions and data for performing steps, and then performing those steps by executing the instructions and data in the computer system. Each isosceles triangle employed in the method has two congruent legs and an incongruent base. The steps include detecting a closed edge, determining a base figure having a perimeter, generating after the determining step a first group of isosceles triangles having vertices coincident with the closed edge and having bases formed by and equal to the perimeter, determining a location vector formed by a unitized cross product of first line segments which connect the vertices of the first group of triangles. The steps further include generating a second group of isosceles triangles having a common vertex on the vector at a location outside of a plane containing at least portions of the perimeter, the second group of isosceles triangles having bases formed by the first line segments; calculating a first ratio of sums of heights of the first group of triangles, calculating a second ratio of heights of the second group of triangles, comparing the ratios, moving the common vertex along the vector until the common vertex is positioned at a second location. Thereafter, the method generates a boundary surface point at the second location.
1. A computerized method for generating boundary surface points, comprising:
providing an electronic computer, the electronic computer including a memory having stored therein instructions and data for performing steps (a)-(j);
performing the steps (a)-(j) by means of executing the instructions and data within the computer;
(a) detecting a closed edge;
(b) determining a base figure having edges forming corners coincident with the closed edge;
(c) generating, after performing said step (b) of determining a base figure, first, second, third and fourth isosceles triangles having: (i) peak points coincident with points on the closed edge, and (ii) bases colinear and equal to edges of the base figure to form a closed loop on the base figure, and (iii) heights extending from the bases to the peak points;
(d) determining two line segments connecting the peak points of the first and third and the peak points of the second and the fourth isosceles triangles;
(e) determining a location vector orthogonal to middle points of the two line segments;
(f) calculating a first ratio equal to a sum of the heights of first and third isosceles triangles divided by a sum of the heights of the second and fourth isosceles triangles;
(g) locating a set point to a first location on the location vector, the first location being outside of a plane in which at least two edges of the base figure lie;
(h) projecting a plurality of line segments from the set point to the peak points of the first, second, third and fourth isosceles triangles;
(i) calculating a second ratio having a numerator equal to a height of a fifth isosceles triangle whose peak point is formed by the set point and whose base is formed by one of the two line segments, and having a denominator equal to a height of a sixth isosceles triangle whose peak point is formed by the set point and whose base is formed by the other of the two line segments;
(j) relocating the set point on the location vector to a new location where the second ratio equals a reciprocal of the first ratio, and then generating a boundary surface point at the new location, and wherein each isosceles triangle of said method has two respectively congruent legs, each respectively congruent leg being unequal to the respective base.
2. A method as claimed in claim 1, wherein the memory further includes instructions and data for performing steps k and l, the method further comprising executing the instructions and data so as to perform the steps (k) and (l) in the computer system:
(k) generating seventh and eighth isosceles triangles having respective bases formed by and equal to respective legs of the second and fourth isosceles triangles, and
(l) forming a closed loop including the bases of the sixth, seventh and eighth isosceles triangles and the base of the first isosceles triangle.
3. A method as claimed in claim 1, further comprising the step of:
(k) generating seventh and eighth isosceles triangles having peak points coincident with points on the closed edge, the points coincident with the peak points of the seventh and eight isosceles triangles differing from the points coincident with the peak points of the first, second, third and fourth isosceles triangles.
4. A method as claimed in claim 1, wherein said step of (b) determining a base figure further comprises determining a base figure whose edges at the corners form respective angles closest to 90 degrees and whose perimeter within the closed edge is the longest.
5. A method as claimed in claim 4, wherein said step of (b) determining a base figure includes determining a base quadrilateral having edges forming corners coincident with the closed edge.
6. A method as claimed in claim 5, wherein said step of (b) determining a base figure further comprises determining a base figure having a smallest total length of projections extending from the base figure to the closed edge.
7. A method as claimed in claim 6, wherein each of the projections of said step of (b) determining is normal with the edge of the base figure from which the projection extends.
8. A computerized method for generating boundary surface points, comprising:
providing an electronic computer system, the electronic computer system including a memory having instructions and data for performing steps (i),(ii),(iii), and (iv);
executing the instructions and data so as to perform the steps (i), (ii), (iii) and (iv) in the computer system:
(i) detecting a closed edge;
(ii) determining a base figure for the closed edge, the base figure having a perimeter including a first plurality of line segments, at least two of the line segments lying in a plane;
(iii) locating a boundary surface point, said locating step including:
generating, after performing said step of (ii) determining a base figure, a first plurality of isosceles triangles, each isosceles triangle of the first plurality having two respectively congruent legs and a respective base, the respective base also being a respective one of the first plurality of line segments of the perimeter of the base figure, each respective base being incongruent to each of the two respectively congruent legs, and each isosceles triangle having a respective vertex coincident with a respective point on the closed edge,
determining a location vector formed by a unitized cross product of other line segments which connect the vertices of the first plurality of isosceles triangles,
generating a second plurality of isosceles triangles, the second plurality of isosceles triangles having a common vertex at a first location on the location vector and having bases which are the other line segments connecting the vertices of the triangles of the first plurality, each isosceles triangle of the second plurality including two respectively congruent legs, each respective base being incongruent to each of the two respectively congruent legs, the first location being outside of the plane in which the at least two line segments lie,
calculating a height of each triangle of the first plurality,
calculating a first ratio of sums of the heights of the first plurality of isosceles triangles,
calculating a height of each triangle of the second plurality,
calculating a second ratio of the heights of the second plurality of isosceles triangles,
comparing the second ratio to the first ratio,
moving the common vertex along the location vector to a second location at which a reciprocal of the second ratio equals the first ratio, said moving step including maintaining the first ratio as a constant; and then
(iv) generating a boundary surface point at the common vertex at the second location.
9. A method as claimed in claim 8, wherein said step of (ii) determining includes determining a base figure including a base quadrilateral within the closed edge, the base quadrilateral having a perimeter consisting of four line segments, and wherein the first plurality is four and the second plurality is two.
10. A method as claimed in claim 8, wherein said step (ii) of determining includes determining an optimum base quadrilateral, the optimum base quadrilateral having a largest perimeter within the closed edge.
11. A method as claimed in claim 10, the optimum base quadrilateral further having all angles closest to 90� on the closed edge.
12. A method as claimed in claim 11, the optimum base quadrilateral further having a smallest total length of projections, each projection beginning at the base quadrilateral and ending at the closed edge.
13. A method as claimed in claim 8, wherein said step of (ii) determining a base figure further includes storing in a database parameters corresponding to the base figure.
14. A method as claimed in claim 13, wherein said storing step includes storing in a binary tree database structure parameters corresponding to the base figure.
15. A method as claimed in claim 8, wherein said step of determining a base figure further includes creating data according to a line line boolean primitive wherein a line is an acceptance (true) or a rejection (false) of the data relative to a boolean affirmation.
This Application is related to commonly owned copending application Ser. No. 07/823,109 filed Jan. 22, 1992, entitled METHOD FOR DECOMPOSITION TO DEFINE FINITE ELEMENTS WITHIN A SURFACE OR VOLUME.
A microfiche (1 microfiche, 64 frames) appendix with a computer program listing has been filed in the United States Patent and Trademark Office.
This Application is related to commonly owned copending application Ser. No. 07/823,109 filed Jan. 22, 1992, entitled METHOD FOR DECOMPOSITION TO DEFINE FINITE ELEMENTS WITHIN A SURFACE OR VOLUME.
A microfiche (1 microfiche, 64 frames) appendix with a computer program listing has been filed in the United States Patent and Trademark Office.
1.) Field of the Invention
The present invention relates to figure surface point generation and, more particularly, to generating surface points which form surface boundaries or surface contours of two or three dimensional figures in, for example, a two dimensional space.
2.) Description of the Prior Art
Representing three dimensional figures in a two dimensional space is common, for example, in Computer Aided Design (CAD), Computer Aided Manufacturing and the like. Typical CAD systems include a microcomputer coupled to an input device (e.g., a keyboard), an output device (e.g., a video display), and to a memory for storing suitable instructions and data for generating surfaces, plane or solid figures other graphics and the like.
Some known CAD techniques employ nonuniform rational B-splines (NURBS) and other modeling techniques which permit describing virtually any type of curves or curved surface, from simple 2-D circles to complex, doubly curved sculptured surfaces. See, for example, GEOMETRIC MODELING, by Michael E. Mortenson, (John Wiley & Sons, N.Y., 1985); CURVES AND SURFACES FOR COMPUTER AIDED GEOMETRIC DESIGN, by Farin, G., (Academic Press, San Diego, 1988); COMPUTER AIDED DESIGN, Piegel and Tiller, (November 1987, Vol. 19; and U.S. Pat. Nos. 5,119,309, FEATURE BASED METHOD OF DESIGNING AUTOMOTIVE PANELS, Jun. 2, 1992, Cavendish et al; 4,999,789, METHOD AND APPARATUS FOR TRIMMING B-SPLINE DESCRIPTIONS OF PATCHES IN A HIGH PERFORMANCE THREE DIMENSIONAL GRAPHICS SYSTEM, Mar. 12, 1991, James Flasconaro; 4,864,520, SHAPE GENERATING/CREATING SYSTEM FOR COMPUTER AIDED DESIGN, COMPUTER AIDED MANUFACTURING, COMPUTER AIDED ENGINEERING AND COMPUTER APPLIED TECHNOLOGY, Sep. 5, 1989, Setoguchi et al; 4,631,690, MULTIPROCESSOR COMPUTER SYSTEM FOR FORMING A COLOR PICTURE FROM OBJECT ELEMENTS DEFINED IN A HIERARCHIC DATA STRUCTURE, Dec. 23, 1986, Cortbout et al, all of which examples are herein incorporated in their entireties by reference.
Although the prior art arrangements are useful, the present inventor believes that they have not been entirely satisfactory because they require extensive core data bases of stored surfaces (fundamental or otherwise) and/or very complicated interpolation polynomials to create boundary surfaces.
The present inventor believes that further improvements in methods for determining or generating surface points are achievable.
It is a principal object of the present invention to generate surface boundaries of two or three dimensional figures without requiring extensive core data bases or unduly complicated polynomials to position boundary surface points.
According to the present invention, a method for generating boundary surface points, includes: detecting a closed edge; determining an optimum base figure for the closed edge; locating a boundary surface point, and then generating a surface point at the new location. The locating step includes: generating a first plurality of isosceles triangles; determining a location vector; generating a second plurality of isosceles triangles, the second plurality of isosceles triangles having a common vertex on the location vector and having bases formed by segments connecting vertices of opposed triangles of the first plurality; comparing heights of the first and second pluralities of triangles; and then relocating, dependent upon the result of the comparing step, the common vertex to a new location on the location vector.
In general, the present invention composes a boundary surface by causing the positioning and generation of a multiplicity of surface points resulting from repetitive employments of groups of isosceles triangles. Each employment results in a new surface point for the boundary. The method is straightforward, and is readily implemented in software combined with conventional electronic computer hardware by those skilled in the art.
The method of the present invention exploits the extensive structure inherent in combined isosceles triangles. A boundary surface is modeled employing repetitive groups of isosceles triangles whose peak points or vertices are either coincident with points on the closed edge or used to position or locate a boundary surface point. Typically, the closed edge is created by a user employing a light pen, mouse, keyboard or other input device when the method is implemented in software stored within an electronic computer (e.g., personal computer/workstation) system.
Some prior art (CAD) arrangements have recognized benefits of isosceles triangles; see, e.g., U.S. Pat. No. 4,864,520 previously incorporated by reference. However, the present inventor believes that the prior art does not employ such benefits in a manner as set forth in the present invention.
Further and still other objects and features of the present invention will become more readily apparent in view of the following detailed description in combination with the accompanying drawing, in which:
FIG. 1 is a perspective view of a closed edge E having a multiplicity of surface points P positioned according to the method of the present invention;
FIG. 2 is a high level flowchart of a preferred method according to the present invention;
FIG. 3 shows a series of diagrams explaining essential (B1,B2a,B2b,B2c) and optional (B3a,B3b,B4a,B4b,B5) steps for the step B of FIG. 2;
FIG. 4-1 and FIG. 4-2, collectively referred to herein as FIG. 4 shows a high level flow diagram further explaining various of the steps of FIG. 3.
FIG. 5 shows a series of diagrams explaining the step C of FIG. 2.
FIG. 6 shows diagrams which explain a further example for determining an optimum base quadrilateral within a closed edge;
FIG. 7 shows a list of diagrams for 12 primitives useful for further understanding the example of FIG. 6 and, among others, the knowledge base of an optional feature of the invention;
FIG. 8 is a high level flow chart showing additional optional steps E-I according to the invention;
FIG. 9-1 and FIG. 9-2 collectively referred to herein as FIG. 9, FIG. 10, FIGS. 11-1 and 11-2 collectively referred to as FIG. 11, and FIG. 12 are high level flow charts further explaining the steps of FIG. 8;
FIGS. 13-16 are diagrams useful for understanding FIG. 9-12;
FIG. 17 shows diagrams of a preferred process for determining vertex angles 6.1 (FIG. 17A), diagonals 7.1 (FIG. 17B), perimeters 8.1 (FIG. 17C) and projections 9.1 (FIG. 17D), 9.2 (FIG. 17E) for a base figure (quadrilateral), and
FIG. 18 is a schematic diagram of an electronic computer system in which a preferred embodiment of the invention is implemented.
FIG. 1 shows a resultant closed edge E with a multiplicity of boundary surface points P located and generated according to the preferred method of FIG. 2. Optional connection lines L are generated by any well known technique, e.g., line generating software.
In FIG. 2, a closed edge (e.g., 102 FIG. 3) is detected by any conventional means such as coincidence detection software. Once a closed loop is detected, the method performs the essential steps B1 (FIG. 3A), B2a (FIG. 3B), B2b (FIG. 3C), B2c (FIG. 3D) of FIG. 3 (hereinafter described) corresponding to step 10 of FIG. 4 to determine an optimum base figure (e.g. 1102, FIG. 3I) for a particular closed edge (original surface edge 102). For a further refinement to determine the optimum base figure, the optional step B3b (FIG. 3F) is performed which calculates projection ratios (projections). Projections terminating at points 91 are calculated as the length from the dot product projection (DOT) onto the base FIG. 1102 edge and the triangle peak points on an original edge 102 where that length is divided by the distance along the base FIG. 1102 edge.
DOT=(91-CORNER.sub..left brkt-bot.)�(CORNER.sub..left brkt-bot.+1 -CORNER.sub..left brkt-bot.)/||CORNER.sub..left brkt-bot.+1 -CORNER.sub..left brkt-bot. ||;
RATIO=||91-(((CORNER.sub..O slashed.+1 -CORNER.sub..left brkt-bot.)/||CORNER.sub..left brkt-bot.+1 -CORNER.sub..left brkt-bot. ||)*DOT)||/DOT;
Thus, according to the preferred embodiment, an optimum base figure has (i) a largest perimeter within the original surface loop (original closed edge), (ii) vertex angles each closest to 90 degrees, and (iii) base figure edges most parallel to the edges of the original surface loop. One preferred method to determine (iii) is by means of the step B3b of FIG. 3F. Of course, one or more of these scalar parameters (i), (ii) or (iii) can be used to determine an optimum base figure. See also FIG. 6 and FIG. 17 (both hereinafter described) for a further example of determining a base figure, e.g. a base quadrilateral within various original surface loops(original closed edges).
This example according to the invention fits a base quadrilateral in a closed loop of edges. Characteristics of the quad that produce the best surface grid configuration or surface points are, for example: (i) perpendicular angles at each of the four corners, (ii) the largest possible quad perimeter, and (iii) the edge placement running most parallel to the original surface edges. The method produces a variety of quads, and selects the optimum quad position in a closed loop of edges. The process is linear, and the scalar variations converge to true and false data structures. A property that is manifested by the method is the creation of discrete voids in the form of coarse scalar increments into which the boolean data fits. A coarse delta t parameter along the parametric equivalent of the original surface loop forms voids in the process that the boolean description of scalars partially fills with regards to a practical application as described herein e.g., FIG. 6.
More specifically, in the steps of FIG. 3:
B1 (FIG. 3A) Initial base quad corner placement 1,2,3, and 4 is set along the original surface edge 102 a small percentage of the total loop length.
B2a (FIG. 3B) Adjust the location of corner 4 moving the point a coarse percent of the total edge length forward on the edge 102 loop (10 Coarse Corner placement FIG. 4).
B2b (FIG. 3C) Continue adjusting the location of the 2 and 3 base quad corners following the relocation of corner 4. (10 Coarse Corner Placement).
B2c (FIG. 3D) Save this base quad 1102 with the vertex angles 601 closest to perpendicular, and having the longest perimeter (10 Coarse Corner Placement).
B3a (FIG. 3E) Altering the direction 58a.5801 of adjustment of a base quad 1102 corner on the original edge 102 from forward on the surface loop to the reverse direction is the path of scalar development 58c.5801 (20.21 generate vertex scalar path of base quad corners).
B3b (FIG. 3F) Save the base quad 1102 having the largest perimeter, vertex angles 601 closest to perpendicular, and the smallest projections 91.
B4a (FIG. 3G) Generate a list of the previously developed base quads 5.502 that have the most similarity with the current base quad 5.501 corresponding to the parameter 503: vertex angle 601, quad base 1102 perimeter, and projection ratios 91.
B4b (FIG. 3H) Adjust the vertex corner of the base quad 1102 by substituting an initial small scalar increment into the scalar path gotten from the comparable knowledge base surface B4a.502.
B5 (FIG. 3I) The knowledge base is started with the quad base data of an edge surface outline of a circle because of its symmetry and similar characteristics with any surface having approximately equal edge lengths.
In the steps of FIG. 6:
Step 1: Parameterize the original surface loop of successive edge line segments total length to 1. (FIG. 6A).
Step 2: Set delta t to a value that will produce a varied spread of potential quad bases where delta t is to be much larger than the delta t calculated in Step 5. (FIG. 6B).
Step 3: Maintain a list of (a list length of 5 is selected) quads such that the quads are ordered with decreasing proximity to the largest quad perimeter and having the closest vertex angles to 90 degrees removing any quad falling below the fifth position in the list. (FIG. 6C).
a) Scalar data is being produced;
b) Inference is in the form of creating the quadrilaterals within the loop compatible with the LLS, SSL to LLH, HHL section of the generalization element; and
c) External parameters are applied as in the perimeter length and vertex angle magnitude i.
Step 4: Select the quad having the largest perimeter. FIG. 6D
a) Selection of a quad using one parameter is the act of using the parameter as a label and focusing on particular data defined as a magnitude within the label generalization.
Step 5: Calculate a new t increment as a function of the smallest adjacent parametric quad corner location on either side of a corner. FIG. 6E.
a) Decrease the delta t by a small percent of the original so that the placement of a corner won't overlap adjacent corners.
Step 6: Shift the location of each corner point the delta t parameter association with it in the positive (true) or negative (false) parameter increment from the current corner location testing each new quad for a larger perimeter, closer to perpendicular angles, and quad edges running more parallel to the original surface edges. FIG. 6F.
a) Miniature paths are formed by maintaining a true or false recording of whether the current path is convergent to within one of the three scalar comparisons where divergence (false with a true previous comparison) is a path break (61) from the HHS-SSH, BBS-SSB section of the generalization element. FIG. 6G.
b) Both true and false directions of a corner delta t are tested and the delta t is decreased by half of the current magnitude on the full set of a return to a true path direction. FIG. 6H.
c) Random comparison of three scalar parameters is a mino-function in context with the fact that the data converges to a boolean path description of the corner location of a base quad thereby converging to compatibility with the generalization element automatically aligning a quad base with original loop vertex corners. FIG. 6I.
d) Projections are the minimum distance from an outer most layer of isosceles triangles peak points to a quad edge that is the base line to the triangles where each distance is divided by the base line length producing a percent ratio. FIG. 6J.
Step 7: Move the quad corner points to the nearest original vertex in the edge loop. FIG. 6K.
Step 8: Test a wide range of surfaces to verify the general nature of the process.
a) Out of seven (7) surfaces only one failed even at 1/3 of an incomplete process.
b) Interaction is necessary for extrusions. FIG. 6L.
c) Test configuration. FIG. 6M.
In the diagram of FIG. 17:
6.1 Vertex angles 601 are the cosine of the angle gotten with the dot product. FIG. 17A.
7.1 Diagonals 701 between surface corners of a base quad between two concatanated surfaces. FIG. 17B.
8.1 Perimeter of a base quad is the summation of all edge lengths. FIG. 17C.
9.1 Projections are the ratio 91 of each projection height between isosceles triangle peaks 92 and the partial length of the edge base line 93. FIG. 17D.
9.2 Surfaces have three edge projections 94 on a base quad. FIG. 17E.
Optionally, a knowledge or data base is created and stored for subsequent use to recognize more readily closed edges corresponding to optimum base figures. Scalar parameters such as lengths of base figure diagonals, measurements of corner angles, and base figure perimeter lengths are labeled, ordered and/or listed in any suitable manner by those skilled in the art to facilitate rapid and reliable recognition of optimum base figures for particular original surface edges, and also recognition of desired surface boundary points which will be discussed hereinafter. Optional processes B3a, B4a, B4b and B5 previously discussed may be executed. See also steps 21, 22, 30 of FIG. 4. In the step 21, generate vertex scalar paths of base quad corners. In the step 22, save a base quad. In the step 30, perform an inference of proportionality. The labeling, ordering and/or listing of data permits the method to acquire a degree of artificial intelligence (AI) with each interaction with a user-created closed edge. See, for example, U.S. Pat. No. 5,043,915, KNOWLEDGE BASED SYSTEM INSTALLED WITH ASSOCIATIVE/KNOWLEDGE AND INFERENCE METHOD, Aug. 27, 1991, which is hereby incorporated in its entirety by reference. For further AI approaches see, for example, DESIGNING ARTIFICIAL INTELLIGENCE BASED SOFTWARE, by A. Bahrami, Halsted Press 1988 and ARTIFICIAL INTELLIGENCE IN SOFTWARE APPLICATIONS, by B. W. Wah, IEEE 1988.
After determining or generating the optimum base figure (e.g., optimum base quadrilateral) according to step B and saving (at least temporarily) the base figure, the method proceeds to the steps C and D of FIG. 2. The essential step C is shown further explained in FIG. 5 (steps 1, 2a-2G, 4, 3A-3F) discussed hereinafter. Element 1.103 is a peak point lying on a surface edge section 1.104 (step 1), an optimum base quadrilateral is shown in dotted line segments (step 2a), a first plurality of isosceles triangles T1, T3, T2, T4 is shown forming a closed loop on the base quadrilateral (step 2a, step 2b), two straight line segments 202 connecting opposed peak points (opposed vertices 1.103) are shown in step 2b, a location vector 203 is shown in the step 2C. Note, e.g., that the four dotted line segments of FIG. 5B form (are) the four bases of the isosceles triangles T1, T3, T2, T4.
The location vector 203 is calculated or determined according to the following equation(s) and/or properties: Vector 203 is the unitized cross product of the two line segments 202; the resultant vector 203 position is coincident with a point having the closest proximate points on the vector perpendicular to both middle points on the line segments 202.
A first ratio (h1+h3)/(h2+h4) is calculated in a step 2D, a set point 205 is initially located or positioned on the vector 203 according preferably to the following criteria of being a point on the vector 203 having the closest proximity to both middle points 204 (FIG. 5D) of the line segments 202, and a plurality of line segments 206 (FIG. 5F) is projected from the set point 205 to the peak points 1.103 of the isosceles triangles T1, T3, T2, T4 (step 2E). Typically, in the inventive method, the set point 205 (as clearly understood from, e.g., FIG. 5F) is initially located on the vector 203 at a location outside of a plane in which lie at least two line segments (e.g., two of the four dotted line segments shown in FIG. 5B) of the perimeter (e.g., dotted lines of FIG. 5B or 5C) of the base quadrilateral.
A second ratio is calculated having a numerator equal to the height of an isosceles triangle T5 and a denominator equal to the height of an isosceles triangle T6 (step 2F). See FIG. 5G. In a step 2G, the point 205 is moved or relocated to a location such that the reciprocal of (h5/h6)=(h1+h3)/(h2+h4) (step 2G). A surface point 304 is then generated at that location LLH.304 (step 3A). See FIG. 5I.
The method continues with the steps 3B, 3C, 3D, 3E, 3F and 4 until a next succession (group) of isosceles triangles having peak points 1.103 coincident with the surface edges have approximately zero total rise (e.g., 0.01% of total run). See FIGS. 5J-5O.
As shown, the instant method positions boundary surface points by employing isosceles triangles added (or built upon) the outsides of previous triangle edges (e.g., step 3B, 3E) of FIG. 5. Each isosceles triangle of the instant method requires only two congruent legs. Thus, triangles initially having additional dimensional constraints such as equilateral triangles are not essential for the instant invention.
More specifically, in the steps of FIG. 5:
1 Locate the isosceles triangle LLH.303 having the greatest height for a surface edge section 1.104. FIG. 5A.
2.a Generate four isosceles triangles LLH.303 in a closed loop of triangle base points 201, triangles: T1, T2, T3, T4. FIG. 5B.
2.b Form two line segments 202 between triangle T1-T3 and T2-T4 peak points 1.103. FIG. 5C.
2.C Cross the vector coordinates of the lines 202 for the coordinates of this vector 203 placing vector 203 at the location perpendicular with the middle points 204 of the line segments 202. FIG. 5D.
2.D Calculate the ratio of the sum of triangles heights for T1 T3 to T2 T4. FIG. 5E.
2.E Place an arbitrary point 205 on the vector 203 followed by projecting four (4) line segments 206 downwardly from the point 205 to the peaks 1.103 of triangles T1, T2, T3, T4. FIG. 5F.
2.F Calculate the ratio of the triangle heights formed by the peak points of T1 and T3 with the point 205 T5 and peak points of T2 and T4 with the point 205 T6. FIG. 5G.
2.G Move point 205 on vector 203 to the location where the reciprocal of (h5/h6) is equal to (h1+h3)/(h2+h4). FIG. 5H.
3.A Generate a surface point for a quarter surface section 301 with one corner being the new surface point LLH.304. FIG. 5I.
3.B Generate two new isosceles triangles T7 and T8 on opposing legs of T2 and T4. FIG. 5J.
3.C Form a loop of four triangles T1, T6, T7, T8 and generate 2.b-2.G a new surface point LLH.304. FIG. 5K.
3.D Generate two new isosceles triangles T9 and T10 on opposing legs of T1 and T3 with this quarter section 301. FIG. 5L.
3.E Form a loop of four triangles T5, T10, T4, T9 and generate 2.b-2.G a new surface point LLH.304. FIG. 5M.
3.F Form a loop of four triangles T9, TS, the triangle formed with peak T1 to point 3.A LLH.304 to peak 3.C LLH.304 T11, the triangle formed with peak T2 to point 3.A LLH.304 to peak 3.E LLH.304 T12 and generate 2.b-2.G a new surface point LLH.304. FIG. 5N.
4 Steps 3.C and 3.E are repeated over the original line 2.E 205 to 1.103 T1 to subsequent lines from the new quarter sections 401, 402, 403 so that steps 2.b-2.G are repeated in the quarters. FIG. 50.
FIG. 7 shows 12 useful primitives, SSL, LLS, LLH, HHL, HHS, SSH, SSB, BBS, LLB, BBL, HHB, BBH, (rules) which optionally can be utilized for additional clarification of the instant invention. Alternatively, a primitive as used herein may be defined as an infinitesimal change of state in a computer relative to the consistency of either three remaining states that in the entirety of the twelve primitives comprise the complete descriptions of the required hardware variations used to recompose a surface.
More specifically:
SSL is a scalar scalar line primitive where the scalar varies as a distance measurement 102 relative to a single line segment 101. FIG. 7A.
LLS is a line line scalar primitive where the position 203 of the line varies by an increment 201 of length 102 relative to an existing line 202. FIG. 7B.
LLH is a line line history primitive where the history is a surface array 301 of elements and the data is a loop of four isosceles triangles 303 and one surface point 304 in a storage element 302 comprising the description of a surface. FIG. 7C.
HHL is a history history line primitive where the history varies as any number of array elements 401 within a surface array 301 comprising a description of a sub surface. FIG. 7D.
HHS is a history history scalar primitive where the history varies relative to the scalar data with history described as surface data 500 and attached parameters 501 (eg, lengths of base figure edge). FIG. 7E.
SSH is a scalar scalar history primitive where the scalar magnitudes of parameter data 501 vary 601 relative to prior data history 500. FIG. 7F.
SSB is a scalar scalar boolean primitive where the scalar magnitudes of parameters 501 are increments of change 601 that are decremented typically by a half for each false boolean response 701. FIG. 7G.
BBS is a boolean boolean scalar primitive where the sign direction 801 of a scalar increment 701 is reversed as the function of a false boolean response 802 out of a true or false possible outcome. FIG. 7H.
LLB is a line line boolean primitive where the line 901 is the acceptance (true) or rejection (false) 902 of a parameter 501 relative to a boolean affirmation. FIG. 7I.
BBL is a boolean boolean line primitive where the boolean true or false label (true 901) is permanently applied to a parameter 501 as a record of acceptance 901 or rejection 902. FIG. 7J.
HHB is a history history boolean primitive where the direction 1101 of the history is the true or false label 1102 of the boolean operator, true is a direction and false is the negate of any direction along a path section 1103. FIG. 7K.
BBH is a boolean boolean history primitive where the boolean operator is the direction 1101 of a history section 1103 relative to the inference of one logic step 1201. FIG. 7L.
Optionally, a knowledge base KB can be created and used in the inventive method. See FIGS. 8-16. The steps E-I of FIG. 8 optionally may be performed subsequent to the step D of FIG. 2.
Binary tree data structures are the record of switching from one path point to the other within the context of a parent path point. Inference is recorded as binary tree sections having two child path points both inheriting the single parent point. Binary trees are the global connectivity of the process which converts logic steps into data structures. The inference of data continuously decomposes it to the base level of the 12 path primitives.
Path induction is the continuation of the alternate two points within a binary section relative to the single inference of either a label, data from the KB, or referral to the user. By specifying a path point label or confirming the induction of a point, data is formed out of the path sections into a generalization and partitioned from the scalar variation of the attached parameters. The local connectivity of path points from the current label BBL.501 (see explanation 5 for FIG. 13A, and FIG. 7J) is stored with the current label by the reference lines and accompanying acceptance LLB.902. Path data contained within the label is used to emulate the generalizations of surrounding scalar data having identical parameter types and connectivity with those parameters. Localized scalar comparisons are combined into interconnected larger path structures that are connected in with the binary tree structure as a succession of labels within the recorded inheritance of the process itself.
Paths of user interaction are records of the potential deduction of more specific data from the KB, the confirmation or rejection of a label, or of a child path point within the context of an existing parent point. Inheritance is the direction of confirmation within the binary tree structure marked in each binary tree section using combined BBH and HHB primitives 41.4101 (element 4101 of explanation 41), 4102, 4103 of FIGS. 14A, 14B, 14C. The two sources of potential information lie along the direction 4104 in explanation 41 of FIGS. 14A, B,C relative to the opposite path point. The existence of a label on data within the KB relative to a recorded user acceptance or rejection is the automatic response to future inferences of the same data. An extension of this property is using the recorded inheritance of identical path points to verify induction. Inheritance of the path relative to the potential inference is labeled within a path point by the HHB.1102 direction label. Marking the direction of a logic step BBH.1203 is the replication of the affirmation label HHB.1102 (FIG. 7K) pointing to the source of information combined into the single function of both the HHB and BBH primitives. By maintaining the relationship between the three data sources, paths are extended from the binary section independent of the processes that took place prior to the extension.
The process inference mechanism is the outward emulation of geometry relative to the inward decomposition of data ultimately converging to a path point existing as one of the twelve path primitives. All inferences produced from path induction extend from the background set of primitives to the geometry display on a CRT (see FIG. 18). Logic steps at the initial stages of developing new geometry begin with the consolidation of surface geometry that matches the data used by one of the 12 path primitives. Primitives LLH (FIG. 7C) and HHL (FIG. 7D) are used simultaneously to develop surface sections LLH.302 by combining four isosceles triangles LLH.303 that start the recomposition of a surface. An advantage to describing the totality of the process with the set of twelve path primitives lies in the ability to generate a true inference regardless of whether the data combined with any one primitives is gotten from inductive or deductive processes. The ability to transform the results of data association into the inference mechanism is extended to the record of the process contained in the path point data structure. Binary paths are the geometry that the eight primitives containing either one of the boolean or history identities manipulates as though the paths were external data. This is a desirable feature that has the inherent capacity to be operated from within itself regardless of the level of dynamism in the actual data.
Rejection of an inference is an inflection point 22.2201 (FIG. 13D) that is inserted back into the process for emulating scalar variations of the parameters associated with the inflection point geometry. Reversal of the path direction 22:2202 is the decrement of successive inferences describing geometry based on and ultimately ending with a single path primitive. A reduction of the volume of geometry similarly decreases the amount of attached parameters 22.503. The result is the smoothing of the initial surface to within an average of the original data representing the remaining path generalization. Desirable geometric details are then added to the smooth surfaces either as the insertion of original geometry scaled into place or additional geometry subsequently developed by the user.
Inference of data is the linear increment of a path point from identical parameters 5.503 having a combined closest percent similarity 5.502. FIG. 13A. Geometry is combined into a single path point 5.501 described by a periphery 6.602 of parameters HHS.501. Locating data HHS.502 having the closest similarity gotten from the KB automatically infers the magnitudes of connected scalar data 6.602 with respect to the points having identical generic structures 603. The scalar differences SSH.601 in the parameter 5.563 scalars are the magnitudes SSB.701 of alteration along a scalar path proportional to the most similar data from the KB and vice versa. An example is the use of the proportionality of the base quadrangle B5.1102 (FIG. 3) used to alter corners B2b.1,2,3,4 to location B3a.58c.5807. Scalar paths are applied to common line segments of two geometries and are used to move a point on one line LLS.202 of the lines to some new position LLS.203. FIG. 7B. Incrementing BBS.801 is a logic step commonly referred to the user for affirmation of the resulting geometric configuration.
Varying the magnitude SSL.102 of the total scalar path spread B3a.58.5804 (FIG. 3E) along a line segment SSL.101 simulates an inflection point by increasing the potential for similarity with other similar geometric data that is proportional within the context of the geometry label. Scalar paths are proportional to data having identical parameters 6.503 and the closest percent similarity 6.501.
Embedding binary sections of user interaction item 41 (FIGS. 14A, 14B, 14C) into binary path structures is the substitution of the process within itself. Confirmation of a parent point is the signal for later automatic affirmation of induced path data inheriting previous user interaction records. The paths are linear records of user interaction, geometry, and scaling contained in the same data structure in the reverse of the initial user manipulation of geometry. This maintains consistency with the inward processing of the inference mechanism. By building data in the general format of the 12 path primitives, only relevant vector locations are recorded within the global data structure. In the limit of logic steps, the association 57.5701 of inference within the data structure becomes negligible. The logic steps remaining are described by the KB-user-label 57.a,b,c structure of the binary sections. Discrepancy introduced by the discretization are shifted 57B.5704, 57c.5708, 57a.3705 in the order of 41.4102, 41.4101, to 41.4103. Cycling through each perspective 57b.a,b,c creates a path section extension 57d.5702 describing the context by which specific data is inferable using path induction. Maintaining the context of the three perspective cycles is the instruction of where the data is located in order to be guaranteed to be a detail of the general path. Any one of the binary sections within a structure is inferable from the other two by association. The result is the capacity to deduce specific data from some larger path scope defined as a single path point label 57a.5709. FIGS. 15A, 15B, 15C.
1.) Paths are converted into geometry relative to the eight primitives containing either or both of the boolean and history identities;
2.) Scalar magnitudes describing geometric configurations are proportional to similar geometry;
3.) Binary path data structures are the base for the deduction of specific data from parent path generalizations;
4.) Associating data with the functions in any one of the 12 path primitives is an inference, and
5.) All logic steps are transformed into inferences through the inheritance of one or more of the 12 primitive functions.
To recapitulate:
5 Comparisons with other scalar data 502 are done within the context of identical parameter types 503 with respect to an original piece of data 501. FIG. 13A.
6 Parameter applications to a single entity 501 form a generic figure of evenly spaced parameter points 603 located 602 with respect to the scalar magnitude of each parameter list 503.
15 Generic labels 1504 shift processing of the generalizations to a total data set 1505 so that the trivialization of parameters 1501 is the conversion 1503 of the set 1505 into generalized paths 1502. FIG. 13C.
22 Primitive group HHS-SSH-SSB-BBS 2202 is an inflection point 2201 in a path 1502 that reshapes a generalization 1201 relative to a matching other scalar magnitude of a parameter list 503. FIG. 13D.
41 Direction of affirmation from either the KB to the user 4101, user to labels 4102, or labels to the KB 4103 is the inference of the existence of the process itself from the other entity, labels 4101, KB 4102, or the user 4103. FIG. 14A, FIG. 14B, FIG. 14C.
57 Convergence with the boolean direction 4104 of the BBH.1101 and HHB.1101 primitives is convergence with an inference point 5709 relative to the boolean direction 4104. FIG. 14D.
57a Point convergence is checked with the user 4102 as the affirmation of direction 4104 and is initiated externally marked by a question string ? 5703 attached to the label of the point 5709. FIG. 14E.
57B Affirmation of the point 57a.5709 switches 5704 the process to the label 4101 that inferred the direction of the path section 4104. FIG. 15A.
57c Affirming points inherited with a label 57a.5709 switches 4103 the process to record the affirmation of inherited points from the KB to the user for affirmation 5708 of a label 57a.4102. FIG. 15B.
57d Direction of affirmation along the path section is used as a point extension 5705 inferred 57c.4103 need for user interaction 57c.5708. FIG. 15C.
57e Interaction using labels and user affirmation 4104 result in serial record paths 5706 ending at a negate boolean user response. FIG. 16.
Finally, implementing the invention, e.g., in software or otherwise coding software (e.g., instructions and data) for the steps of FIG. 2, 3, 4, 5, FIGS. 8, 9-16 of the instant invention is well within the skill of the art in view of the instant disclosure. FIG. 18 shows, interconnected, a light pen or mouse 2, keyboard 1, processor (e.g., CPU, etc.) external memory 6, display 4 and printer 5, in which the instant invention may be implemented.
While there has been shown and described what is at present considered preferred embodiments of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made therein without departing from the spirit and scope of the invention is defined by the appended claims.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
For almost three decades, Ms. LeVoy has provided effective counsel to her clients as they embarked on and completed a variety of business transactions in the merger and acquisitions and public and private finance arena. Having spent 12 years in the middle of her career as in-house M&A/Finance counsel for Time Warner Cable and Jones Intercable (now part of Comcast), Ms. LeVoy brings a dual perspective to her deal-making duties and has an acute understanding of what is most important to clients. She brings this perspective to her current role as outside advisor to mid-to-large sized companies that want to efficiently raise or borrow capital or complete a business combination or divestiture.
Ms. LeVoy also provides general corporate advice to many clients and assists her clients with a variety of commercial contracts. In addition, she has a significant legal opinion practice.
Having begun her career at Holland & Hart, Ms. LeVoy rejoined Holland & Hart's Denver office in 1999 after her time in-house. During her most recent tenure at the firm, she has served as the head of the business transactions practice group, the firm's audit letter committee and its recruiting committee, and currently serves as the Administrative Partner of the firm's Denver office.
Ms. LeVoy served as a law clerk to Judge Will Garwood of the U.S. Court of Appeals for the Fifth Circuit from 1982-1983.


text:
North Dakota political leaders are asking the NCAA to back off and let the state's flagship university keep its Fighting Sioux name and logo, even at the risk of potential blacklisting and scorn by other universities and its own conference.
Lawmaker involvement is a strategy even some University of North Dakota boosters question, and is unique among schools forced to decide whether to drop American Indian nicknames deemed hostile and abusive or accept penalties for keeping them.
North Dakota's debate appeared to be resolved when the state Board of Higher Education agreed in 2009 to drop the Fighting Sioux logo and nickname and UND agreed to phase them out by this Aug. 15.
But state lawmakers intervened earlier this year, passing a law that requires the university to retain the moniker and logo. If the school keeps them past the Aug. 15 deadline, it will not be allowed to use them in postseason tournaments nor host any such events.
Potentially more damaging, the Big Sky Conference, which UND hopes to join next year, has said the issue will complicate the school's conference membership and some schools may refuse to schedule games with North Dakota. Some believe that would lead to a broad decline in athletics.
Still, North Dakota lawmakers say hundreds of constituent emails substantiate tremendous public support for the current nickname. Some legislators have said they resent the nickname being characterized as hostile and abusive because they believe the name and logo are treated with respect. Others have said the change is being rammed down their throats by the NCAA and think the higher education board should have done more to adhere to residents' wishes.
About 20 schools with American Indian nicknames were targeted by an NCAA policy issued in August 2005. Some teams, like the Florida State Seminoles, were taken off the list when they received approval from namesake tribes. UND got the OK from the Spirit Lake Sioux, but were not able to get permission from the Standing Rock Sioux.


text:
If you haven't already headed over to iTunes App Store to download the new VH1 App, what are you waiting for? First thing you need to know is that it's the only way for you to catch a repeat viewing of CrazySexyCool: The TLC Story. And if you're looking for more information about what the app does, be sure and watch the promo spot for it above.
Last Lap: Why Is Tupac's Mother Involved In A Lawsuit?
Icona Pop give us the story behind their infectious tunes, Queen reveals why Sacha Baron Cohen left the Freddie Mercury biopic, and Paris Hilton reveals which rapper she'd be willing to marry.
First Dibs: What Did Jay Z Dish Out With Bill Maher?
What has Lady Gaga released on Facebook? Why did Death Grips fans trash the band's equipment? What does Icona Pop think of Robin Thicke's sultry "I Love It" cover?
Battle Of The Summer Jams: Icona Pop Face Off
It's the first week of July and the Battle of the Summer Jams is starting to heat up. Last week Miley Cyrus, Selena Gomez and Demi Lovato faced off in the fiercest battle yet. Lovato squeezed out a win with 37 percent of the vote. However she was neck and neck with Cyrus, whose fans rallied late in the game. This week we are putting Icona Pop to the test with two of the group's songs: "I Love It" and "Girlfriend." The group surely will be remembered this summer for heating up the charts, but which of the two singles will reign supreme?
The 5 Girl Groups We're Psyched For In 2013
The 90s were ruled by girl groups. The queens of En Vogue, TLC, Destiny's Child and the Spice Girls reigned supreme on the charts. But so far, the new millennium has seen a dearth of really kick ass girl groups on the U.S. charts. Now that One Direction has cracked open the market for boy bands, who are the lovely ladies waiting to sneak in, tear up the harmonies and serve some soul? Well, we've got five girl bands in particular that are winning us over with their own particular brands of pop. Forget all about "Spice World"…it's their world now.
SXSW 2013: When Was The Last Time Your Favorite Musician Bought A Compact Disc? (VIDEO)
One of the most amazing things about the evolution of the music industry is that music is suddenly more accessible than ever. The days of having to go out of your way and make a special trip to a record shop are long over. Now, the only thing standing between a consumer and a song they want to buy is the speed of your wireless connection. This advancement of technology has its costs, though: Many have penned obituaries for the medium that energized the music business in the 80s and 90s, the compact disc. Read more…
The Best Songs Of 2012 (According To Your Friendly Neighborhood VH1 Staffers)
When we began compiling our Best Songs of 2012 list, there were many differing opinions, and after briefly toying with the idea of pitting all our staff against one another in a Hunger Games fight-to-the-death scenario against the backdrop of Times Square, we conceded that the most diplomatic and least murderous thing to do would be to each submit our own list. You know, in the name of preserving a civil work environment and whatnot (not to mention our longstanding policy of avoiding contact with the human resources department). So while we didn't battle it out in a conference room or some such nonsense, each one of us faced an internal battle — choosing our favorite songs of the year.
As far as consensus is concerned, there were 21 songs that appeared on multiple ballots, but only eight that appeared on three or more lists: Carly Rae Jepsen's "Call Me Maybe" (4 ballots), Frank Ocean's "Pyramids" (4 ballots), fun.'s "We Are Young" (4 ballots), Gotye's "Somebody I Used To Know" (3 ballots), P!nk's "Just Give Me A Reason" (3 ballots), Usher's "Climax" (3 ballots), Azealia Banks' "212" (3 ballots), and Miguel's "Adorn" (3 ballots).
(Btw, before we get into this, we'd like to note that we put together the following Spotify playlist for your listening pleasure: VH1 Staffers Pick Their Favorite Songs Of 2012. It's sequenced in alpha order by artist first name, so we wholeheartedly recommend you hit Shuffle while listening to this 92 track playlist. Now, on with the show…)
Icona Pop's New EP Is (Probably) The Most Fun You'll Have On A Wednesday
Here's some music that'll make your mid-week blues feel more like end-of-week joy. Swedish duo Icona Pop, Aino Jawo and Caroline Hjelt, have shared a stream of their newest EP, Iconic, with the web and it if played correctly (all the way through) it should cure your weekday woes. Joining the irritable pop anthem, "I Love It", five other tracks prove Icona Pop to be consistent with their musical heritage (Swedes truly make the best pop) and confirming their "iconic" band name. Melodic synths, thumping drums, choruses perfect for screaming sing-alongs: It's like ABBA for 2012, if you ask me. (And I am not referring to the A*Teens.)
The best part about an EP? It's short, and exactly the length time it should take to get ready for a night out.
Summer Jams: Mark Graham Picks Three Of His Fave "Song of the Summer" Candidates
Summer, summer, summertime…time to sit back and unwind. Hey, if that's how Will Smith recommends to spend the months of June, July, and August, who am I to argue? As my colleagues Bené and Zara have attested, summer's a time to be spent outdoors with friends, preferably with a boombox in proximity. We're going to start counting down the 2012 Song Of The Summer very soon, but for now, here are three songs that I'll be hitting repeat on all summer long.
NOMINATION: Icona Pop, "I Love It"
EXPLANATION: Why do Swedes make the best pop music? Someone really ought to research this! While we all anxiously await for someone else to do the heavy lifting with that essay, I'm going to be bouncing around my apartment cranking this electro-pop earworm all the way up to 11, shouting "I DON'T CARE!" like a madman. The pulsating beats that dare you not to bounce up-and-down while pumping your fists (not fist pumping, though, because that's lame), the crazy catchy sing-along melodies, the fact that it clocks in at exactly 3 minutes … all of these ingredients create a perfect recipe for a summer jam.
Read more…