text:
This recipe came from my one of my favorite cook books. It is a winner every time I make it.
Red & White Pasta (original recipe)
- 4 c. penne pasta, spirals and other noodles will work
- 1-15 oz alfredo sauce
- 1-24 oz marinara sauce
- 2 c. mozzarella, shredded
- 1 c. parmesan, shredded
Preheat oven to 350
Grease a 9×13 casserole dish.
Cook and drain pasta according to directions, leave the pasta in the colander for a moment.
In the pan from the pasta combine sauces and mozzarella cheese. stir until mixed.
Mix in the pasta and place into the greased casserole.
Bake 20-25 minutes until bubbly
Sprinkle with parmesan cheese and bake another 5 minutes.
serves 6-8


text:
FeelNYC's review of the Museum Mile Festival 2012 in New York
FeelNYC's review of the fabulous Museum Mile Festival 2012 in New York is a solid thumbs up! The Museum Mile, in New York's Upper East Side, comprises a stretch along famous 5th Avenue in New York lined with museums and cultural institutions, a paradise for authentic culture vultures. And with the Museum Mile Festival 2012, New York has gone one better as on Tuesday the 12th of June, from 6 to 10pm, 10 museums along this marvelous mile will be open free for the public to enjoy!
This annual event was initially started in 1979 to promote the arts in New York and make it more accessible to the public. Since then, more than 1 million people have carried out this famous walk from 82nd street to 104th street.
In addition, 5th Avenue is completely closed off to traffic, thus Museum Mile festival-goers can enjoy a pleasant stroll, visit the 10 participating museums, and take part in all the special exhibitions and events on offer.
Featuring this 2012 are the following ten museums and cultural institutions situated along the New York Museum Mile; the Museum for African Art, the Museo del Barrio, Museum of the City of New York, the Jewish Museum, and the Cooper-Hewit, National Design Museum, Smithsonian Institution, as well as the National Academy Museum and School of Fine Arts, the world-famous Guggenheim Museum, the Neue Galerie New York, the Goethe-Institut New York, and last but not least, the Metropolitan Museum of Art. FeelNYC's review; outstanding!
In addition, fortunate visitors to the festival can take advantage of the outdoor activities for children, as well as live music ranging from jazz and show tunes to string quartets, and the various street performances. The Museum Mile Festival this year will be kicking off at the National Academy Museum on 1083, 5th Avenue at 5.45pm so you've no excuse!
FeelNYC's review is that you'd be mad to miss out! If you agree with FeelNYC's positive review then make sure you don't miss out on the cultural offerings in the Museum Mile Festival 2012 in New York!
FeelNYC with the National Tartan Day Parade 2012 in New York
First it was Saint Patrick's, now it's National Tartan Day. On the 14th of April 2012, New York will celebrate Scottish heritage in the Big Apple with the 14th edition of the National Tartan Day Parade.
It commemorates the Declaration of Arbouth signed in 1320. This Scottish Declaration of Independence has a special significance for Americans as it was inspiration behind America's own declaration. In addition, it is estimated that more than 6 million Americans claim they have a Scottish descent. The 6th of April was thus declared National Tartan Day in recognition of the Scottish Americans' contribution to the United States.
Visitors and locals alike can see numerous members of Scottish clans and organisations in the city celebrating their Scottish roots and heritage. Pipers and drummers from over 26 countries will proudly gather on 6th Avenue at 2pm on the 14th of April 2012 and parade through the streets of New York to Highland classics such as Scotland the Brave, Green Hills of Tyrol, Cock of the North, Farewell to the Creeks and Battle's O'er Lochanside.
Such are the celebrations that in past editions of the event over 10,000 pipers and drummers have taken part, thus forming, as can be expected of New York, the largest pipe band in the world. One year, Sir Sean Connery himself led the parade alongside the New York City Mayor. In addition, William Wallace's sword, one of Scotland's national treasures, which hasn't left the country for an impressive 700 years, was flown to New York for the National Tartan Day celebrations.
Prior to the march, they will celebrate NY Tartan Week and with it a whole host of events including the 10km Scotland Run, the "Life and Legacy of Andrew Carnegie" panel discussion in the Museum of American Finance, the VIP pre-show event, Butter, Whisky Live New York and Scottish theatre, amongst many other offerings.
Finally, festival-goers will be able to take part in the annual Tartan Day Post-Parade party at Stout's. Regardless of whether or not you have Scottish roots, we definitely recommend that you don't miss out on the New York National Tartan Day Parade and celebrations!
FeelNYC with the Cherry Blossom Season in New York 2012
FeelNYC with the Cherry Blossom Season in New York. It's that time of year again and the cherry blossom trees are blooming, thus the Brooklyn Botanic Garden (BBG) will once again be celebrating Hanami and the fascinating Sakura Matsuri Festival this April 28th and 29th 2012 in its honour.
The cherry blossom, believed to be a symbol of the natural life of a samurai (short-lived), is the national flower of Japan. Thus Hanami, the Japanese tradition of enjoying the cherry blossom season, is celebrated in the BBG. Celebrated on an annual basis since 1981, this Japanese spring festival is one of this New York garden's biggest attractions.
During Cherry Blossom Season, all the cherry blossom trees flower making for a stunning display on the Cherry Esplanade in the Gardens. On the final two days of Hanami, the BBG hosts their annual Sakuri Matsuri Festival, where locals and visitors alike can discover and enjoy a weekend of Japanese culture.
This festival, called Sakura, Japanese for cherry, comprises an entire weekend celebration of Japanese traditional and contemporary culture. Japanese and cherry blossom enthusiasts can enjoy a rich programme of activities and events including Taiko Drumming, Minbu Folk Dancing, Children's workshops, a Cosplay Fashion Show, Bonsai demonstrations, Samurai sword fighting, Manga artists, tea ceremonies and much more!
Finally, visitors can enjoy what they originally came to see…..more than 200 trees blooming in all their glory, in various parts of the Brooklyn Botanic Garden. The Sakuri Matsuri Festival 2012 starts at 10am and runs until 6pm. So, make sure you don't miss out on any of these exciting Japanese activities and the chance to enjoy a picnic under the lovely, flowering cherry blossom trees!
FeelNYC with the New York City Marathon 2012
The ING New York City Marathon, one of the largest in the world, will be taking place this 4th of November 2012. It forms part of the World Marathon Majors, and thousands of professional and amateur athletes from across the planet gather in the Big Apple to complete this 42.195km (26.219 mile) run.
Organised every year by the New York Road Runners, the New York City Marathon course runs through five of the city's boroughs including Staten Island, Brooklyn, Queens, the Bronx, and Manhattan. Fun and panoramic!
So, why are we telling you so soon? Well, given the popularity of the race, participants are selected via a lottery system therefore, if you are up for the challenge then now is the time to apply as the 23rd of April marks the deadline for all entries.
In addition to the thrill of crossing the finishing line at New York's Central Park, two million spectators will be there to cheer you on and 315 million viewers across the world will be rooting for you. Of course, the $600,000 prize moneyis always a plus.
Finally, prior to the marathon, on the 1st to the 3rd of November the New York City Marathon Health and Fitness Expowill be held. With free admission, it will feature over 100 stalls and exhibitors from around the world offering souvenirs, and health and medical advice, as well as race applications, activities, and much more.
This is your chance to be a part of one of the largest marathons in the world. So, if you've got what it takes then sign up now for the New York City Marathon 2012 and make your mark. Good luck!
FeelNYC with the New York City Saint Patrick's Day Parade 2012
FeelNYC with the world famous New York City Saint Patrick's Day Parade, which is back once again and will be taking place this 17th of March, as is tradition, on the prestigious 5th Avenue in the Big Apple. Saint Patrick's Day is a worldwide celebration, however the New York parade is the biggest and most spectacular in the world!
It all began in 1845 when the Great Potato Famine hit Ireland and many Irish families immigrated to America to avoid starvation. Interestingly the first parade held in honour of Saint Patrick was in New York in 1762, and ever since then Americans with Irish heritages, and those without, have been celebrating this special day ever since.
People typically dress in green and bear the symbol of Saint Patrick's Day, which is of course the shamrock, also a symbol for good luck. Bars and pubs will also be doing their bit by decorating their establishments in green and serving typical Irish beverages such as Guinness or Jamesons whisky tinted green with food colouring to get into the Saint Patrick's Day spirit.
Alongside the parade, visitors and locals alike can expect a whole host of events including the NYC Saint Patrick's Day Parade Gala Cocktail Reception and the Grand Marshal's Reception.
Despite the fact that floats, autos and exhibits and not allowed, more than 150,000 marchers participate in the New York Saint Patrick's Day Parade every year including Irish societies of the city, various schools, colleges, and Irish language and nationalist societies, etc.
Led by members of the National Guard's 69th Regiment, known as the "Fighting 69", this joyous parade will commence at 44th Street at 11am and make its merry way up 5th Avenue, pass St. Patrick's Cathedral at 50th Street, continue on to 83rd Street and finally come to an end at 86th Street at around 4:30 to 5pm.
It is advised that you leave your car at home and make your way to the parade by train or subway given that roads will be closed off in the surrounding area. Around 2 million people line 5th Avenue to catch a glimpse of the parade every year. That many can't be wrong.
So, now you know. FeelNYC with the New York City Saint Patrick`s Day Parade 2012, and all the fun Saint Patrick's Day activities on offer!

subset: commoncrawl


text:
With the Help of Our God – Clean Water in Uganda
I had heard the stories about the Aquascape Foundation giving tens of thousands of dollars for each of five rain-water harvesting systems given to International Needs partners in Central America and Africa, and the amazing work of Certified Aquascape Contractors from all parts of the U.S. who pay their own expenses to install water filtration systems that provide abundant and clean water. So when I was told that Aquascape had committed to installing a 25,000 gallon rainwater system at the Buikwe Secondary School in Uganda in January 2017, I lobbied hard for the opportunity to be part of the team.
We launched our first day together by talking about another team of artisans and builders who came together for a common good: Nehemiah and the rebuilders of the walls around Jerusalem. The detail of chapter 3 of the book of Nehemiah which lists the names and skill of each worker (and their sons and daughters), and the precise location of the section of wall each had rebuilt, came to mind as I looked at a group of 20 landscaping and aquatics contractors.
As our work week together unfolded, we would all learn that the story of the unity of the rebuilders of the ancient wall in Jerusalem would serve as a good comparison to what we would experience.
Day One on the site at the school in Buikwe greeted us with several issues. We were a day behind schedule. The pit our Ugandan friends dug was 30 yards west of where it was to be dug – beautifully excavated but too wide and sloped at the bottom requiring Ugandans and Americans to grab shovels and backfill the pit. The location of the pit demanded more PVC pipe and electrical wire than was shipped a month earlier from the U.S., requiring hours-long journeys into Kampala for more.
Meanwhile, the battery charger for the case of DC-powered tools sent for the job blew up when plugged into the outlets even though we had used the appropriate conversion devices. This led to the electrical team members making saws from knives duct-taped to PVC pipes, and using screwdrivers to punch holes through concrete walls for pipes and wires!
The truck from the Buikwe District Fire Department that carried the water to partially fill the reservoir was diverted the morning we were to test the system to a local fire, and was delayed a day arriving at the school.
Despite all the challenges, a solar-powered 25,000 gallon rain-water harvesting system was installed in only 2 ½ days!
Just before the team assembled to dedicate the system and receive the thanks of the International Needs Uganda staff, I stood looking at the work site quietly thanking the Lord for the provision of clean water for the 500 children of Buikwe Secondary School. Just then I heard someone say, "the Lord made this happen." I turned to see a member of the team standing next to me, and responded, "yes, He did."His words prompted me to look at Nehemiah's account again, where I found the same declaration in chapter 6, verse 16 where it reads, "…this work had been accomplished with the help of our God."
International Needs Uganda and USA thank the Certified Aquascape Contractors and Aquascape Foundation for their personal and professional contributions that will provide the people of Buikwe, Uganda with clean drinking water. We pray the Lord's grace and abundant blessings upon their families and businesses, and add Nehemiah's prayer on their behalf:
"Remember me, O my God, for good, according to all that I have done for this people." Nehemiah 5:19
Tom Farley


text:
|03 - 05 - 2014
|ESPN reports claims McQueary was sexually abused as a child
|[CDT] - According to a report published yesterday in ESPN The Magazine, Mike McQueary told PSU players in November 2011 that he was sexually abused when he was a child. The disclosure from McQueary reportedly came during a closed-door meeting just days after the Jerry Sandusky scandal erupted on campus. The ESPN report also cited four players who knew about the meeting. McQueary confided in the players about his being abused in the hope that they would understand how he reacted at the time. McQueary did not say who abused him or when it happened.


text:
Saturday, October 3, 2015
Finders Keepers Market Melbourne 2015
5 comments:
quite a few potters go to those markets too... I felt sorry for West Coast, Hawthorn couldn't put a step wrong!ReplyDelete
Fabulous! I LOVE craft fairs/markets! Thanks for sharing it. Those terrariums remind me to get on the ball with the one I have planned, for a vintage coffee pot.ReplyDelete
Oh my! I wish I could have seen the market too. The coffee caravan is so adorable - I hope the coffee they sold was as good as the look of their shop!ReplyDelete
Take care
Crochet Between Worlds
What a great day out in a beautiful building. Hope you feel better soon.ReplyDelete
How I love this type of market! And what a gorgeous building it was held in.ReplyDelete
Your pillowcases are fantastic -- very good choice indeed!
Thank you for taking the time to add your comment, I love to receive comments and read them all, even if I don't get around to responding to you, I am just not that organised!


text:
The "2017 Hua Juchen Fourth Taiyuan Tea exposition" was successfully held at the Shanxi Taiyuan coal trading center Center in July14, 2017. The exhibition not only shows the company's brand image of Shaanxi Dongyu Bio-Tech Co., Ltd, but also attracted a large number of customers come to discuss business, and achieved great results.
Shaanxi Dongyu Bio-Tech Co., Ltd Deputy General Mr. Su led a delegation to participate in it. Shaanxi DongYu biological company's flagship product organic green tea Hanzhong Xianhao, organic green tea Chaoqing, Organic black tea, Chrysanthemum Tea and so on.
It attracted many visitors to the exhibition. Fresh and sweet Dong Yu tea has been recognized and favored by Taiyuan friends.
Shaanxi Dongyu Bio-Tech Co., Ltd on behalf of Shaanxi's outstanding tea enterprises, to Fairview Taiyuan show Hanzhoung cents Charm.
Shaanxi Dongyu Bio-Tech Co., Ltd (as DONGYU in brief) was founded in 2001, with its location at beautiful Xixiang County of North-West of China.IThe characteristic of the product is rich in trace elements zinc and selenium. We built green tea processing and production factory with annual capacity of 500 tons.
Previous: Shaanxi Dongyu Bio-Tech Co., Ltd Successfully Participated In The 2017 World Pharmaceutical Raw Materials & P-MEC Chinese Exhibition
Next: Dong Yu Brand News Conference And The New Board Listed Brokerage Started Signing Ceremony Has Been Held


text:
Rose's Story
Name: Rose (previously known as Ginger)
Date of Rescue: September 2008
Rose and her foal were among a group of emaciated horses rescued by the Irish Horse Welfare Trust (IHWT) from a field in the midlands. There were also a number of horses in the field who had died of starvation. After being removed from the field Rose and her foal were taken to the IHWT facilities. Her foal was put on a drip for a week to aid his recovery. Later that year Rose moved to Festina Lente.
Rehabilitation Process
Although Rose was physically well when she came to Festina Lente it soon became apparent that Rose's treatment in the past had given her little reason to trust people. Over the next two years, Rose's programme included her getting used to people going into her stable, putting her head collar on, leading her in hand and being groomed. When she began to take part in riding lessons, the biggest challenge we faced was putting the bridle on and off. Rose did not like being touched around her ears which suggested that this part of her face had been mistreated in the past. Initially we had to remove the bridle piece by piece as it was not possible to remove it as one piece. A further problem we faced was Rose's refusal to walk forward. She would freeze on the spot. Using excessive pressure was not the answer and her trainers reverted to painstaking groundwork in order to gradually build Rose up to ridden work.
Rose working in a therapeutic riding lesson
Rose today
Six years later, Rose has developed into a lovely dressage and jumping horse and has become an icon in Festina Lente for her contribution to equine assisted learning. Her strength in this programme is her high level of sensitivity which is also her vulnerability – so great care is taken when she is involved in this programme. As a very sensitive horse, she needs a lot of maintenance particularly in the summer months and wears a sun mask and sun cream. Rose can also require a sun sheet. Rose was fortunate to have been rehomed in an organisation with a high level of patience, understanding and commitment to her retraining – and of course we are fortunate to have a horse who has offered so many people many pleasurable hours of riding and equine assisted learning.
Rose today


text:
President Trump once claimed that he would make a "big, beautiful" wall along the U.S.-Mexico border in order to curb illegal immigration once and for all.
While the legislation for the wall is being drafted, Trump has managed to divert enough funds to get the first 60 miles of construction started.
The White House has requested $1 billion from the White House's 2017 budget supplement for border and security defense, to fund 62 miles of the wall.
The money would be used to fund 48 miles of new wall, the necessary maintenance it will require, and upgrades for existing sections of border fence.
"The money will fund 14 miles of new border wall in San Diego, 28 miles of new levee wall barriers and six miles of new border wall in the Rio Grande Valley region and 14 miles of replacement fencing in San Diego," CNN reported.
Trump is committed to getting the wall built, but now it seems like House Republicans will fight him on it in order to try and embarrass him for the failures of their healthcare bill.


text:
21 critics reviewed the show, resulting in a weighted average of 65.
The New York Times
ShowScore: 90
"This delightfully weird and just plain delightful show will provide the kind of thrills we look for in all musical comedies, however outlandish their subject matter: an engaging and varied score, knocked out of the park by a superlative cast, and a supremely witty book…All of the performers are terrific…Although the show is primarily a series of solo turns, the staging is dynamic...For a musical about dead teenagers, it's high-spirited and just plain fun from start to finish."
ShowScore: 60
"This quirky show pushes hard for its desired audience response, be it laughter or tears. Unfortunately, it's not nearly as funny as the writers seem to think and a last-minute U-turn toward schmaltz comes across as unearned…Everyone in the cast works up a sweat selling the material they have to work with...Under the steady and efficient direction of Rachel Rockwell, the whole thing feels like a Fringe Festival musical with really high production values."
New York Theater
ShowScore: 80
"If the musical feels largely derivative, it features an appealing, talented cast, a dozen witty, energetic songs in a variety of popular styles, and a spectacular design for such a small-scale show. Although the characters are dead, that doesn't stop them from being fun and funny, albeit in a familiar way…The premise winds up being little more than the frame for a series of entertaining musical numbers. But the cast makes the most of them."
"Ride the Cyclone" was also reviewed by Matthew Wexler of Broadway Blog, Doug Marino of Act Three - The Reviews, Brian Scott Lipton of Theater Pizzazz, Robert Hofler of The Wrap, Linda Winer of Newsday, Jesse Green of New York Magazine / Vulture, David Rooney of The Hollywood Reporter, and Matthew Murray of Talkin' Broadway.
The show was also reviewed by 114 Show-Score members, whose collective ShowScore is a weighted average of 81.
Top five adjectives describing the show:
Quirky, Clever, Entertaining, Great staging, Funny
See it if…"You enjoy original musicals in content, form, and viewpoint. You want your cerebral ideas mixed with more pedestrian bits."
Don't see it if…"You're going to be disappointed with a piece that does not fulfill all of its ambitions."
See it if…"You like to have fun, and for some exciting theatrical moments, even though the theme is a bit trite."
Don't see it if…"You like complex, ambiguous theater and you don't like some dark ideas."
See it if…"You are looking for a really original show with quirky characters that you can't help but love. Great mix of comedy, drama, and heart."
Don't see it if…"You prefer traditional musicals and story lines, or don't like shows that rely on special effects and projections, although they are used well."
See the Show Page with all critic and member reviews.
Note: The ShowScore displayed above is current as of right now, and may be different from the ShowScore when the article was published.


text:
Journal of Sensors
Volume 2016, Article ID 9358358, 15 pages
Deployment of Wireless Sensor Networks for Oilfield Monitoring by Multiobjective Discrete Binary Particle Swarm Optimization
1School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China
2School of Information Engineering, Guangzhou Panyu Polytechnic, Guangzhou 511483, China
3Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong
Received 16 December 2015; Revised 21 February 2016; Accepted 28 March 2016
Academic Editor: Liling Fu
Copyright © 2016 Zhen-Lun Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The deployment problem of wireless sensor networks for real time oilfield monitoring is studied. As a characteristic of oilfield monitoring system, all sensor nodes have to be installed on designated spots. For the energy efficiency, some relay nodes and sink nodes are deployed as a delivery subsystem. The major concern of the construction of the monitoring system is the optimum placement of data delivery subsystem to ensure the full connectivity of the sensor nodes while keeping the construction cost as low as possible, with least construction and maintenance complexity. Due to the complicated landform of oilfields, in general, it is rather difficult to satisfy these requirements simultaneously. The deployment problem is formulated as a constrained multiobjective optimization problem and solved through a novel scheme based on multiobjective discrete binary particle swarm optimization to produce optimal solutions from the minimum financial cost to the minimum complexity of construction and maintenance. Simulation results validated that comparing to the three existing state-of-the-art algorithms, that is, NSGA-II, JGGA, and SPEA2, the proposed scheme is superior in locating the Pareto-optimal front and maintaining the diversity of the solutions, thus providing superior candidate solutions for the design of real time monitoring systems in oilfields.
1. Introduction
In recent years, with the advent of industrial wireless sensor networks (IWSNs), the fusion of wireless communication and distributed sensing technologies and real time remote monitoring with IWSNs have been widely adopted in oil, gas, and other resources industries. As reported in [1], IWSN is the only feasible sensing solution for the oil and gas industry benefited from lowering costs and expanding the possibilities for new and future improvements. In fact, oil and gas companies are migrating to standards based wireless mesh sensor networking according to the survey in [2]. In China, at present, the domestic digital oilfield has been in rapid development. Daqing Oilfield Company is playing the leading role while Xinjiang Oilfield and Tarim Oilfield are establishing their digital oilfields. The effective use of wireless technology is essential to the success of digital oilfield management [3]. Wireless real time monitoring system provides a simpler access to real time data and insight into operations in oilfield at acceptable cost. Besides, the maintenance costs, downtime, and energy consumption will be reduced and equipment performance will be improved.
To the best of our knowledge, all existing applied studies on IWSNs for oil well remote monitoring are on the system design such as the main structure, hardware component, and software design [4, 5], aiming at extending the application of IWSNs in oil and gas industry. However, the inclusion of further optimization of IWSNs in oilfield monitoring system is essential towards the efficiency of design and system operation. There is still no research focusing on such topic yet. In this paper, a systematic framework providing problem formulations and a novel optimization strategy is proposed and it can be the reference for further attempts to optimize the IWSNs in oilfield management.
Typical structure of IWSN for oil well remote monitoring is shown in Figure 1 regardless of the fact that it is for production wells or water injection wells. Sensors are installed on the operation components of the wells. Pressure, voltage, and stream temperature of each well are acquired and transmitted to the control center via the wireless networks. Sensors are usually powered by batteries and do not support long distance transmission since energy consumption is a superlinear function of the transmission distance. Sensor nodes are in general configured as an end-device with less communication capability only allowed communicating with relay node or sink node. To guarantee the reliability of data communication and the ease of system setup, a relay node called well relay is deployed next to the operation unit in every well to collect sensor data and forward to the sink node. In this model, sensors at each well are capsulated as a point represented by the position of the corresponding well relay. The deployment of well relays is determined by the condition and landform of each well and should be decided in advance of the placement of sink and relay nodes. In wireless networks with fixed infrastructure, it is sufficient for each node having a wireless link connected to at least one sink node acting as the gateway to collect all the data in its dominating area and deliver the data towards the remote server. The remote communication protocol for sink node can be either McWiLL, WiMAX, or 3G/4G. The connecting path of a well relay and its serving sink node may consist of multiple relays in between if the well relay is far away from the sink.
The traditional deployment issue in WSNs normally refers to the placement of sensors so as to minimize the number of deployed sensor nodes while ensuring the full coverage and connectivity of the monitoring area [6, 7]. However, contrary to generic WSNs, the node placement in IWSN for oil well monitoring is deterministic to meet the desired monitoring tasks. The deployment strategies of generic WSNs cannot be directly adopted for IWSNs for oil well monitoring due to the difference in requirements and work conditions such as critical requirement for reliability, the uniqueness of each sensor measurement [8, 9], and some application-specific features of IWSNs for oil well monitoring.
With the prior information of each well relay's position, the deployment problem in oil well monitoring mainly concerns the optimum placement of data delivery subsystem consisting of relays and sinks to ensure the full connectivity of the well relays while keeping the construction cost as low as possible and with least construction and maintenance complexity. In this paper, the deployment problem of IWSN for oil well monitoring is formulated as a constrained multiobjective optimization problem and solved with a novel multiobjective discrete binary particle swarm optimization algorithm. The major contributions of this paper are described as follows:(1)A novel multiobjective model is provided to optimize the deployment problem of IWSN for oil well monitoring.(2)A discrete binary MOPSO framework with an efficient constraint handling method through the elitist seed repopulation and an infeasible solution archive is proposed.(3)A novel hybrid local attractor based position updating rule is introduced to improve the exploration and exploitation capabilities of the multiobjective particle swarm optimization (MOPSO) algorithm.
The rest of this paper is organized as follows. Section 2 discusses related work. Section 3 presents the mathematical formulation of the deployment problem including definition and objective functions. Section 4 describes the proposed approach for solving the multiobjective optimization of deployment problems as described. Section 5 illustrates the experimental results, followed by the conclusion in Section 6.
2. Related Work
The deployment problem of data delivery subsystem of industrial WSNs and nonindustrial WSNs has been studied well over the past years. The commonly used approach in early researches formulates the deployment problems as optimization problems in graph theory and solves them with polynomial time approximation algorithms in order to minimize the number of relays in order to meet certain connectivity or survivability requirements. Cheng et al. [10] proposed a scheme of placing the fewer amount of relay nodes in an area interconnecting all sensing nodes with the model formulated as a Steiner Minimum Tree with Minimum Number of Steiner Nodes problem. Pan et al. [11] presented the approaches to maximize the topological network lifetime for a two-tiered WSN by arranging the location of base stations and relay nodes under several definitions according to mission criticality. In [12], relay node placement was studied in a large-scale two-tiered WSN with the 2-connected network topology to provide fault-tolerance. Lloyd and Xue [13] studied the problems of minimizing the number of relay nodes by formulating the model as a Minimum Spanning Tree (MST) problem. Misra et al. [14] studied constrained version of the relay node placement problem. Some recent studies have focused on applying multiobjective optimization algorithms to relay nodes placement problems. A multiobjective evolutionary algorithm was proposed by Perez et al. [15] for the simultaneous optimization of the number of relays and the energy dissipation when deploying a WSN. Zhong and Zhang [16] presented a multiobjective memetic algorithm to optimize the relay node placement problem with consideration of the network lifetime and the number of relay nodes.
Other than the researches on deployment of data delivery subsystem of WSNs, researches relevant to this study, such as the placement of base station in wireless networks, are described here. Chan et al. [17] proposed a multiobjective jumping genes paradigm for the base station placement optimization of factory WLAN network with the aim of optimization to obtain a good quality of service and good quality for communication traffics without suffering from the cost of overall system. Ting et al. [18] proposed a multiobjective variable-length genetic algorithm to search for the optimal number, types, and positions of heterogeneous base stations by considering coverage, cost, capacity, and overlap. An improved NSGA-II algorithm is proposed by Lakshminarasimman et al. [19] to determine optimal location of base station in cellular mobile communications network with consideration of coverage maximization and cost minimization. Wechtaisong et al. [20] presented a WiMAX network planning model to assign optimized amount and location of base stations in study area with the aims of minimizing installation cost and maximizing service coverage simultaneously; a weighted sum method was used to transform two objectives to single objective and the solution for the model was generated by CPLEX 5.2 optimization solver.
All in all, the problem of data delivery subsystem deployment in oilfield monitoring has three features which could not be found in each of the approaches mentioned above:(1)Energy efficiency is a key issue for the problem. The specific structure of IWSNs for oil well monitoring as illustrated in Figure 1 is established to guarantee the maximum degree of energy efficiency. Based on this structural model, there is no need to consider the network lifetime or energy criterion in the optimization.(2)In different areas of oilfield, the distributions of oil wells are diverse; in particular, those in periphery are normally constructed in harsh environments with complicated landform. It imposes different challenges to the placement of relays and sinks.(3)Based on the structural model, the full coverage to the sensors is transformed to the full connection of the well relays.
As in the structural model, the relay nodes and sink nodes constitute a data delivery subsystem of the IWSN; an optimized deployment of such a data delivery subsystem is economical for the construction of the network. Moreover, it is essential to ease the construction and operation maintenance of the wireless network for the generally complicated landform of oilfields and the diverse distributions of oil wells. Hence, it is necessary to minimize the cost of network while keeping the complexity of construction and maintenance of the IWSNs as simple as possible. However, these two objectives may not be reached simultaneously as they are contradictory.
In this paper, a multiobjective discrete binary particle swarm optimization algorithm is studied in solving the deployment problem of IWSN for oilfield monitoring. The proposed scheme provides the nondominated tradeoff solutions so that the selective decision can be made among these solutions according to the design preferences.
3. Problem Description
Connectivity is the major concern in the deployment of WSNs [21]. Without loss of generality, in this paper, the communication ranges of different kinds of nodes are regarded as the same. Assume that any two nodes in the network, and , can directly communicate with each other if their Euclidian distance is within the communication range ; that is, . Due to complicated landform of oilfield, it may impose serious problems on the construction, maintenance, and communication reliability if there are too many relay nodes between the sink and the well relay in the link. In practice, the maximum hops in a single link should be limited to a brim, . In other words, the maximum allowable number of relays between the sink and the well relay is confined to .
Suppose that the target area A is digitized into pixels with pixel size equal to 1. Although the oil wells are generally distributed around the target area dispersedly, several oil wells may be constructed closely for the requirement of operation. In this case, well relays which are able to communicate with at least another well relay can be grouped as one well relay cluster. The well relay cluster set on the target area can be defined as with each cluster defined as , where is a well relay in the cluster, is the number of well relays in the cluster, which varies in different clusters, and is the number of the clusters, . Each member in the cluster must satisfy the communication range requirement: According to (1), the members of a cluster are interconnected with at least one neighbor; with at least one well relay connected to the sink, this will guarantee the connectivity of the whole cluster. The well relay of the cluster connected to the sink is called the entry well relay.
Define the relay node set and sink node set on the target area as and , where is of and is of . The connectivity model of the IWSN system can be expressed as follows.
A well relay cluster is said to be connected to the data delivery subsystem, denoted as
Following the data path, where sensor data are delivered to the sink node, the model can be simplified as follows.
A well relay cluster is connected to the data delivery subsystem when it satisfies the following:Hence, the deployment problem can be regarded as a sink node placement problem.
The event that the entry well relay of cluster located at the pixel connecting to the sink node located at the pixel is denoted as . It can be expressed by a two-valued function:If any entry well relay of cluster is connected to any node in the sink node set, its connectivity is considered completed. As a result, the event that the well relay cluster is connected to the sink node set can be denoted as
Finally, the connectivity rate of the well relay cluster set is defined as the ratio of the number of connected well relay clusters to the total number of the well relay clusters:
The challenge of the deployment problem is to deploy the nodes of the data delivery subsystem in an optimal manner meeting the connectivity requirement and achieving a balance between the financial cost and the complexity of construction and maintenance.
It can be illustrated by a simple example having six clusters of well relays as shown in Figure 2.
Figure 2(a) illustrates one of the extreme solutions that the data delivery subsystem is comprised of only one sink node and multiple relay nodes. Unlike the normal relay simply having the capability of data forwarding, the sink node has higher operation capability and extra functions such as data storage and remote communication. It is much costly than a relay. Although this solution is less costly as only a single sink node is required, numerous relay nodes have to be installed on the specified locations. The complexity of construction and maintenance will be high and even not plausible due to the landform complexity. Besides, it is unreliable to have a single sink for the entire network since any failure may lead to a halt for the entire network and suspend the operation of the oil field.
Figure 2(b) shows the other extreme in which each cluster of the well relays is coupled with a nearby sink node. The complexity of construction and maintenance is rather low. However, it may lead to a very high cost due to the fact that a large number of sink nodes are needed.
A compromised practical solution between the two extreme cases is shown in Figure 2(c). The clusters of well relays can be grouped into superclusters, and each of the superclusters is connected to a single sink node. The financial cost of this solution is higher than the solution in Figure 2(a) but much lower than the solution in Figure 2(b). For the construction and maintenance complexity, on the contrary, it is higher than that of the solution in Figure 2(b) but lower than the solution in Figure 2(a). Obviously, the two criteria are contradictory such that a single optimum solution minimizing both objectives is implausible.
Apparently, the cost of the data delivery subsystem is determined by the total cost of sink nodes and relay nodes of the communication link between the well cluster and the sink. It is desirable to keep the number of sinks as fewer as possible. On the other hand, more delivery nodes may lead to higher complexity for construction and maintenance. Because of the complicated landforms of oil fields and the dispersed distribution of oil wells, it is generally implausible to share the relay nodes amongst different data links. For such reason and the simplification of analysis as well, here we do not consider the sharing of relays between different links from well relays to sink nodes.
Define the number of relay nodes in the links from well relay to sink node as , where is the number of the links being the same as the number of clusters.
Each element in the vector is referred to aswhere is the ceiling function and is the serving sink node for the well relay cluster with the entry well relay , .
As described above, the deployment problem can be formulated as a Constraint Multiobjective Optimization Problem (CMOP) for the following objectives.
Objective 1. The financial cost of the data delivery subsystem is defined aswhere and are the financial cost of relay node and sink node, respectively, and is the number of the sink nodes in the data delivery subsystem.
Objective 2. The complexity of the construction and maintenance is defined assubject to condition for the full connectivity of all well relay clusters defined as
To solve the deployment problem, a multiobjective particle swarm optimization is proposed. The algorithm is based on our recent work [22, 23] in solving multiobjective optimization problems.
4. The Proposed Algorithm
Particle swarm optimization is a population-based search algorithm inspired by observing the bird flocks and fish schools [24]. Kennedy and Eberhart [25] extended PSO to solve discrete problems in 1997. In their binary PSO (BPSO) algorithm, particles are bounded to include binary variables and the velocity serves as the probability to change a bit's value. Afterward, various improved algorithms based on BPSO were proposed such as discrete multiphase PSO [26] and the angle modulated PSO [27].
In order to provide discrete PSO in a more general framework, various approaches have been reported in the literatures. Clerc [28] defined the position of a particle as a permutation of numbers and the velocity as a set of swaps in discrete PSO (DPSO). Salman et al. [29] defined the position as a real vector and apply a space transformation technique to convert the position into its corresponding solution. Pang et al. [30] defined the position and velocity as a fuzzy matrix with the updating rules for the particles based on XOR operator. Chen et al. [31] proposed a set-based discrete PSO in which the candidate solution and velocity are defined as a crisp set and a set with possibilities, respectively.
Nevertheless, most of these researches mainly concern with single objective optimization. In recent years, some attempts have been made to solve multiobjective optimization problems with DPSO. Palermo et al. [32] put forward a DPSO algorithm for multiobjective design space exploration based on an "aggregating" approach where the swarm is equally partitioned into subswarms, each of which uses a different cost-function determined by the product of the objectives combined with a set of randomly chosen exponents. Cordeiro et al. [33] adopted particles update equations in [32] and proposed an algorithm for the energy and performance optimization in IC design. Gong et al. [34] proposed a multiobjective discrete PSO algorithm based on decomposition.
For the deployment problem, based on the binary coding scheme, we extend our recent works in [22, 23] with constraint handling through the elitist seed repopulation and an infeasible solution archive. In addition, a hybrid local attractor based position updating rule is employed to improve the exploration and exploitation capabilities of the algorithm. The pseudocode of the proposed elitist seed repopulation multiobjective discrete binary PSO with transposon (ES-MOBPSO-T) is given in Algorithm 1, and the details of the bolded and italic mechanisms in this algorithm will be elaborated later in this section.
4.1. Individual Representation
As the input, for each well relay, its location is defined by a two-dimensional coordinate and identified with a sequential number. The proposed deployment scheme aims at identifying the locations of the sink nodes for the system as the solution of the formulated multiobjective problem. According to the analysis in Section 3, the maximum number of sink nodes is equal to the number of well relay clusters. In the proposed scheme, to serve well relay clusters, each particle is represented by a binary bit-string as shown in Figure 3.
It consists of tuples representing the total number of sink nodes. The length of the string depends on the size of the service area. Each tuple is the binary representation of the location of a sink node followed by a status bit describing the existence status of the sink node. If the status bit is "1," it indicates that the sink exists; otherwise, the sink does not exist. The coordinates of each sink node can be determined by where and are the numbers of bit of the coordinates and is the bit length of a tuple.
As described in Section 3, a cluster is connected to the network if any member in the cluster is connected to a sink. To assign a serving sink node to a well relay cluster, the closest sink node to the well relay cluster will be selected as the serving sink provided the sink node exists according to the existence status of the sink and satisfies the multihop communication range constraint with any member of the cluster. If none of the members in a cluster having the distance to all the potential serving sink nodes satisfies the communication range constraint, the cluster is not connected to the delivery subsystem. In that case, the connectivity rate of the solution will be less than 1.
4.2. Elitist Seed Repopulation with Constraint Handling
As demonstrated in our previous work [22, 23], the combination of elitist seed repopulation and transposon operation improves both the exploitation and the exploration capabilities of MOPSO.
The key of elitist seed repopulation procedure is the reinitialization of the swarm. Periodically, after certain normal search iteration, the whole swarm will be reinitialized with particles generated from the elitists selected from the external archives and processed by the diversification operations. The elitists are treated as the seeds to produce new subswarms for restarting a new cycle of swarm computation. Two parameters, the frequency of elitist seeding operation and the number of seeds, are used to specify the elitist seed repopulation.
As described in Section 3, the deployment problem is a constrained optimization problem. To handle the constraints, the commonly used approach is to make use of penalty functions. However, the penalty function approach has to deal with the difficulty of choosing the appropriate tuning parameters [35]. The proper fine-tuned penalty coefficients are capable of balancing the objective and penalty functions while inappropriate penalty coefficients will make the optimization problem intractable. In this paper, the works in [22, 23] are extended to deal with the constraints in obtaining solution through the elitist seed repopulation method. Instead of using a single external archive to maintain the nondominated feasible solutions, an extra external archive is used to keep the infeasible solutions with minor overall constraint violation. The two external archives are used in the elitist seed repopulation operation. The pseudocode of elitist seed repopulation with constraint handling is given in Algorithm 2. In the binary tournament selection, the comparison strategy similar to the method in [36] is adopted:(1)If two solutions are feasible, the one in the less crowded area will be regarded as the better one.(2)If the two solutions are infeasible, the solution with smaller overall constraint violation will be regarded as the better one.(3)If one solution is feasible while the other is infeasible, the feasible solution will be regarded as the better one.In this paper, the diversification operations for elitist seed repopulation approach are transposon operations. A transposon is made of consecutive genes located in the randomly assigned position in each chromosome while the transposon operators are lateral movement operations that happen in one chromosome or between different ones. Generally speaking, there were two types of transposon operators [22, 37]: cut-and-paste and copy-and-paste as demonstrated in Figures 4 and 5, respectively. In PSO, a particle can be treated as a chromosome. The details of the transposon operation are shown in Algorithm 3.
To control the transposon operation, three parameters, jumping rate, number of transposons, and length of transposon, are used.
4.3. Leader Selection
Similar to the method proposed in [38], the leader is randomly selected from a specified percentage of the external archive. As mentioned previously, there are two external archives which contain the feasible and infeasible superior solutions, respectively. Leader is selected from the feasible external archive sorted based on the degree of crowding if it is not empty; otherwise, it will be selected from the infeasible external archive sorted based on the overall constraint violation.
4.4. Position Updating Rule for Particles
From Clerc and Kennedy [39], the convergence of the PSO may be achieved if each particle converges to its local attractor . Each dimension of the local attractor is defined as where and are the th dimension of the personal best of particle and the global best of the swarm in search iteration at , respectively, and is a random number generated with the uniform probability distribution in the range of .
To improve the exploration and exploitation capabilities of the algorithm, a hybrid position update approach is proposed. In each search cycle, the new position of each particle is generated by the transposon operation together with mutation on the position of its local attractor. The pseudocode of the proposed approach is given in Algorithm 4, with transposon operation being the same as given in Algorithm 3.
Since the position of a particle is binary encoded, the local attractor of each particle cannot be generated directly from (12). A different calculation method must be used to decide the local attractor of each particle. According to (12), the coordinate of lies between and ; therefore, distributes randomly in the hyperrectangle with and being its two diagonal ends. That is,
The discrete form of local attractor can be generated through crossover operation [40]. is randomly selected from the two offspring generated by crossover on and . Definitely, the position of resulting from crossover satisfies (13) in terms of Hamming distance in binary space.
For each particle, the local attractor is determined with its personal best and the global best through the crossover operation. After all the particles are updated with their local attractors, they are further processed with transposon and followed by mutation with one particle at a time. Apparently, the convergence is enhanced by setting the position of each particle with the position of its local attractor. Moreover, the transposon and mutation operations bring perturbation effects to the swarm and guide the particles to better positions beneficial for the promotion of solution diversity and coverage. In addition, the elitist seed repopulation mechanism will relocate the superior particles to some specified area which is beneficial to overcome the premature convergence.
4.5. pbest Update
The update procedure of of each particle is shown in Algorithm 5.
4.6. External Archives Update
New solutions will go through an acceptance test before entering the external archives set with a fixed maximal size. If the feasible external archive is fully filled with nondominated solutions, the crowding distances [36] of the solutions will be calculated and those solutions with larger crowding distance value will be kept while the others will be discarded. If the infeasible external archive is full, solutions with larger constraint violations will be discarded from the archive.
5. Simulation Results
Simulation result for the verification of the proposed scheme is described in this section. The performance of the proposed multiobjective discrete binary particle swarm optimization is compared with three well-known multiobjective genetic algorithms, that is, NSGA-II [36], a well-perceived multiobjective optimization algorithm, JGGA which has demonstrated its superiority in solving a WLAN placement problem comparing to other well-known multiobjective optimization algorithms [17, 37], and SPEA2, a well-known algorithm in solving multiobjective optimization problems [41]. For the simulation experiment, 50 independent runs with random initial populations were conducted for each of the algorithms. All algorithms are implemented in MATLAB and all the simulations are conducted under the computing environment with a Lenovo notebook PC, 4 GB RAM, Core i3 2.13 GHz CPU clock speed, Microsoft Windows 7, and MATLAB 2010a.
5.1. Test Problems
Without loss of generality, all parameters represented in numerical value are without the measurement unit, and distances are measured in the unit of grid points for the simulations. All test problems are designed based on the reference of the oil wells distribution of Daqing and its periphery oilfields [42, 43]; the well densities and the scales of target areas were changed to construct different scenes for the empirical study. A typical distribution instance referred to in this study is shown in Figure 6. This area is a part of Y322 block at Yushulin oilfield in Daqing, China.
Test Problem 1 (TP1). There are 100 well relays distributed in a target area. The total cluster number is calculated with (1) and turns out to be 25. As described in Section 4.1, there is a potential sink node for each cluster. Thus, the number of corresponding potential sink nodes is 25. According to the scale of the target area, the bit lengths of both and coordinates of each sink node's location are 12. The maximum hop in each link is 4, and the communication range is 200. The financial costs of sink node and relay node are 8 and 1, respectively.
Test Problem 2 (TP2). The well density is double as in test problem 1. There are 200 well relays clustered to 57 clusters with 57 potential sink nodes being distributed in a target area with other settings remaining the same as in test problem 1. This test problem is to test the search abilities of the algorithms in a more densely distributed oilfield.
Test Problem 3 (TP3). The density is the same as in test problem 1 while the target area is four times larger. There are 400 well relays clustered to 124 clusters with 124 potential sink nodes being distributed in an target area. Accordingly, the bit lengths of both and coordinates of each sink node's location are 13 with other settings remaining the same as in test problem 1. This test problem is to test the search abilities of the algorithms in a larger-scale oilfield.
The deployment test problems were conducted with the proposed scheme. The potential solutions represented by the particles were reached through the searching process with the proposed ES-MOBPSO-T algorithm. Sink assignment for the potential solutions was carried out through the procedures as described in Section 4 under the condition as described in Section 3. The Pareto-optimal front was located at the end of the searching process. The same procedures were performed on the compared algorithms for the test problems. It is worth noting that, following the idea in jMetal which is a famous framework for multiobjective optimization [44], the constraint handling method used in the experiment for SPEA2 is the same as in NSGA-II.
5.2. Comparison Metrics
According to the discussion in [45–47], no single unary metric can give a comprehensive measure on the performance of an MOEA. In order to evaluate the performance of the proposed deployment scheme comprehensively, two widely used unary metrics together with one binary indicator are adopted in this study. They are the maximum spread (MS) [46], the hypervolume (HV) indicator [48], and the binary ε-indicator [49].
Maximum spread (MS) is a measure of how well the true Pareto-optimal front is covered by the generated Pareto-optimal front through hyperboxes formed by the extreme function values observed in the true Pareto-optimal front and the generated Pareto-optimal. The larger MS reflects a better coverage of the efficient frontier by the generated Pareto-optimal front. Since the true Pareto-optimal front of the problem is unknown, for each test instance, the maximum and minimum values in each of the optimization objectives are determined among all the Pareto-optimal fronts generated by all the algorithms in the simulation, and they are regarded as the extreme values of the true Pareto-optimal front in calculating the MS measure for each obtained solution.
Hypervolume (HV) indicator measures the spread of the solutions along the Pareto fronts and the closeness of the solutions to the Pareto-optimal front. Since the calculation of HV can be performed without the information of the true Pareto front, it is suitable for evaluating the performance of the proposed ES-MOBPSO-T and the compared algorithms for the deployment problem. The higher the HV, the better the obtained solution set approximates the Pareto-optimal front and maintains the diversity. Based on the analysis of all of the obtained solutions, the reference points used for evaluating the HV of the obtained solutions in TP1, TP2, and TP3 are set at (173, 68), (244, 95), and (633, 222), respectively.
Binary -indicator is a measure to compare the performance of two algorithms. Based on the values of , there are three cases of compared results of two algorithms: better, worse, and incomparable. For each algorithm, 50 simulation runs will produce 50 approximation sets. Hence, according to the definition of , there are 2500 pairs of comparison between the proposed algorithm and each of the compared algorithms.
5.3. Parameter Settings
To make a fair comparison, the positions of well relays were maintained the same for all algorithms and the stopping criteria were set at 600,000, the number of objective function evaluations for all algorithms in the simulation.
For the proposed algorithm, an initial population of 50 was used and the sizes of both of the external archives are set to 100. Single-point crossover was used to generate the local attractor of each particle. Bitwise mutation operator was used in the mutation to each particle's position and the probabilities for mutation were set as pm = , where is the binary string length. The jumping rate, number of transposons, and length of transposon were set at 0.1, 10, and 25 bits, respectively, in the position update procedure. In elitist seed repopulation, the jumping rate, number of transposons, and length of transposon were set at 1, 10, and 25 bits, respectively. The frequency of elitist seeding operation was set at 5 and the number of seeds was set at 4. An initial population of size of 100 was used for the compared algorithms. Single-point crossover and bitwise mutation operators were used in NSGA-II, JGGA, and SPEA2 with the probabilities for crossover and mutation set at 1 and , respectively. According to [37], the jumping rate, number of transposons, and length of transposon were 0.04, 1, and 3 bits, respectively, for JGGA.
5.4. Results and Analysis
For the MS and HV metrics results of the simulation experiment, the median () and interquartile range (IQR) of each test problem were recorded as the measure of location (or central tendency) and statistical dispersion. Since all the algorithms in the simulation experiment are stochastic, statistical analysis is essential to provide the confidential comparison. For MS and HV metrics on each test problem, the statistical analysis [50, 51] as shown in Figure 7 was conducted on the simulation results of the proposed algorithm and the algorithm with the best median value among the three compared algorithms. The Kolmogorov-Smirnov test is used to check whether the data sets of simulation result follow the Gaussian distribution or not. If the distribution is not normal, the nonparametric Kruskal-Wallis test is performed to compare the median results of the competing algorithms. For Gaussian distributions, the Levene test is used to check the homogeneity of the variances. And then if the variances are not equal, Welch test is invoked; otherwise, ANOVA test is performed to verify the confidence of comparisons. The results are shown in the last column of Tables 1 and 2, with the symbol "+" representing the performance difference between the proposed algorithm and the best among the three compared algorithms that is significant at the 95% confidence level, while the symbol "−" indicates that the difference is not significant. The simulation results in MS and HV metrics are shown in Tables 1 and 2, in which the best results for each problem are in bold. Table 3 shows the binary -indicator between ES-MOBPSO-T and the compared algorithms. TP1, TP2, and TP3 refer to the test problems 1, 2, and 3, respectively. The columns with titles "," "," and "" in Table 3 refer to the number of times the ES-MOBPSO-T performs better than, worse than, and incomparable to the corresponding compared algorithms.
Table 1 illustrates that, comparing to the other algorithms, the ES-MOBPSO-T is better in providing well-extended solutions for all test problems. On the other hand, Table 3 clearly reveals that the ES-MOBPSO-T algorithm exhibits very competitive performance to the compared algorithms in locating the Pareto-optimal front. In addition, from Table 2, we can see that the proposed ES-MOBPSO-T algorithm obtained the best values for the HV metric in all of the three test problems. It is evident that the ES-MOBPSO-T is competitive in both locating the Pareto-optimal front and maintaining the diversity.
The Pareto front approximations obtained in the simulation run with the median MS value or with the value closest to the median MS value of ES-MOBPSO-T and the compared algorithms were shown in Figures 8, 9, and 10. It should be noted that because solutions obtained in a single run may have the same objective values, there are some overlapped solutions in the target space. The algorithm with better capability to discover new and unknown areas in the search space will generate more scattered solutions. It is undoubted that ES-MOBPSO-T outperforms the compared algorithms in terms of solution coverage and diversity.
In test problem 1, ES-MOBPSO-T obtains more candidate solutions than the compared algorithms, with solutions locating in the more competitive positions in the target space. In the test instances with larger density of wells or larger scale, as in the cases of test problem 2 and test problem 3, ES-MOBPSO-T outperforms the compared algorithms with solutions having more competitive objective function values and is able to obtain a much more well-extended Pareto-optimal front which almost totally covers the solutions generated by the compared algorithms.
In the practical implementation of IWSNs for oil well monitoring system, one of the solutions obtained by ES-MOBPSO-T can be chosen and used to establish the fundamental positions of the relay nodes and sink nodes in data delivery subsystem based on the design preferences and the landform of oilfields.
6. Conclusion
A deployment scheme of industrial wireless sensor networks for oil well monitoring based on MOPSO was proposed in this paper. With the knowledge of well relay locations, an optimum sink node location and relay nodes number were designed to ensure the well relays' connectivity by considering the financial cost and the complexity of construction and maintenance. The simulation results show that the proposed ES-MOBPSO-T can produce diverse optimal solutions from the minimum financial cost to the minimum complexity of construction and maintenance and achieve a better performance than the other three state-of-the-art algorithms.
Future research will be focused on more empirical studies and the implementation of the oil well monitoring system based on this work.
Competing Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- M. R. Akhondi, A. Talevski, S. Carlsen, and S. Petersen, "Applications of wireless sensor networks in the oil, gas and resources industries," in Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications (AINA '10), pp. 941–948, Perth, Australia, April 2010. View at Publisher · View at Google Scholar · View at Scopus
- O. World, "Oil & Gas Wireless Sensor Networks," 2014, http://www.onworld.com/oilandgas/index.html.
- X. Xu, H. Tian, J. Fu, Z. Sun, and X. Xu, "Status and design of digital oilfield," in Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering, pp. 42–44, March 2013.
- Y. Pan, L. Xiao, and Y. Zhang, "Remote real-time monitoring system for oil and gas well based on wireless sensor networks," in Proceedings of the International Conference on Mechanic Automation and Control Engineering (MACE '10), pp. 2427–2429, Wuhan, China, June 2010. View at Publisher · View at Google Scholar · View at Scopus
- M. Dalbro, E. Eikeland, A. J. In't Veld et al., "Wireless sensor networks for off-shore oil and gas installations," in Proceedings of the 2nd International Conference on Sensor Technologies and Applications (SENSORCOMM '08), pp. 258–263, Cap Estérel, France, August 2008. View at Publisher · View at Google Scholar · View at Scopus
- A. Gogu, D. Nace, A. Dilo, and N. Meratnia, "Review of optimization problems in wireless sensor networks," in Telecommunications Networks—Current Status and Future Trends, pp. 153–180, InTech, New York, NY, USA, 2012. View at Google Scholar
- H. Mahboubi, J. Habibi, A. G. Aghdam, and K. Sayrafian-Pour, "Distributed deployment strategies for improved coverage in a network of mobile sensors with prioritized sensing field," IEEE Transactions on Industrial Informatics, vol. 9, no. 1, pp. 451–461, 2013. View at Publisher · View at Google Scholar · View at Scopus
- F. Barać, Performance Study of using Flooding in Industrial Wireless Sensor Networks, Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden, 2011.
- L. Wang, W. Ye, Y. Mao, P. G. Georgiev, H. Wang, and M. Fei, "The node placement of large-scale industrial wireless sensor networks based on binary differential evolution harmony search algorithm," International Journal of Innovative Computing, Information and Control, vol. 9, no. 3, pp. 955–970, 2013. View at Google Scholar · View at Scopus
- X. Cheng, D.-Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," Wireless Networks, vol. 14, no. 3, pp. 347–355, 2008. View at Publisher · View at Google Scholar · View at Scopus
- J. Pan, Y. Hou, L. Cai, Y. Shi, and X. Shen, "Topology control for wireless sensor networks," in Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 286–299, San Diego, Calif, USA, 2003.
- J. Tang, B. Hao, and A. Sen, "Relay node placement in large scale wireless sensor networks," Computer Communications, vol. 29, no. 4, pp. 490–501, 2006. View at Publisher · View at Google Scholar · View at Scopus
- E. L. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Transactions on Computers, vol. 56, no. 1, pp. 134–138, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
- S. Misra, S. D. Hong, G. Xue, and J. Tang, "Constrained relay node placement in wireless sensor networks: formulation and approximations," IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp. 434–447, 2010. View at Publisher · View at Google Scholar · View at Scopus
- A. J. Perez, M. A. Labrador, and P. M. Wightman, "A multiobjective approach to the relay placement problem in WSNs," in Proceedings of the IEEE Wireless Communications and Networking Conference, pp. 475–480, IEEE, Cancun, Mexico, March 2011. View at Publisher · View at Google Scholar · View at Scopus
- J.-H. Zhong and J. Zhang, "A multi-objective memetic algorithm for relay node placement in wireless sensor network," in Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO '11), pp. 159–160, Dublin, Ireland, July 2011. View at Publisher · View at Google Scholar · View at Scopus
- T. M. Chan, K. F. Man, K. S. Tang, and S. Kwong, "A jumping-genes paradigm for optimizing factory WLAN network," IEEE Transactions on Industrial Informatics, vol. 3, no. 1, pp. 33–43, 2007. View at Publisher · View at Google Scholar · View at Scopus
- C.-K. Ting, C.-N. Lee, H.-C. Chang, and J.-S. Wu, "Wireless heterogeneous transmitter placement using multiobjective variable-length genetic algorithm," IEEE Transactions On Systems, Man, And Cybernetics. Part B, Cybernetics, vol. 39, no. 4, pp. 945–958, 2009. View at Publisher · View at Google Scholar · View at Scopus
- N. Lakshminarasimman, S. Baskar, A. Alphones, and M. W. Iruthayarajan, "Base station placement for dynamic traffic load using evolutionary algorithms," Wireless Personal Communications, vol. 72, no. 1, pp. 671–691, 2013. View at Publisher · View at Google Scholar · View at Scopus
- C. Wechtaisong, T. Sutthitep, and C. Prommak, "Multi-objective planning and optimization for base station placement in WiMAX network," in Proceedings of the 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON '14), pp. 1–4, IEEE, Nakhon Ratchasima, Thailand, May 2014. View at Publisher · View at Google Scholar · View at Scopus
- R. V. Kulkarni, A. Förster, and G. K. Venayagamoorthy, "Computational intelligence in wireless sensor networks: a survey," IEEE Communications Surveys and Tutorials, vol. 13, no. 1, pp. 68–96, 2011. View at Publisher · View at Google Scholar · View at Scopus
- Z. Yang, A. Wu, and H. Min, "A multi-objective PSO algorithm with transposon and elitist seeding approaches," in Proceedings of the 6th International Conference on Advanced Computational Intelligence (ICACI '13), pp. 64–69, IEEE, Hangzhou, China, October 2013. View at Publisher · View at Google Scholar · View at Scopus
- Z. Yang, A. Wu, and H. Min, "A multi-objective discrete PSO algorithm based on enhanced search," in Proceedings of the 6th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC '14), pp. 198–201, Hangzhou, China, August 2014. View at Publisher · View at Google Scholar · View at Scopus
- J. Kennedy and R. Eberhart, "Particle swarm optimization," in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Australia, 1995.
- J. Kennedy and R. C. Eberhart, "A discrete binary version of the particle swarm algorithm," in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108, Orlando, Fla, USA, October 1997.
- B. Al-Kazemi and C. Mohan, "Discrete multi-phase particle swarm optimization," in Information Processing with Evolutionary Algorithms, pp. 305–327, Springer, Berlin, Germany, 2005. View at Google Scholar
- G. Pampara, N. Franken, and A. P. Engelbrecht, "Combining particle swarm optimisation with angle modulation to solve binary problems," in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '05), pp. 89–96, Edinburgh, Scotland, September 2005. View at Scopus
- M. Clerc, "Discrete particle swarm optimization, illustrated by the traveling salesman problem," in New Optimization Techniques in Engineering, pp. 219–239, Springer, 2004. View at Google Scholar
- A. Salman, I. Ahmad, and S. Al-Madani, "Particle swarm optimization for task assignment problem," Microprocessors and Microsystems, vol. 26, no. 8, pp. 363–371, 2002. View at Publisher · View at Google Scholar · View at Scopus
- W. Pang, K.-P. Wang, C.-G. Zhou, and L.-J. Dong, "Fuzzy discrete particle swarm optimization for solving traveling salesman problem," in Proceedings of the 4th International Conference on Computer and Information Technology (CIT '04), pp. 796–800, IEEE, September 2004. View at Scopus
- W.-N. Chen, J. Zhang, H. S. H. Chung, W.-L. Zhong, W.-G. Wu, and Y.-H. Shi, "A novel set-based particle swarm optimization method for discrete optimization problems," IEEE Transactions on Evolutionary Computation, vol. 14, no. 2, pp. 278–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
- G. Palermo, C. Silvano, and V. Zacearia, "Discrete particle swarm optimization for multi-objective design space exploration," in Proceedings of the 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools (DSD '08), pp. 641–644, IEEE, Parma, Ohio, USA, September 2008. View at Publisher · View at Google Scholar · View at Scopus
- F. R. Cordeiro, A. G. Silva-Filho, and G. R. Carvalho, "MOPSO applied to architecture tuning with unified second-level cache for energy and performance optimization," in Proceedings of the 22nd International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD '10), pp. 103–110, Petropolis, Brazil, October 2010. View at Publisher · View at Google Scholar · View at Scopus
- M. Gong, Q. Cai, X. Chen, and L. Ma, "Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition," IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, pp. 82–97, 2014. View at Publisher · View at Google Scholar · View at Scopus
- R. Le Riche, C. Knopf-Lenoir, and R. T. Haftka, "A segregated genetic algorithm for constrained structural optimization," in Proceedings of the 6th International Conference on Genetic Algorithms, pp. 558–565, July 1995.
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
- T. M. Chan, K. F. Man, K.-S. Tang, and S. Kwong, "A jumping gene paradigm for evolutionary multiobjective optimization," IEEE Transactions on Evolutionary Computation, vol. 12, no. 2, pp. 143–159, 2008. View at Publisher · View at Google Scholar · View at Scopus
- M. R. Sierra and C. A. C. Coello, "Improving PSO-Based multi-objective optimization using crowding, mutation and ε-dominance," in Evolutionary Multi-Criterion Optimization: Third International Conference, EMO 2005, Guanajuato, Mexico, March 9–11, 2005. Proceedings, vol. 3410 of Lecture Notes in Computer Science, pp. 505–519, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
- M. Clerc and J. Kennedy, "The particle swarm-explosion, stability, and convergence in a multidimensional complex space," IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar · View at Scopus
- J. Sun, W. Xu, W. Fang, and Z. Chai, "Quantum-behaved particle swarm optimization with binary encoding," in Adaptive and Natural Computing Algorithms: 8th International Conference, ICANNGA 2007, Warsaw, Poland, April 11–14, 2007, Proceedings, Part I, vol. 4431 of Lecture Notes in Computer Science, pp. 376–385, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
- E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: improving the strength pareto evolutionary algorithm," in Proceedings of the Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (EUROGEN '01), pp. 95–100, Athens, Greece, 2001.
- W.-S. Geng, Study on Development Effect Evaluation and Well Pattern Thickening in South Songfangtun Oilfield, Northeast Petroleum University, Daqing, China, 2013.
- G.-P. Jiang, Optimization Researeh on Adjusting Injection-Produetion System of Xingbei Development Area in Daqing, Zhejiang University, Hangzhou, China, 2008.
- J. J. Durillo and A. J. Nebro, "JMetal: a Java framework for multi-objective optimization," Advances in Engineering Software, vol. 42, no. 10, pp. 760–771, 2011. View at Publisher · View at Google Scholar · View at Scopus
- E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. Da Fonseca, "Performance assessment of multiobjective optimizers: an analysis and review," IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 117–132, 2003. View at Publisher · View at Google Scholar · View at Scopus
- G. G. Yen and Z. He, "Performance metric ensemble for multiobjective evolutionary algorithms," IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, pp. 131–144, 2014. View at Publisher · View at Google Scholar · View at Scopus
- E. Zitzler, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 1999.
- E. Zitzler and L. Thiele, "Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach," IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257–271, 1999. View at Publisher · View at Google Scholar · View at Scopus
- E. Zitzler and S. Künzli, "Indicator-based selection in multiobjective search," in Proceedings of the 8th International Conference on Parallel Problem Solving Nature (PPSN '04), Lecture Notes in Computer Science, pp. 832–842, Springer, Berlin, Germany, 2004. View at Google Scholar
- A. J. Nebro, F. Luna, E. Alba, B. Dorronsoro, J. J. Durillo, and A. Beham, "AbYSS: adapting scatter search to multiobjective optimization," IEEE Transactions on Evolutionary Computation, vol. 12, no. 4, pp. 439–457, 2008. View at Publisher · View at Google Scholar · View at Scopus
- K. Li, S. Kwong, R. Wang, K.-S. Tang, and K.-F. Man, "Learning paradigm based on jumping genes: a general framework for enhancing exploration in evolutionary multiobjective optimization," Information Sciences, vol. 226, pp. 1–22, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus


text:
While waiting for support, you can follow these instructions to try and figure out where the problem lies. Remember, the more information we have, the easier it is for us to help you, we are always happy to assist, so please reach out to us if you are experiencing an issue with your product.
Try to sync between each step. If at any point during this troubleshooting the device seems to operate properly, stop! Then tell me after which step it started working. Here goes:
Restart your app.
Delete your app.
Reboot your phone.
Install the app again from the iTunes / PlayStore.
Look for any available firmware updates in the app. If there is one, do the update, then restart the app.
Take out the batteries of the device and wait 30 minutes.
After 30 minutes, reinsert the batteries. Now, you will have to wait for 1 hour before you can sync to the device again.


text:
Industries: Professionals
- Private Companies
- Not-for-Profit & Charities
- Franchisors Services
- Healthcare
- Manufacturing
- Professional Service Firms
- Professionals
- Real Estate & Construction
- Sports, Entertainment & Media
- Finance & Insurance
- Food & Beverage
- Retail
- Retail Automobile Dealerships
- Technology
- Transportation
- Wholesale & Distribution
- Public Companies
Maximize Opportunities, Minimize Risk, Deliver your Services Profitably
For individual professionals, the key to success is a solid business structure. Even though you may be one individual, you are still a business and you need to operate according to business principles. This will allow you to handle challenges, as well as take advantage of tax and other opportunities.
If you are operating on the global stage, you must comply with a plethora of international regulations specific to your profession. Crowe Soberman has the experienced specialists and global network to help you navigate these complex issues.
Contact Crowe Soberman now, and make sure you are taking advantage of every business and tax planning opportunity available to you.
From the Professionals Practice
- Brace Yourselves: ITCs Disallowed for Orthodontists (Posts)
- Tax Talk for Health Professionals 2018 Issue (Tax Talk for Health Professionals)
- What the New "Income Splitting" Tax Rules Mean for You (Posts)
- Navigating the Road to Tax Planning (Infographic) (Posts)
- Ten Things We Learned From the Tax Announcements (Posts)
- Crowe Soberman Champions for Canadian Small Business (Posts)
- Ottawa says there's a 'need for action' on private corporations. Maybe there isn't. (Posts)
- Canada: When Do I Have To Pay HST? (Posts)
- Should I incorporate? (Video)
- Tax Talk for Health Professionals 2017 Issue (Tax Talk for Health Professionals)
Featured Contact(s)
Jerry Cukier BComm, FCPA, FCA Jerry Cukier Professional Corporation, Managing Partner, Audit & Advisory
Contact Info
Joel Podbere BComm, CPA, CA Joel Podbere Professional Corporation, Partner, Audit & Advisory
Contact Info
- Aaron Schechter
- Adam Scherer
- Alan Wainer
- Alexandra (Ali) Spinner
- Chandor Gauthier
- David Silber
- Deborah (Debby) Stern
- Eli Palachi
- Frédéric Pansieri
- Howard Zerker
- Jeffrey Steinberg
- Jerry Cukier
- Joel Podbere
- Jonathan Biderman
- Jordan Caplan
- Karen Slezak
- Linh Nguyen
- Mayeer Pearl
- Omosalewa (Shalewa) Iaboni
- Silvia Jacinto
- Talia Rubin + more - less
Related Pages
Our Clients Speak
"The person to person service and level of commitment from your senior leadership is very important to the future of our organization and very appreciated."Roy Roedger SDI Marketing
"Aaron Schechter reviews my books as if they were his own... he always shows respect and care for me as a person."Robert Positano Woodbine Auto Group
"The proof of the quality of Daniel's evidence is the result of the trial – the jury awarded my client compensation for the loss of income (a seven figure sum) that mirrored Daniel's reports and evidence almost to the letter."Adam K. Wagman Howie, Sacks & Henry LLP, Personal Injury Law
"It has been a pleasure working with Don Borts, Joel Podbere, Lauren Cole and Crowe Soberman's associated 'rising stars' over the years..."Donna Thompson Kuriyama Canada
"...I would have total confidence recommending Crowe Soberman to high-net-worth clients. They provide the expertise and service those clients would certainly value."Amy S. D'Aprix Ph.D., CPCA, President Essential Conversations, Inc.
Stay Connected
Receive valuable updates, tax tips and industry insights directly to your inbox!


text:
An election will be held this Saturday for the next board of New Mardi Gras with 12 nominees vying for 10 positions.
The nominees, including five members of the existing board -" Liz Dods, Jock McKeon, Nicholas Parker, Steph Sands and current co-chair Michael Woodhouse -" were announced at a NMG meeting held Monday night.
The remaining nominees are newcomers to NMG and community members heavily involved with this year's Mardi Gras: Scott Carn, Andrew Faith, Diane Minnis, Mark Orr, Wayne Percival, Amelia Powys and Tim Young.
More than 750 members who joined the organisation prior to 26 April are eligible to vote at the meeting and are encouraged to attend, NMG company secretary Stuart Newell told Sydney Star Observer.
One of the reasons why we wanted to have an election as soon as possible was we wanted to return the organisation to community hands, so that the members had an opportunity to vote for the directors, because currently the directors have been appointed by the four organisations [Pride, Gay And Lesbian Rights Lobby, ACON and Queer Screen], Newell told Sydney Star Observer.
A further 300 people have since applied to join the organisation, although according to the group's constitution these members cannot be processed until after the AGM. They will not be able to vote at the meeting.
Co-chair Michael Woodhouse told the Star he was thrilled at the new organisation's membership tally.
We've actually had a stronger response to membership than I expected. It was a great vote of support that so many people have actually wanted to join New Mardi Gras, Woodhouse said.
Members attending the meeting will be consulted on the issue of granting two-year terms for board members. Also on the agenda is the report from directors and consideration of the accounts and balance sheet. The appointment of an auditor will also be discussed.
Newell said accounts for the company had been prepared up until April 2003, with another meeting to be held later in the year to present updated audited reports to members.
Woodhouse told the Star NMG have only one more payment left to administrators.
We've got one more payment after Mardi Gras 2004, which is $70,000 plus the levy on tickets, Woodhouse said. But the way we've restructured the deed we've shared some of the risks, so if it's a really small party then we don't have to pay as much. That was how we tried to keep the price down and affordable.
But we have now made the payment that we needed to after Mardi Gras 2003, he said.
The meeting will be held this Saturday 10 May at 2pm at the Newtown Community Centre, on the corner of Bedford, Australia and King Streets. Proxy forms for members need to be registered prior to the meeting by forwarding forms to NMG at 26 Hutchinson Street, Surry Hills, or by fax on 9557 8259, by Friday 9 May. Copies of the proxy form need to be taken to the meeting.
For information visit the NMG website at www.mardigras.org.au.
© Star Observer 2019 | For the latest in lesbian, gay, bisexual, transgender and intersex (LGBTI) news in Australia, be sure to visit starobserver.com.au daily. You can also read our latest magazines or Join us on our Facebook page and Twitter feed.


text:
Author: Gwendolyn
Welcome, friend! I am an American writer, based in Utah. SIT.SIP.n.BE is a blog I created to share my passion for slow, simple living, and the importance of camaraderie. Since 2005 I have dug deep and unearthed rich things about life, self, God and others as I've lived with autoimmune disease. In spite of occasional darkest days, there are compensatory the-light-is-so-bright-I-have-to-squint moments that are utterly joy-FULL ... bursting with fulfillment and gratitude . Life can be fulfilling even with what some call limitations. Loving conversations, healing conversations, and learning conversations ARE possible with self and God.


text:
|Final Results
All tournament team
Tyus Jones - Duke MOP
Frank Kaminsky - Wisconsin
Grayson Allen - Duke
Sam Dekker - Wisconsin
Justise Winslow - Duke
The Commissioner's Cup was officially passed from defending champion SID member Bill Starkweather to members of Team Noffke (from left to right, SID Bill Starkweather, Team Noffke members Mark Noffke & Bruce Martin. Missing is SID Don Owens, SID Drew Logan, SID John Logan and Team Noffke member Steve Noffke.
Wrapping up the tournament:
Obviously the Wisconsin / Kentucky game in the Final 4 was awesome. I think Wisconsin was perhaps a bit tired and not ready for the aggressive defense Duke threw at them in the championship game. Wisconsin up 9 in the 2nd half, appeared to be destined to win this year. A couple of missed calls and all of a sudden the lead was diminished. Two freshman from Duke, Tyus Jones and Grayson Allen provided the spark to offset Winslow and Okafor on the bench with foul trouble. Duke freshmen scored 60 of the 68 points in the game for the night.
The 2015 All tournament team was comprised of Wisconsin's Frank Kaminsky and Sam Dekker and from Duke. Grayson Allen, Justise Winslow and Tyus Jones named MOP for the tournament
Every year we talk about how great the tournament was after conclusion and again, 2015 didn't fall too far from being another great year. Some referee decisions may have caught some of the teams participating, to move on, like the goal tending call on SMU when it appeared that there was no way the shot from UCLA's Bryce Alford had a remote chance of going in.
Some random things coming out of this tournament.........
All of the scoring has been rechecked and I found NO corrections necessaary.
Final results:
This site was last updated 02/03/19


text:
Tag: Seven Stills
Anchor's Away
2nd September
We had a blast serving up Bender's this past weekend at the Seven Stills and The Bold Italic's first ever I'm On A Boat event benefitting the San Francisco ASPCA. It couldn't have been a more beautiful day for a philanthropic booze cruise and it was great meeting other Bay Area vendors who care about craft food and beverage as much as we do! We hope everyone had a great time and thanks again to Seven Stills, The Bold Italic and those who came out to support the cause!
I'm On a Boat!
21st August
Seven Stills and The Bold Italic are teaming up to host the benefit of the summer: I'm On a Boat, San Francisco! We're thrilled to announce that Bender's Rye was selected as a local artisinal distillery to be on deck at this yacht party supporting the San Francisco SPCA. Join us on August 23 from 3:15 p.m. to 6:15 p.m. aboard the luxurious Red and White Zalophus for an evening of locally crafted drink and appetizer specials, all while enjoying a beautiful summer afternoon on The Bay.
Presale tickets will be available in mid-July through www.thebolditalic.com.
For more information, visit www.imonaboatsf.com.


text:
Browser does not support script.
Sign up for alerts
A-Z of services
Limits are in place for the following waste streams with no charge for disposal.
Charges apply to some non-household waste.
Asbestos - Cement Bonded (Restricted to two hours a day between 1pm - 3pm. Please ensure asbestos is double wrapped in heavy duty clear polythene and sealed securely with tape before arriving at the Household Waste Recycling Centre)
For restricted waste, residents are required to complete a 'disclaimer form' to declare that the waste is from their household, has not arisen as a result of commercial use and to acknowledge that a limit applies to the quantities of waste they are entitled to deposit at the HWRC.
There are no results that match your search criteria


text:
How cute is that? :) Here's some more info on it:
These mobiles are made from recycled magazines and are completely hand made. The strands vary from 4 to 10 butterflies and come in a variety of colors. Each butterfly is unique! Strands can be hung as individual accents or in a group for maximum effect. You will receive five strands of varied lengths.
Now for the interview:
1. First things first, tell us a little more about yourself...
Alexandria, VA
No kids unless you count a 4.5# rat terrier :-)
2. What is your regular job?
I work in finance for a nonprofit and am studying to become an antique appraiser.(past careers/jobs include editing, owning a small antique store, and a sheep milk soap business)
3. Do you Haiku?
Lustrously Soft Fashion
Colors dyed, vibrantly rich
Woven warmth discovered
4. What inspires you?
I tend to draw most of my inspiration from the little things that people rarely notice - the squirrel hunting for nuts, the old couple in the coffee shop or the occasional scrapbook I find at an estate sale. I love learning about people through their music, the momentos they've kept throughout the years, or the little notes scribbled in book margins. And color! Sunsets, sunrises...each one is so different and brilliant!
5. What item in your shop is your favorite and why?
Besides my butterfly mobiles, my second favorite item in my store right now are these earrings. As I mention in the listing, these came from a really unique estate sale. I spent hours learning about this amazing couple and was really inspired by their strength and love for each other. These earrings are stunning and knowing a little bit of the story behind them really makes them sparkle!
Rules to Enter:
1. Head on over to Chrysalis---> http://TheEndoftheChrysalis.etsy.com
2. Pick your favorite item (not giveaway item)
3. Come back here and comment in the official entry form below the extra entries section on what you chose
4. Leave an extra comment in the official entry form for any extra entries (Please leave blog url if you have my button on your blog or wrote a post)
Note: If a second winner has to be chosen, that winner will be chosen based on the most creative, detailed comment!
Also Note: Add me to your safe list or else your winning notice could end up in your Junk Mail folder! babylyons (at) live (dot) com
Open to All
Comments that don't meet these requirements won't be entered
Extra Entries:
Gain an Extra Entry into ALL of my giveaways if you Vote for me HERE! Scroll through the list of names and find "Katie Lyons" (should be up top) and click vote! Please state in your entry that you did so!
1 Extra Entry into this contest and every other one if you link to The Giveaway with the button or widget in my Link to Me section (for as long as the button/widget is up)
1 Extra Entry if you blog about this contest with a visible link back to this post
1 Extra Entry if you "Digg" this giveaway and all of my current giveaways (leave Digg username in comment)
1 Extra Entry if you "Stumble" this giveaway and all of my current giveaways (leave Stumble username in comment)
2 Extra Entries if you purchase something from this store during the contest
Comment to let me know you deserve an extra entry!
Official Entry Form:
This contest will end on November 25th, 2008 at 11:59 pm PST
A winner will be chosen from a Random Number Generator from random.org
The winner will be listed November 26th
If I cannot get a hold of the winner 3 days, a new winner will be chosen
Thank you Tenille for your generous giveaway! Your shop is way cute! :)


text:
Jacket: Orsay, similar here | Cami: Ann Taylor
Skirt:Prabal Gurung for Target, similar here
Bracelet: Craft market find, similar on Etsy here
One of the great things about living in Shoreditch is that I can always find a cool background for my blog pictures! This giant leaf design is just one small part of a long mural around the corner from my apartment. I love how the different shades of green really made the red in my outfit pop! Sometimes it can be risky to wear red clothing with red shoes, because the reds can clash. But in this case, I thought the difference in texture between the red patent and the red fabric set each piece apart. Plus, the print of the skirt catches the eye and keeps the two reds separate. For jewelry, I settled on pearls, but in a fun, artistic way to complement the less formal print and style of the skirt. For a bag, I've gone with my beloved and trusty Longchamp tote - there is absolutely no better bag to carry things to work. The nylon lasts a really long time, you can stuff a HUGE amount into it, and the brown flaps with the black bag means you can carry it with either color. It's been one of my go-to bags for a long time, and has taken me through college, law school and into the real world!


text:
The filter systems range from HFT is one of the most comprehensive! Find off line, oil transfer, transformer care and vacuum dehydration units for your needs.
The HFT range holds 84 leading electronic products from market-leading filtration technology specialists Hydac, Bühler and Stauff
Mobile filtration from Hytec consists of air, lube, fuel & coolant filtration products from Baldwin & Fleetguard®, helping engines last longer with less downtime.
HFT stocks a comprehensive range for small, medium and heavy-duty filtration requirements. Stainless steel, in line, gas, back flushing and accessories available!
HFT's range of hydraulic and lube filtration technology includes leading brands, quality tested products and expert specification advice.
Our conditioning monitoring equipment includes data recording devices and contamination detectors to keep you informed on status and health of your hydraulic system.
Within our range of filtration solutions, the Bosch Rexroth South Africa Group of Companies has engineered a number of filtration technology products to suit its customers' specific requirements.
Only superior quality brands are stocked and distributed by HFT. This is to ensure its filtration technology can help customers to maximise their uptime as well as reduce the cost of equipment ownership.
Our offering comprises mobile, hydraulic and lube filtration solutions, filter systems, process filtration and filtration accessories, as well as condition monitoring and electronics using only top brands from renowned OEMs. These brands include Baldwin, Bosch Rexroth, Buhler, Fleetguard, Hydac, Hy-Pro and Stauff, among others.
HFT is one of the largest suppliers of filtration technology, solutions and products in South Africa. The Johannesburg-based company, through Bosch Rexroth South Africa Group of Companies HYSA (for procurement) and Hytec Service Africa (for distribution), ensures that Bosch Rexroth South Africa customers receive their filtration technology solutions and products anywhere in sub-Saharan Africa.