text:
- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 790459, 11 pages
Towards Aid by Generate and Solve Methodology: Application in the Problem of Coverage and Connectivity in Wireless Sensor Networks
Graduate Program in Applied Informatics, University of Fortaleza-UNIFOR, Avenue Washington Soares 1321, 60811-905 Fortaleza, CE, Brazil
Received 23 July 2012; Accepted 10 September 2012
Academic Editor: Shan Lin
Copyright © 2012 Placido Rogerio Pinheiro 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 integrative collaboration of genetic algorithms and integer linear programming as specified by the Generate and Solve methodology tries to merge their strong points and has offered significant results when applied to wireless sensor networks domains. The Generate and Solve (GS) methodology is a hybrid approach that combines a metaheuristics component with an exact solver. GS has been recently introduced into the literature in order to solve the problem of dynamic coverage and connectivity in wireless sensor networks, showing promising results. The GS framework includes a metaheuristics engine (e.g., a genetic algorithm) that works as a generator of reduced instances of the original optimization problem, which are, in turn, formulated as mathematical programming problems and solved by an integer programming solver.
1. Introduction
High power consumption efficiency in wireless sensor networks is always desirable. The integrative collaboration of genetic algorithms and integer linear programming as specified by this methodology tries to merge their strong points and has offered significant results when applied to wireless sensor networks domains. However, its original implementation showed some deficiencies which limits its performance, being one of them the density explosion. Besides, it was conceived exclusively for this problem domain, the methodology could serve as a start point for using with other domains, since the genetic algorithm, implemented in this approach, is flexible and can be applied to many other problems. The correct use of a hybrid methodology to deal with a class of problem can show good results. The methodology mainly consists in reducing a problem, typically a high-complexity problem, that the time to solve it is infeasibly big, into subproblems. These subproblems maintain the original problem's basic characteristics and the time spent to find its solution is very small, allowing finding a feasible original problem's solution through the solution of many subproblems. So, the methodology consists in generating the subproblems, then solving them, and evaluating continuously, until a stop condition is satisfied. Genetic algorithm was chosen to be the subproblems generator. A genetic algorithm characteristic is the evolution, so it can evaluate and conduct the evolution of the subproblems to come closer to the original problem's optimal solution. A dynamic coverage and connectivity for wireless sensor network problem was adopted in this work [1–3]. In Section 2 is given an outline about wireless sensor network, with all the relevant features for this work. In Section 3 is shown the mathematical model implemented in this work. More details of the hybrid methodology are given in Section 4. Section 5 gives an improvement for the density explosion problem that could derail the whole approach. Section 6 presents the computational results obtained using the methodology described. Finally, in Section 7 is presented some conclusion obtained from this work.
2. The Wireless Sensor Network
A Wireless Sensor Network (WSN) typically consists of a large number of small, low-power, and limited-bandwidth computational devices, named sensor nodes. These nodes can frequently interact with each other, in a wireless manner, in order to relay the sensed data towards one or more processing machines (a.k.a. sinks) residing outside the network [4]. For such a purpose, special devices, called gateways, are also employed in order to interface the WSN with a wired, transport network. To avoid bottleneck and reliability problems, it is pertinent to make one or more of these gateways available in the same network setting, a strategy that can also reduce the length of the traffic routes across the network and consequently lower the overall current consumption. A typical sensor node is composed of four modules, namely, the processing module, the battery, the transceiver module, and the sensor module as described in [5]. Besides the packet building processing, a dynamic routing algorithm runs over the sensor nodes, in order to discover and configure in runtime, the "best" network topology in terms of transmission number and current waste. Due to the limited resources available to the microprocessor, most devices make use of a small operating system that supplies basic features to the application program. To supply the power necessary to the whole unit, there is a battery, whose lifetime duration depends on several aspects, among which its storage capacity and the levels of electrical current employed in the device. The transceiver module, conversely, is a device that transmits and receives data using radio-frequency propagation as media and typically involves two circuits, namely, the transmitter and the receiver. Due to the use of public-frequency bands, other devices in the neighborhood can cause interference during sensor communication [6]. Likewise, the operation/interaction among other sensor nodes of the same network can cause this sort of interference. So, the lower is the number of active sensors in the network, the more reliable tends to be the radio-frequency communication among these sensors. The last component, the sensor module, is responsible to gauge the phenomena of interest; the ability of concurrently collecting data pertaining to different phenomena is a property already available in some models of sensor nodes.
For each application scenario, the network designer has to consider the rate of variation for each sensed phenomenon in order to choose the best sampling rate of each sensor device. Such decision is very important to be pursued with precision as it surely has a great impact on the amount of data to be sensed and delivered, and, consequently, on the levels of current consumed prematurely by the sensor nodes [7]. This is the temporal aspect to be considered in the network design.
Another aspect to be considered is the spatial one. On the other hand, [8] define coverage as a measure of the ability to detect objects within a sensor field. The lower the variation of the physical variable being measured across the area, the shorter has to be the radius of coverage for each sensor while measuring the phenomenon. This will have an influence on the number of active sensors to be employed to cover all demand points related to the given phenomenon. The fact is the more sensors are active in a given moment, the bigger is the overall current consumed across the net. WSNs are usually deployed in hostile environments, with many restrictions of access. In such cases, the network would be very unreliable and unstable if the minimum number of sensor nodes was effectively used to cover the whole area of observation. If some sensor node fails to operate, its area of coverage would be out of monitoring, preventing the correlation of data coming from this area with others coming from other areas.
Another worst-case scenario occurs when we have sensor nodes as network bottlenecks, being responsible for routing all data coming from the sensor nodes in the neighborhood. In this case, a failure in such nodes could jeopardize the whole network deployment. To avoid these problems and make a robust design of the WSN, extra sensor nodes are usually employed in order to introduce some sort of redundancy. By this means, the routing topology needs to be dynamic and adaptive: when a sensor node that is routing data from other nodes fails, the routing algorithm discovers all its neighbor nodes and then the network reconfigures its own topology dynamically. One problem with this approach is that it entails unnecessary current consumption. This is because the coverage areas of the redundant sensor nodes overlap too much, giving birth to redundant data. And these redundant data bring about extra current consumption in retransmission nodes. The radio-frequency interference is also stronger, which can cause unnecessary retransmissions of data, increasing the levels of current expenditure. On the other hand, [9] present many integer linear programming models to minimize current consumption but do not consider the dynamic time scheduling.
3. Model
The solution proposed by [10, 11] is to create different schedules, each one associated with a given time interval, that activate only the minimum set of sensor nodes necessary to satisfy the coverage and connectivity constraints. The employment of different schedules prevents the premature starvation from some of the nodes, bringing about a more homogeneous level of consumption of battery across the whole network. This is because the alternation of active nodes among the schedules is often an outcome of the model, as it optimizes the current consumption of the whole network taking into account all time intervals and coverage and connectivity constraints.
In order to properly model the WSN setting, some previous remarks are necessary.(1)A demand point is a geographical point in the region of monitoring where one or more phenomena are sensed. The distribution of such points across the area of monitoring can be regular, like a grid, but can also be random in nature. The density of such points varies according to the spatial variation of the phenomenon under observation. At least one sensor must be active in a given moment to sense each demand point. Such constraint is implemented in the model.(2)Usually, the sensors are associated with coverage areas that cannot be estimated with accuracy. To simplify the modeling, we assume plain areas without obstacles. Moreover, we assume a circular coverage area with a radius determined by the spatial variation of the sensed phenomenon. Within this area, it is assumed that all demand points can be sensed. The radio-frequency propagation in real WSNs is also irregular in nature. In the same way, we can assume a circular communication area. The radius of this circle is the maximum distance at which two sensor nodes can interact.(3)A route is a path from one sensor node to a sink possibly passing through one or more other sensor nodes by retransmission. Gateways are regarded as special sensor nodes whose role is only to interface with the sinks. Each phenomenon sensed in a node has its data associated with a route leading to a given sink, which is independent of the routes followed by the data related to other phenomena sensed in the same sensor node.(4)The electric charge consumption is actually the electric current drawn by a circuit in a given time period.
These are the decision variables: : if sensor covers demand point in period ; : if sensor was activated in period for at least one phenomenon; : If arc belongs to the route from sensor to a sink in period ; : if sensor is activated in period ; : if demand point is not covered by any sensor in period ; : energy consumed by sensor considering all time periods.
The objective function (1) minimizes the total electrical charge consumption through all time periods. The second term penalizes the existence of some uncovered demand points, but the solution continues feasible. It penalizes unnecessary activation for the phenomenon too:
These are the constraints adopted: Constraint (2) enforces the activation of at least one sensor node to cover the demand point in period . Otherwise, the penalty variable is set to one. This last condition will occur only in those cases when no sensor node can cover the demand point The (which means that a sensor node is actively sensing in period ) is turned on, if it is associated sensor node is indeed allocated to cover any demand point. Constraint (3) indicates to the model that maintenance energy is being consumed, so the model could attribute the corresponding value for this consumption indicated in another constraint described later on According to the flow conservation principle applied to the connectivity issue, if there is an incoming route to a sensor node, there should be an outgoing route from this same sensor node. So, constraint (4) enforces this statement, setting an outgoing route from sensor node to sensor node if there is already an incoming route from sensor node to sensor node If there is an active sensor node, a route must be created. That is what constraint (5) above enforces Constraint (6) is necessary to create a route that reaches a sink if a sensor is active All data sensed must reach a sink node, but many sensors node have no direct connectivity to a sink node. So, other sensor nodes might be activated just to turn viably the route to the sink. In constraint (7), if there is an outgoing route passing through sensor node , then this sensor node has to be active
In the same way, with constraint (8) if there is an incoming route passing through sensor , then this sensor has to be active
The total electrical charge consumed by a sensor node is the sum of the parcels given constraint (9). The maintenance energy is attributed when the sensor is active for any reason. The activation energy is summed only when there was an effective activation through time intervals. The variable values are given in other restrictions. The reception and transmission energy are given when there are incoming and outgoing routes, respectively, passing from a sensor node. The sum of these terms has to be equal or less than the battery's energy
Constraint (10) enforces that each sensor node should consume at most the capacity limit of its battery If a sensor is active in the first time interval, it means that it consumed energy to activate. The variable indicates this activation. Then, the variable's value is set to 1. On the other hand, if the sensor is kept off in the first time interval, the value is set to 0. Constraint (11) ensures that In Constraint (12), the sensor's past and current activation states are compared. If the sensor node was active from period to period , then is set to 1, 0 otherwise.
4. The Base Hybrid Methodology
Although distinct, both the exact and metaheuristics approaches have pros and cons when dealing with hard combinatorial optimization problems. But their hybridization, when properly done, may allow the merging of their strong points in a complementary manner. For instance, it is well known that the direct application of exact methods is only possible for limited-sized instances. However, the size and complexity of the optimization problems faced nowadays has increased a lot, demanding for the development of new methods and solutions that can find acceptable results within a reasonable amount of time.
In [12–14], WSN problems were explored regarding the heterogeneity of the phenomena. This model however suffers a shortage of variables due to the increase of complexity as many matrices had gained one more dimension.
In this regard, it has become ever more evident that a skilled combination of concepts stemming from different metaheuristics can be a very promising strategy that one should resort to when having to deal with complicated optimization tasks. The hybridization of metaheuristics with other operations research techniques has been shown great appeal as well, as they typically represent complementary perspectives over the problem solving process as a whole. In general, the label of "hybrid metaheuristics" has referred to combinations of components coming from different metaheuristics and from more conventional exact methods into a unique optimization framework by [15–17].
In this context, a hybrid methodology has been recently introduced in the literature by [14, 18–23], trying to push forward the boundaries that limit the application of an exact method through the decomposition of the original problem into two conceptual levels. According to the framework underlying this approximate methodology (see Figure 1), the exact method (encapsulated in the solver of reduced instances (SRIs) component) works no more with the original problem, but with reduced instances (i.e., subproblems) of it that still preserve its conceptual structure. By this means, an optimal solution to a given subproblem will also be a feasible solution to the original problem. On the other hand, the metaheuristics component of the framework works on a complementary optimization problem, that is, the design of reduced instances of the original problem formulated as mathematical programming (namely, integer linear programming (ILP) models). It is referred to as the generator of reduced instances (GRIs), whose goal is to determine the subset of points of the reducible structure that could derive the best subproblem instance, that is, the subproblem which, when submitted to the SRI, would bring about the feasible solution with the highest possible objective function value. In this scenario, the objective function values of the solutions that could be realized by the solver are used as figure of merit (fitness) of their associated subproblems, thus guiding the metaheuristics search process. The interaction between GRI and SRI is iterative and repeats until a given stopping condition is satisfied.
So far, the metaheuristics chosen to implement the generator of reduced instances has been a genetic algorithm (GA) as explained by [24]. This option is due mainly to the good levels of flexibility and adaptability exhibited by the class of evolutionary algorithms when dealing with a wide range of optimization problems as presented by [25]. The genetic representation of the individuals (chromosomes) follows a binary encoding that indicates which decision variables belonging to the reducible structure will be kept in the new subproblem to be generated. That is, those genes having "1" as alleles define the subset of variables that generates the reduced instance. Conversely, the exact method is assumed to be any state-of-the-art algorithm used to solve mixed integer-linear problems, such as Branch-and-bound or Branch-and-cut described in [26]. Usually, the solver libraries available incorporate sets of strategies, heuristics, and problem reduction techniques that complement the main exact method and enhance its performance.
According to the classification proposed in [27], the methodology falls into the category of integrative combinations. The quality of the solutions to the instances generated by the metaheuristic is determined when the subproblems are solved by the exact method, and the best solution obtained throughout the whole metaheuristic process is deemed to be the final solution to the original problem.
Although showing remarkable levels of performance for some case problems studied in the realm of cutting and packing problems in [14, 18–21], the original version of the aforementioned hybrid methodology has drawbacks, some of which are circumvented with the adoption of the mechanisms discussed here. Other impacting factor that must be noticed is that the original version addressed only the cutting and packing problem class. One consequence of this particularity is that it requires some changes in order to be adapted to new optimization problem classes, described as follows in Section 5.
5. Improvements for the Dynamic Coverage and Connectivity in Wireless Sensor Network Problem
Adopting the base hybrid methodology to be suitable for a totally different class of problem is a challenge. Even the direction of optimization is opposite and requires changing since genetic algorithms natively maximize, while this problem is a minimization one. Although this issue is easy to solve, it shows how distinct problem classes can be even right in the beginning. A drawback that has limited the effectiveness of the base hybrid methodology as presented in Section 3 relates to its propensity for bringing about an uncontrolled density explosion over the individuals (i.e., reduced instances of the original problem) produced by the GRI. We define "density of an individual" as the ratio between the number of genes having "1" as alleles (referred to as activated) and its total length. The fact is that an increase in density tends to generate subproblems more closer to the original problem, thus possibly yielding better solutions. This situation can be better pictured as if having some sort of an "attractor" pushing the overall population density up as the GRI (GA) evolves. Although expected, this phenomenon may have an undesirable side effect if it occurs prematurely. This is because, usually, high densities imply higher complexity to be dealt with by the SRI, which indirectly affects the search process conducted by the GRI as the time spent in each generation tends to become progressively higher. This may cause a drastic limitation to the number of search iterations performed by the SRI, hindering both the effectiveness and efficiency of the whole optimization.
Other undesirable characteristic of the original version of this methodology is that its binary chromosome encoding can be prohibitively long, depending on the chosen reducible matrix. Long chromosomes can lead to problems.
5.1. Spread Sensor Heuristic in Population Initialization
The first initial population generation strategy is a randomized one. Due to the evolutionary nature of genetic algorithm (GA), the start point should not necessarily be a good one. And this was the case.
However, there is a trend that sensor nodes that are selected to participate in a subproblem are too close to each other by comparing their coverage radii. Overlapping of coverage is desirable until a certain point because it provides diversity of choices and network reliability. But keeping sensor nodes too close can lead to a concentration of coverage in the most central part of the observation area and possibly leaving some peripheral areas uncovered. The configuration that maximizes the coverage area ratio (covered area divided by total area) with a minimum number of sensors is that where the distances between two neighbor sensor nodes are equal to two times the coverage radius (Figure 2).
The key parameter to provide good balance between reliability and the number of sensor nodes is the density. This density can be determined by the network designer based upon the requirements of the specific application. But due to irregular activation and deactivation of sensor nodes, this density tends to be not so homogeneous along the observation area. As a side effect, this model tries to distribute this density more homogeneously because this is the configuration where the uncovered points penalize less and the number of active sensors spending energy is reduced, minimizing the objective function.
The idea of the spread sensors heuristic is to provide a good starting point to the GA in order to reduce the time spent in the initial phase of the evolution process. It is based on the selection of sensor nodes spread along the observation area which are encoded in the chromosomes of the initial population. This heuristic criterion of sensor node selection causes the density to be more regular.
There is a risk of decreasing the genetic diversity and even of causing some genetic drift when a deterministic algorithm is used to create individuals within an initial population.
To avoid this possible drawback, some sort of stochastic behavior was maintained. The algorithm is described as follows.
The population is divided into two classes of individuals: the random and the heuristic.
A parameter controls the probability of each individual being generated by the heuristic approach. The others are created by the standard random procedure. The heuristic starts picking a random sensor node for the first gene.
Each other sensor node is selected as having the largest of the smallest distance from other previously selected sensor nodes. This procedure is repeated for each group of genes that represents the set of sensor nodes of each time interval.
5.2. Compact Chromosome Encoding
According to [24], the right representation of the individuals is one of the most difficult parts of designing a good evolutionary algorithm.
The binary chromosome encoding was used in the original version of the hybrid methodology. Each gene represents the inclusion of the equivalent element of the reducible structure that will be considered in the generation of the new subproblem. It is well suited for the cutting and packing problem class for which the methodology was designed. This type of chromosome encoding however is not appropriate for other problem domains like the one treated in this work. It would generate too large chromosomes (i.e., 10 times intervals × 36 sensors). Table 1 shows a possible chromosome with the binary encoding. Each color represents a set of 16 genes associated to its respective sensors of the each time interval.
The proposed new encoding (Table 2) [18] represents the integer indexes of the sensors that must be taken in the subproblem generation. So there is no need of representing all sensors. Only a small amount of sensors has to be considered and the length of this chromosome can be down to 17% of the binary encoding one. In the original version of the hybrid methodology, the density rise was a problem as described in Section 4. The first resource created to avoid this undesirable effect was the density control operator that effectively accomplished its goal and is expected to be published soon. Here, the issue is solved with a much more controlled expedient: constant density.
This new compact chromosome encoding has a side effect of turning the density constant, since the ratio of sensors considered in the subproblem and the total number of sensors is always fixed. Now the solver can work in its best range of operation, balancing efficiency and effectiveness.
6. Computational Results
The dynamic coverage and connectivity in wireless sensor networks problem is a very different problem class than the cutting and packing class used in the original version. This means a good opportunity to motivate changes in the Generate and Solve methodology towards flexibility. Moreover, the publication of some papers related to this subject [28] brought a good understanding about how to give new contributions to this area and present better solutions.
Experiments were made for the dynamic coverage and connectivity in wireless sensor networks problem using the mentioned hybrid methodology.
It follows most premises of Section 2. The grid sensor placement was used for simplicity sake because the random scenario did not present significant variation of the problem complexity which is the main concern of these experiments. The machine used on this test was an Intel Core 2 Quad 64 bits with 8 GB of RAM machine with openSUSE Linux 11.0 64 bits. As integer linear programming (ILP) solver, the IlogCplex 10.1 dynamic library [29] was used attached to the Java program implementation of the methodology. The pure integer linear Programming approach is a particular case of the methodology and is obtained by a proper parameter set in a XML script.
Table 3 presents the comparison of hybrid methodology (HM) and integer linear programming (ILP) approaches. In these experiments, the demand points are disposed in a grid. Due to the stochastically nature of the HM, it is presented the average and standard deviation of results found in a batch of 10 problem instances. The notation used here is the average value followed by the ± sign and the standard deviation value.
In [30, 31], are conceived their computational experiments to produce WSNs with the minimum energy consumption as possible, while maintaining the coverage and connectivity constraints. The gain obtained in their paper is calculated by the comparison of the minimum set of sensors that have to be active and the waste of energy caused by the activation of all sensors with high coverage overlapping in a high-density configuration [1].
This idea seems coherent at first glance since energy waste reduction is often desirable. However, this point of view distorts the actual need of an WSN that stands in a place where it is infeasible to change the batteries: extend its lifetime as far as possible.
The objective function is composed of two parts. The summation of electrical charge consumption in all sensor nodes and the penalties. The penalties are an artifact that allow uncovered demand points giving flexibility to the model, but at the same time avoid the unnecessary use of this resource. Thus, the real objective is calculated by subtracting the artificial coverage penalties of the objective function or just calculating the first part (summation) of the objective expression.
Table 4 shows the results of similar experiments. However, this time the demand points are spread randomly through the sensed area.
The real purpose of this model is to extend the WSN lifetime as far as possible, preserving the WSN cost. So, lower electrical charge consumption is not necessarily an important issue if it does not reflect in more time slots. The number of time slots multiplied by the duration of each time slot represents this WSN lifetime.
Given this explanation it is reasonable to say that both solutions found by hybrid methodology (HM) and integer linear programming are equivalent in effectiveness. However, the HM approach can handle an amount of sensors 325% times larger, extending the working range of this application.
The only drawback here is the uncovered demand point rate, which is worse than ILP value. Despite this small imperfection of 2.35%, many real applications tolerate some lack of coverage by the nature of the observed phenomenon and other aspects. However, these uncovered demand points are often situated at the periphery of the observed area. The coverage radius does not reflect necessarily a sharp threshold of sensing.
Figure 3 shows the evolution of the best individual fitness in plain line and population fitness average in line with points as well.
Figures 4, 5, 6, 7, 8, 9, 10, 11, 12, and 13 are graphical representations of 10 time slots of a solution example. It shows the active sensor nodes, their coverage radii, the covered and uncovered demand points, and the routes from sensor nodes to the sink in the center.
7. Conclusion and Future Works
This hybrid methodology is not only suitable for solving complex instances in the domain of cutting and packing problems, but also can be adapted to tackle other problem classes like WSN as shown here. The key point in this adaptation is finding the best or at least a good reducible structure. This analysis is very linked to the chromosome encoding choice as it represents a tradeoff between subproblem complexity range width and chromosome size. A good reducible structure allows a wide range of subproblem complexity from very light and fast subproblems to the actual real problem. On the other hand, the reducible matrix size affects the chromosome size and a large chromosome size reduces the GA effectiveness.
In this problem, a good reducible structure was found, but it is much larger than the ones found in the cutting and packing problem instance. That is the reason why a new chromosome encoding was developed. This new encoding makes the matrix choice viable. The use of integer linear programming approach is limited to a certain level of complexity that sometimes is not enough for a real size network (Table 3).
The results found are far better than reference literature and leave opportunities of future enhancements as new supplementary algorithms and heuristics aggregated to this methodology. In [32] is implemented a hybrid methodology using genetic algorithm to deal with dynamic coverage and connectivity heterogeneous wireless sensor network. The difference between the homogeneous, addressed in this paper, and the heterogeneous, is the last one that has the capacity to deal with different phenomena independently, giving different sample data and sensed range for each phenomenon. This implies in a different way to treat the network's transmission data. Although it does not implement any density explosion control, good solutions are found in feasible execution time for wireless sensor network that could not be possible if only ILP was applied.
Another promising line of investigation involves the design and implementation of parallel/distributed versions of the framework, by means of which several GRIs (generator of reduced instances) and SRIs (solver of reduced instances) instances could run concurrently, each one configured to explore different aspects of the optimization problem at hand. The use of insular GA can bring more diversity and possibilities, resulting in effectiveness enhancement. Also, other metaheuristics such as particle swarm could be experimented replacing or working cooperatively with GA.
|Set of sensors
|Set of demand points
|Set of sinks
|Set of scheduling periods
|Set of arcs , that link sensors to demand points
|Set of arcs that interconnect sensors
|Accumulated battery charge for sensor
|Electrical charge dissipated while activating sensor
|Electrical charge dissipated while sensor is activated (effectively sensing)
|Energy dissipated when transmitting data from sensor to sensor. Such valuescan be different for each arc if a sensor can have its transmitter power adjusted based on the distance to the destination sensor
|Energy expended in the reception of data for sensor
|Penalty applied when a demand point in any time interval is not covered by any sensor
|If sensor covers demand point in period
|If arc belongs to the route from sensor to a sink in period
|If sensor was activated in period for at least one phenomenon
|If sensor is activated in period
|If demand point is not covered by any sensor in period
|Electrical charge consumed by sensor considering all time periods.
The first and second authors are thankful to National Counsel of Technological and Scientific Development (CNPq) via Grants no. 305844/2011-3 and no. 312934/2009-2, the third author is thankful to Coordination for the Improvement of Higher Education Personnel (CAPES), and the fourth author is thankful to Foundation for Support of Scientific and Technological Development Ceara State (FUNCAP) for the support received for this project. The authors also acknowledge IBM for making the IBM ILOG CPLEX Optimization Studio available to the academic community.
- A. B. de Aguiar, A. de Meneses Sobreira Neto, R. P. P. Cunha, P. R. Pinheiro, and A. L. V. Coelho, "A hybrid methodology for coverage and connectivity in wireless sensor network dynamic planning," in Proceedings of the 41st Simpósio Brasileiro de Pesquisa Operacional, Bento Gonçalves, Brazil, 2010.
- X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated coverage and connectivity configuration in wireless sensor networks," in Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), pp. 28–39, November 2003. View at Scopus
- P. R. Pinheiro, A. L. V. Coelho, A. B. Aguiar, and A. M. S. Neto, "Applying the generate and solve methodology in the problem of dynamic coverage and connectivity in wireless sensor networks," in Proceedings of the Information Science and Industrial Applications (ISI) (SERSC '12), pp. 252–257, Cebu, Philippines, 2012.
- H. Zhou, T. Liang, C. Xu, and J. Xie, "Multiobjective coverage control strategy for energy-efficient wireless sensor networks," International Journal of Distributed Sensor Networks, vol. 2012, Article ID 720734, 10 pages, 2012. View at Publisher · View at Google Scholar
- F. P. Quintão, F. G. Nakamura, and G. R. Mateus, "Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design," in Proceedings of the IEEE Congress on Evolutionary Computation (IEEE CEC '05), vol. 2, pp. 1589–1596, September 2005. View at Scopus
- H. Ishebabi, P. Mahr, C. Bobda, M. Gebser, and T. Schaub, "Answer set versus integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs," International Journal of Reconfigurable Computing, vol. 2009, Article ID 863630, 11 pages, 2009. View at Publisher · View at Google Scholar
- K. Nguyen, T. Nguyen, and S. C. Cheung, "On reducing communication energy using cross-sensor coding technique," International Journal of Distributed Sensor Networks, vol. 2011, Article ID 837128, 12 pages, 2011. View at Publisher · View at Google Scholar · View at Scopus
- S. Megerian, F. Koushanfar, G. Qu, G. Veltri, and M. Potkonjak, "Exposure in wireless sensor networks: theory and practical solutions," Wireless Networks, vol. 8, no. 5, pp. 443–454, 2002. View at Publisher · View at Google Scholar · View at Scopus
- S. Megerian and M. Potkonjak, "Lower power 0/1 coverage and scheduling techniques in sensor networks," Tech. Rep. 030001, University of California, Los Angeles, Calif, USA, 2003. View at Google Scholar
- F. V. C. Martins, F. G. Nakamura, F. P. Quintão, and G. R. Mateus, "Model and algorithms for the density, coverage and connectivity control problem in flat WSNs," in Proceedings of the International Network Optimization Conference, 2007.
- F. G. Nakamura and G. R. Mateus, "Planejamento dinâmico para controle de cobertura e conectividade em redes de sensores sem fio," in Proceedings of the Workshop de Comunicação sem Fio e Computação Móvel, vol. 1, pp. 182–191, 2004.
- A. B. de Aguiar, P. R. Pinheiro, and A. L. V. Coelho, "Optimizing energy consumption in heterogeneous wireless sensor networks: a novel integer programming model," in Proceedings of the 4th International Conference on Operational Research for Development (ICORD '07), pp. 496–505, 2007.
- A. B. de Aguiar, P. R. Pinheiro, A. L. V. Coelho, A. S. Neto, and R. P. P. Cunha, "Scalability analysis of a novel integer programming model to deal with energy consumption in heterogeneous wireless sensor networks," Communications in Computer and Information Science, vol. 14, pp. 11–20, 2008. View at Google Scholar
- A. B. Aguiar, Tackling the problem of dynamic coverage and connectivity in wireless sensor networks with an extended version of the generate and solve methodology generate and solve methodology [M.S. dissertation], Graduate Program in Applied Informatics, University of Fortaleza, 2009.
- C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: overview and conceptual comparison," ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
- I. Dumitrescu and T. Stützle, "Combinations of local search and exact algorithms," Lecture Notes in Computer Science, vol. 2611, pp. 211–223, 2003. View at Google Scholar · View at Scopus
- E. G. Talbi, "A taxonomy of hybrid metaheuristics," Journal of Heuristics, vol. 8, no. 5, pp. 541–564, 2002. View at Publisher · View at Google Scholar · View at Scopus
- P. R. Pinheiro, A. L. V. Coelho, A. B. de Aguiar, and T. O. Bonates, "On the concept of density control and its application to a hybrid optimization framework: investigation into cutting problems," Computers and Industrial Engineering, vol. 61, pp. 463–472, 2011. View at Publisher · View at Google Scholar · View at Scopus
- N. V. Nepomuceno, P. R. Pinheiro, and A. L. V. Coelho, "Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms," in Proceedings of the EvoCOP, vol. 4446 of Lecture Notes in Computer Science, pp. 154–165, Springer, Valência, Spain, 2007.
- N. Nepomuceno, P. Pinheiro, and A. L. V. Coelho, "A hybrid optimization framework for cutting and packing problems: case study on constrained 2D non-guillotine cutting," Studies in Computational Intelligence, vol. 153, pp. 87–99, 2008. View at Publisher · View at Google Scholar · View at Scopus
- L. J. P. Araújo and P. R. Pinheiro, "Combining heuristics backtracking and genetic algorithm to solve the container loading problerm with weight distribution," Advances in Intelligent and Soft Computing, vol. 73, pp. 95–102, 2010. View at Google Scholar
- L. J. P. de Araujo and P. R. Pinheiro, "Applying backtracking heuristics for constrained two-dimensional guillotine cutting problems," Lecture Notes in Computer Science, vol. 7030, pp. 113–120, 2011. View at Google Scholar
- A. P. Bhondekar, R. Vig, M. L. Singla, C. Ghanshyam, and P. Kapur, "Genetic algorithm based node placement methodology for wireless sensor networks," in Proceedings of the International MultiConference of Engineers and Computer Scientists (IMECS '09), vol. 1, pp. 18–20, Hong Kong, 2009.
- A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing, Springer, 2003.
- T. Back, D. B. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation, IOP, Bristol, UK, 1997.
- L. A. Wolsey, Integer Programming, John Wiley & Sons, 1998.
- J. Puchinger and G. R. Raidl, "Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification," in Proceedings of the 1st International Work Conference on the Interplay between Natural and Artificial Computation (IWINAC '05), vol. 3562 of Lecture Notes in Computer Science, pp. 41–53, June 2005. View at Scopus
- A. B. de Aguiar, A. d. M. S. Neto, P. R. Pinheiro, and A. L. V. Coelho, "Applicability of a novel integer programming model for wireless sensor networks," International Journal of Computer Science and Information Security, vol. 20093, no. 1, pp. 7–13, 2009. View at Google Scholar
- ILOG. ILOG CPLEX 10.0 User's Manual. United States of America, January 2006.
- I. B. D. De Andrade, G. R. Mateus, and F. G. Nakamura, "A GRASP heuristic to density control: solving multi-period coverage and routing problems in wireless sensor networks," in Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC '09), pp. 493–499, Sousse, Tunisia, July 2009. View at Publisher · View at Google Scholar · View at Scopus
- F. P. Quintão, F. G. Nakamura, and G. R. Mateus, "A hybrid approach to solve the coverage and connectivity problem in wireless sensor networks," in Proceedings of the 4th European Workshop on Metaheuristics: Design and Evaluation of Advanced Hybrid Metaheuristics, Nottingham, UK, 2004.
- A. M. S. Neto, "Um modelo em otimização de energia aplicado às redes de sensores sem fio heterogêneas," Graduation Conclusion Work, Graduate in Computer Science, University of Fortaleza, 2010.


text:
Limp Bizkit
I think eat you alive is a bit rubbish.
chocolate starfish is one of my all time favourite albums, though.
I just bought the new bizkit CD n' i think it's great! Songs are powerful n' Fred Durst has really improved his skills as a song writer. Also the rest of the band, includin' the new guitarist Mike Smith are givin' their best in this CD. I recommend this album to everyone out there!
Results may vary is one good album! I fuckin' love it, what more can i say? Songs are great, music is great... This is the best effort limps have brought to us!
the new song Behind blue eyes is sooooo cool!!!!!!!!
fred looks so cute in the video...otherwise i'm not ther fan and i don't like their music but that song it's really good.
This new limpbizkit surprised me. I expected sumthin' like Chocolate Starfish, but i got this melodic piece of rock. I love it! Especially Build a bridge n' Red Light Green light wit Snoop Dogg are great!
Well I'd have to say personally that I hate this band. I dont hate it because its "cool" to hate it. I hate it because I genuinely believe they have very little musical talent.
First though, the name. Not creative, not smart, not edgy, just really stupid. Limp bizkit...thats with a "zk" not a "scui". See, z and k make you instantly cool yo.
One example of their shit musical talent is some of their covers. George michael was a typical 80's singer, and his song "Faith" was alright, nothing stellar, but definitely far above this LB cover, which turns his decent song into a total piece of sonic shit. they start off well enough, but then they get to the chorus and totally fuck it to death. Then the song is turned into a rap song, and a very shitty one at that.
Also, they cover behind blue eyes from the WHO. To be honest I think, their version is decent, and one of perhaps a couple LB songs Ill actually tolerate. Im sure its a hit now and people probably assume that LB came up with such a great song. Hell no they couldnt come up with a song like this if their life depended on it. And why did they drop the original chorus for this stupid "my first computer" spelling crap? L.I.M.P. discover. Not much to discover.
Another "tribute" to the WHO, is My generation. the title of the song and the hilarious attempt at stuttering as in the original. sorry, but no go.
Another gripe is the song "rollin". a sad attempt at trying to be "badass", "edgy" and "cool". It instead turns out to be a pointless mindless rap attempt that miserably fails. These guys try to be rappers, but sorry, Sublime did it a LOT better.
Before you accuse me of just stereotyping them becauseI hate them, know that there is difference between music that someone LIKES, and music that is actually good because of its structure, melody, lyrics, vocals, rhthm, and variation. examples of music that is truly good and shows talent is: Guns N Roses-November Rain, Smashing pumpkins-tonight tonight, ELO-telephone line, Lynyrd Skynyrd-free bird, Led Zeppelin- stairway to heaven, Supertramp-crime of the century, hell even Googoo dolls-black balloon, and Manic street preachers-a design for life. You might notl ike those styles of music but there is absolutely no argument that they are all very well written and played songs. Limp bizkit is pop. shallow, thoughtless pop. Linkin park also fits into this category.
Flame me all you want but Limp bizkit might sell records, but that says absolutely nothing of their lack of talent. Any band can make a catchy song, but only great bands make truly memorable timeless classics.
"pop=popular music. Music that appears on charts usually world wide"
Ofcourse LB is pop. But the thing that apparts them from typical pop-groups is rock flavor. I like limpbizkit and i believe they can write beautiful songs on their own. Like in "Results may vary", the last song, "Drown" is emotional and lyrically beautiful.
To that lil' thing, why their bands name is "Limp Bizkit" with "zk", is probably 'cause they were few years ago heavily rap influenced (these days they are more like rock).
One thing why i love bands like limpbizkit, is 'cause they seperate people two completely different camps; Haters and lovers. There's lot to talk about limpbizkit. Others praice them to heaven, others say their bullshit. I like 'em. ALways had always will. there's nothin' that can change my opinion, no matter how hard haters bash them.
Yo, i don't give a damn, what music these dudes play, they're still cool. Love the new album man, it got so many cool moments in it. Fav songs of mine are "Build A Bridge", "Creamer (Radio Is Dead)", "Head For The Barricade", "Eat You Alive", "Drown" and "Let Me Down".
Jaxx Bilfer
Limp Bizkit is the name of Fred's dog ain't it?
Covers are meant to sound different. There's absolutely no point covering a song to make it same exactly the same as the original.
Innotech -- you're not living in the now.
"Memorable timeless classics" is a democratic statement -- not truth; just as popular music on the charts is determined by numbers alone. Thus these things are subjective.
'Rollin'' and 'My Generation' can be a timeless classic to me if I it happens to be.
Flake 1.6
Fishguard is a better name for a dog than "Limp Bizkit". My cat is called Victoria Fishguard because she rocks my ass!
<3 Flake
Flake 1.6
Say what ya say, i think limpbizkit is tight. They make good music and that's it. "Results may vary" is a great album (though Significant Other is the best one). I heard limp's are droppin' a greatest hits-collection this year (and new album too). Can't wait for those two to come out!
Maggot brain
Dat shit is tight. Y'all bitches know what I'm talking about aight
Hey peeps.I dig Limp Bizkit to bits.I loved their album 'chocolate starfish and hotdog flavoured water'.I ate up pretty much all the tracks on the album.I esp. love Rolling,My way,and boiler.I also like the songs 'ntogether now' and my generation.I also feel their remake of 'Behind blue eyes'.I think they are tight!!!
Limp Bizkits new stuff sucks compaired to the old.
They disgust me.
Let the ''fuck you dude you dont know shit'' comments begin.
"fuck you dude you don't know shit"
Nah, just playing.
I like their new stuff. "Build a bridge" is beautifull. So is "Lonely world", "Drown" and "Down another day". Heard there going back to their roots. For real. No more that soft behindblueeyes-crap (as some of you call it). The anger and raw sounds are finally back for the next album. Or that's what Fred Durst said at www.limpbizkit.com. Also Wes is back, so he may say "this ain't harrrrrd enough, let's put some kick to it" and play something like he did in "Pollution" from "3 Dollar bill y'all".
Pretty cool.....since i bought my first ever album of Biz, finding it great music, i often hear critics saying this is one of the weakest albums of mr. Durst. Better start looking out for the others i suppose.........
The discussion board is currently closed.

subset: commoncrawl


text:
Viewed Links Not Changing Colors
Started Oct 14, 2013 | Discussions thread
Shop cameras & lenses ▾
Ahender • Senior Member • Posts: 1,554
Viewed Links Not Changing Colors
If I go to a DPR forum, click on a thread and read it, then click the back arrow, the thread/link that I viewed does not show as being viewed (change colors).
This happens in Chrome and IE10.
If I leave the site and come back in, the thread shows that I have read it.
If I am visiting other sites, Yahoo, Fred Miranda, etc., once I click on a link, then arrow back, it always shows that I have viewed the link.
Here's the really odd part.
If I view an unread forum link in Chrome, then open up the forum in IE10, it shows the link as being viewed, even though it was never viewed in IE10.
This is telling me that the viewed links are not controlled by the browser but by your scripts.
Is that true?
Reply to thread Reply with quote Complain
|Post ( )
|Posted by
|Oct 14, 2013
|Oct 14, 2013
|Oct 15, 2013
Keyboard shortcuts:
FForum PPrevious NNext WNext unread UUpvote SSubscribe RReply QQuote BBookmark MMy threads
Color scheme? Blue / Yellow


text:
Tech Falls in Top-15 Battle with K-State, 55-24
Oct. 27, 2012
Final Stats | Quotes | Notes | Photo Gallery | Texas Tech Photo Gallery
MANHATTAN, Kan. (AP) - Texas Tech fell 55-24 to the No. 4 Kansas State Wildcats on Saturday.
Colin Klein led the Wildcats as he completed 19 of 26 passes for 233 yards and two touchdowns, and had 83 yards and two more scores on the ground. John Hubert added 64 yards and two rushing TDs, and Angelo Pease also scored for Kansas State, which came into the game trailing only Alabama and Florida in the BCS standings.
Seth Doege threw for 331 yards and two touchdowns for the Red Raiders (6-2, 3-2)
Texas Tech jumped out of the gates quickly in the first half. Doege took advantage of soft coverage on the opening series of the game, completing six of his first eight passes. An encroachment penalty on third down kept the drive alive, and Doege finished it off with a 32-yard touchdown toss to Eric Ward.
The Wildcats, meanwhile, couldn't get anything going.
Klein was sacked to end their first series, and had a pass tipped on third down to end their second. By the end of the quarter, Kansas State had just 19 yards of offense.
The defense provided a jolt late in the quarter when Meshak Williams delivered a crushing blindside hit on Doege, popping the ball loose. Jarrel Childs went the other way for what appeared to be a 74-yard TD return, but an illegal block brought the ball back to the Texas Tech 14.
Kansas State had to settle for Anthony Cantele's 34-yard field goal.
Ryan Bustin matched it with a 37-yarder to cap the Red Raiders' next possession, but Kansas State started moving the ball. Hubert capped off its ensuing drive by winning a race to the pylon after getting stood up at the line of scrimmage to make it 10-all.
"When it came down to making plays to finish," Doege said, "we just didn't make them."
Near the end of the half, Kansas State's quick-strike offense set up a 19-yarder by Cantele for the halftime lead.
Ward had a big day for the Red Raiders as picked up 161 receiving yards and two touchdowns.
"We moved the ball, made a lot of yardage, but you can't turn it over," Texas Tech coach Tommy Tuberville said. "I think we gave up 17, 20 points on offense and our kicking game today."


text:
my Nutrition
my Fitness
Other Goals
my SparkPoints
Web Search
Articles & Videos Home
Health & Wellness
Health A-Z
Cold & Flu
GERD (Heartburn)
Healthy Heart
High Blood Pressure
High Cholesterol
Irritable Bowel Syndrome (IBS)
Pain Management
Seasonal Allergies
Weight Loss
Healthy Family
Pregnancy & Postpartum
Instant Inspiration
Lifestyle Centers
Beauty & Style
Brides To-Be
Family Wellness
Healthy Home
Pet Health
Senior Health
The SparkPeople Blog
Community Home
Message Boards
Challenge Central
Secrets of Success
Member Blogs
Friend Feed
Advertisement --
Learn more
about ads on this site.
Runner's High
Saturday, March 30, 2013
According to my training plan, I'm supposed to run 7 miles today. I tried running my 4 miles yesterday, but really only made it 1 mile before my foot started to complain. Honestly, I know that rest (ice, compression, etc.) is the only thing that's going to heal this – but I really can't rest my foot because I have to walk. And if I have to walk, I might as well run, right? Why let my training suffer?
Sometimes I wish I never got into running – I feel compelled to do it, even though I've had a number of physical issues because of it. It seems to be the only thing that keeps my weight within healthy range, though.
If you had asked Nicole circa 2003 if she would ever run a half-marathon, she would have laughed and made some sort of comment on your sanity level.
(After I earned my first half-marathon medal, my husband didn't want to feel left out. So he did his own marathon.)
Not that I wasn't active 10 years ago. I had recently graduated college, had moved out to southern California for a job, and was determined to shed the 30 pounds I gained eating cheeseburgers and ice cream practically every day for the last four years. Being in So Cali made activity fun and easy – with beautiful, warm weather almost every day, I took every opportunity I could to be outdoors, whether it was riding my bicycle to the grocery store, hiking in the San Bernardino mountains, or just taking walks to soak up some rays. I had two gym memberships – one to a standard fitness facility (which I could be found hanging out on an elliptical when it was raining outside – no treadmill for me at the time), and one to an indoor rock climbing gym (definitely an awesome way to get exercise).
Fast forward four years, when I took a job in Connecticut to be closer to friends and family. Everything about Connecticut encouraged me to just stay inside. My bike collected dust. There was no rock climbing gym. My daily routine (60 minutes on the elliptical) – and corresponding weight loss – stagnated. I knew I needed to change it up – so one day, I just bit the bullet and got on the treadmill.
I think that first experience on the treadmill probably lasted oh, five minutes, at a pace that could only be considered a "wog." (walk? jog? who can really tell?) It was HARD compared to the elliptical. But every day afterwards, I got on the treadmill and either pushed myself a little longer, or a little faster, or both. I added inclines. On the occasional nice day in Connecticut, I took my run outside. I would add new songs to my iPod shuffle and get way too excited during my run when they came into the mix.
What kept me going was all about variability. I could present new challenges to myself daily when running, and it kept things interesting.
When my husband and I moved to New Jersey in 2010, we were roped into signing up for a 5k by some of his co-workers who wanted to form a team. I had never considered racing before – especially in a race that was going to be in the middle of December, as I hate the cold (
) – but it was for a good cause (the entry fee was simply an unwrapped toy for charity for the holidays), and we wanted to support the team.
Oddly, nobody else from our team showed up for the actual race that day. But it didn't matter – we had a blast! Runners showed up in Santa suits and elf ears (we even ran with the full Nativity). DJ's blared holiday music at strategic points along the course. People I didn't know were cheering for me along the way. When I crossed that finish line and got my post-race bagel and banana, I knew I was hooked (I was much more excited about bagels back then).
So that's my story about how I got sucked into races. I've done that same charity 5k every year since. I've run two half-marathons, and have my third coming up in November – plus a score of other races before that. But I've also had to deal with runner's knee, IT band issues, and now foot pain. I just hope I can find the right formula (maybe being wheat free?) to keep these legs going.
Share This Post With Others
Report Inappropriate Blog
Member Comments About This Blog Post
Report Inappropriate Comment
My SparkPage
That's an awesome way to get into racing! Loved the blog!
1187 days ago
Report Inappropriate Comment
My SparkPage
Ever thought of doing a feasibility
study for your area to see if that rock climbing club would be welcome and start your own business or invite the owner in So Cal to come to where you are now? I bet that would be a fun work out, I might even try it. I prefer the dred mill to the shredding eleptical but in my cardiac work out gym we have a sitting eleptical I use, so much easier on the knees but I can still get a thigh burn.. the other just makes me light headed too fast and I tend to race myself on it. Good luck with the run - you really should have had your foot checked out to make sure you are not causing more damage that might not be reversable. Cheers
1188 days ago
Report Inappropriate Comment
My SparkPage
Geez! It's hard with how addictive running is - anything that keeps me from lacing up my sneakers and going kills me. But then, continuing to run is killing me too! Good luck with your rehab - keep me posted! Have you picked a run for the fall yet, or are you waiting to see how it goes?
1188 days ago
Report Inappropriate Comment
My SparkPage
I got sucked into my first 5k in April of 2011 ( at that time I weighed 175ish) and got addicted, then continued to do more. I only train on a treadmill because of the area I live in isn't walker/runner safe (got bit by a pit bull the summer before that). Then on a whim the next April I did my first half marathon and got addicted to that but during the next month I hurt my sciatic nerve in my back and didn't know it, so I continued to run/exercise and pain got worse. I did my second and third HM bc I didn't want to waste my money but I'm having to break from it now bc I finally found out what directly is causing pain (not pinched but very irritated sciatic nerve plus 2 slightly herniated bad discs), but I hope to start back in the fall! :) but I'm going to miss doing my first HM for the second time next month :(
1188 days ago
Add Your Comment to the Blog Post
Log in to post a comment
Disclaimer: Weight loss results will vary from person to person. No individual result should be seen as a typical result of following the SparkPeople program.
Advertisement --
Learn more
about ads on this site.
Get An Email Alert Each Time
BPXDOMINO Posts
See Today's Featured Member Blog Posts
More Blogs by BPXDOMINO
Use the Force
- 10/2/2015
The Great Cookie Experiment of 2013
- 12/1/2013
- 11/20/2013
I Am Disappoint
- 11/15/2013
View All ›
close ×


text:
Next week is "The Biggest Loser" season 15 finale but before we get to that, five contestants were whittled down to three finalists tonight. Who won the sprint triathlon? And who was sent home? Read on …
The contestants were introspective in the gym, wondering what their Week 1 selves would think of their current selves.
Quote of the week, from David: "Defeat was something that was part of my vocabulary. Where going home was an option. But look at me now -- look at how strong I am. There's something deep down in me and it was that heart of a warrior that I knew was in me. And I've been able to reveal that guy a little bit more each and every week. How do you like me now?"
Tanya update: She's down 100 pounds (as of her update on the "Today" show), looking fabulous, and her newest goal is to open a healthy restaurant, which is a big change from her chicken and waffles past.
The triathlon: The winner of the swim/bike/run funfest not only gets a spot in the finals, they also win a new car. Mother-son team Jackie and Dan Evans, who travel across the country for the Biggest Loser Run/Walk series, were there to cheer them on.
While Rachel, a former swimmer, feels confident, Bobby, a swimming newbie, is trying not to panic in the water. Rachel and David sped through the water and were neck and neck in the bike portion until Rachel pulled ahead and not only finished first in the swim but in the bike portion. Oh, and the running portion – Rachel won it all in 1 hour and 32 minutes.
Bobby finished last but he knew going in that he wasn't going to win it outright. "This finish line is really the starting gate for me," he said.
At the end of every season, the remaining contestants get to sit down with the trainers and watch their introductory video interviews and early weeks on the ranch to see just how far they've come in body and in spirit.
Marie update: She's also down 100 pounds, staying active, looking great and making huge strides toward finally getting pregnant and starting a family with her husband.
Weigh-in and elimination: There's a red line tonight, where two people will be going home, but they do have a great shot at the at-home prize. Rachel's already in so two others will join her. How'd they do?
- Rachel: 1 (But, hey, she's an athletic 150 pounds, so who's complaining?)
- Chelsea: 7
- Jennifer: 3
- Bobby: 17 (Wow! Yeah, he's a finalist.)
- David: 16
So it's Rachel, Bobby and David in the finale next week. Chelsea and Jennifer will be going home.
Next week: It's the finale, where we'll be able to see how Chelsea and Jennifer look now – as well as everyone else. And it's on at a different time – 9 p.m. ET/PT.


text:
Pesto-Turkey Layered Loaf RecipeRead Reviews Be the first to add a review
5 7 9
This yummy sandwich is easy and travels well. Make several to feed a crowd, and use any meat, veggies and cheese you like. —Marion Sundberg, Yorba Linda, California
- 1 loaf (1 pound) French bread
- 1 cup prepared pesto
- 1 pound thinly sliced deli turkey
- 1/2 pound provolone cheese, thinly sliced
- 2 small zucchini, thinly sliced
- 2 medium tomatoes, thinly sliced
- 1 medium red onion, thinly sliced
- Preheat oven to 350°. Cut the top fourth off loaf of bread. Carefully hollow out the bottom, leaving a 1/2-in. shell. (Discard removed bread or save for another use.) Spread pesto on the inside of top and bottom of bread. Set top aside.
- In bottom of bread, layer the turkey, cheese, zucchini, tomatoes and onion. Gently press the layers together. Replace bread top and wrap tightly in foil.
- Place on a baking sheet. Bake 25-30 minutes or until heated through. Let stand 10 minutes before cutting. Yield: 6 servings.
Originally published as Pesto-Turkey Layered Loaf in Simple & Delicious July/August 2009, p60
Reviews for Pesto-Turkey Layered Loaf
Please Log In or Join to add a rating and review.
Click stars to rate
Any changes to your rating or review will appear where you originally posted your review
Reviewed Oct. 3, 2015
"Very tasty!"
Reviewed Feb. 28, 2015
"Great recipe."
Reviewed Dec. 11, 2014
"Super yummy!"
Reviewed Aug. 15, 2010
"This is a now a family favorite! It is easy and the directions and times are right on target. Very good mix of flavors."
Reviewed Feb. 5, 2010
"This is a fabulous recipe! My husband loves it and asks for it often...especially during the summer. It travels well, is filling and so yummy! Enjoy! We sure do..."


text:
One of the greatest advantages to a virtual schooling program is that children are able to work at their own pace, without being forced to adhere to the pace of the classroom as a whole. Not ready to move on to the next lesson? Then don't! It's just that simple. Children who think in a linear manner, from start to finish, are able to complete an entire lesson without having to stop in the middle to move on to a new topic. Children who learn a little bit slower are able to finish the lesson then and there, instead of having to put it to the side to complete it as homework later. And children who are a little bit faster than the average can get their work done and move on to the next thing, instead of sitting and waiting patiently for the rest of the class to be done.
Unfortunately, this also has its downsides.
Being able to work at a pace that is comfortable for your child may create the illusion that they don't have to work as hard or as often. They feel that they can get away with wasting time, getting into things other than their schoolwork, playing internet games…after all, they can always do the work "later."
A good virtual schooling parent will insist that they take care of their work sooner, rather than later—completing lessons daily or at least weekly, before they end up behind and unable to catch up. Unfortunately, this isn't always easy to enforce.
Virtual schooling is supposed to be a shorter day. Sure, it says you're spending six and a half hours a day working on schoolwork; but for the most part, lessons are shorter than an hour, and it's possible to complete the work for the day far faster than that.
Except when your child procrastinates. Except when they disappear into their rooms to "work on schoolwork" and don't come out for four hours…and when they do, they haven't accomplished anything. Except when they've supposedly been working on a math lesson for an hour, but really they've been staring off into space and doodling in the margins of their notebooks.
Keeping a child on task, especially one who has a habit of daydreaming and messing around, can be a serious challenge.
First and foremost, you must pay attention. With these children, you don't have the luxury of assuming that they're working and checking in on them infrequently—and just because the computer screen is turned to a lesson doesn't necessarily mean that's what they're doing. They are masters of appearing to complete work while in reality, they're doing everything but. You have to keep a close eye on what these children are completing. If they have your password, you'll have to pay particular attention to what they say that they're doing—because it will be nothing for them to hurry in and take a look at the answer key, or even print the answer key straight instead of completing the work for themselves. Always, always pay attention. Don't be automatically trusting if your child hasn't earned it; always double check.
Don't let it go. It's easy, when you're virtual schooling an older child, to let things slide a little bit. You're busy? Oh, well, you can always check in on them later. Or you'll check that assignment in a minute. Or you just glance over it and figure that you'll pay more attention to the next one. Don't fall into this trap! Your child is well able to take advantage of this kind of behavior. They will learn to catch you when you're in the middle of something else so that you won't pay enough attention, and before you know it, they've fallen behind.
Make them accountable. If you're going to be a successful virtual schooling family, then school has to be a priority. It's easy to say that school falls between the hours of eight and three (or whatever schedule works best for your family) and that there are other activities that take place outside those hours. There's church, and sports, and family activities, and there has to be a place for those activities, too! Besides, your child can't spend all day doing schoolwork. That's just not fair to anyone.
Well…the problem is, your child knows that, and they will use it. Do you always walk out of the house at four on Monday for a sport or a club meeting? Then your child knows that's their deadline: they only have to procrastinate until that time to avoid doing the assignment for the time being.
Today's society is a busy one, with children doing more activities than ever before. It's easy to fill all of those non-school hours with other activities, regardless of whether or not your child has actually completed their schoolwork for the day. Staring off into space while there's a math screen up counts as a math lesson, right?
Well…really, it doesn't.
Teach your child that if the schoolwork doesn't get done, they don't get to participate in other activities—no matter what they are. Have a family get-together? They can bring along their books and computer and keep right on working. Need to take another child to practice? That's okay—your procrastinating child can complete their schoolwork while they're there. After they've missed a few things that they really want to do, your child may be much more likely to actually complete work during work hours.
Be consistent. Don't let it go one day and not the next. If you're going to have severe consequences for not completing work during school hours, then those consequences must always hold true, whether that means missing a birthday party or other much-anticipated event or skipping a family get-together to work on a math lesson. If they get away with it half the time, they will expect to get away with it all the time, and there won't be much you can do to keep them in line.
Keep an eye out for "helpful" behavior. This one is particularly risky if you have younger children at home. An older sibling may go to great lengths to be able to play with them instead of doing any actual work. Have a fun activity going on for the little ones? The older child will be right there, pulling out materials, "helping" the younger child, and so on. It seems helpful. They look busy. But it's really keeping them away from what they should be doing.
In some instances, this is okay. If you have a child who is normally able to complete their work on time, this doesn't apply—but for a procrastinator, it's very important to stay on top of time management. For a procrastinator, every missed study minute is one more that you're going to have to fight over later—so you might as well fight your battles up front. Put your foot down. Insist that the work get done first, before they participate in the fun stuff. It might not help change their attitude; but then again, it might.
Resist the urge to do other things during school time. It's easier to run errands during the hours when school is supposed to be happening. That's also a great time to get with friends with younger children, or participate in any number of fun activities.
Don't make this a regular part of your schedule. Sure, it's nice to have a break every once in a while; but if you allow your child to tag along on these excursions, suddenly, you've made that activity the reason why they didn't accomplish anything that day. Even if it only takes an hour out of the middle of the day, that hour is enough to set the entire day out of whack—and rarely in a positive way.
School time has to be about school time. If your child is adaptable and can work with you, great! If they're not, then you have to be the rigid disciplinarian—and that's part of what you signed on for as a learning coach.


text:
Frontrunning: October 7
- Printer-friendly version
- Oct 7, 2011 7:28 AM
- 13
'It's Too Hard to Know Who Is Too Big to Fail (Bloomberg)'
Right. It's too hard to know so let's stick with the Status Quo. Brilliant.
Read the article... Not what you expect.
The government could reduce the considerable ambiguity (outlined in the article) about what they would/would not let fail (and under what conditions if they instead addressed the "Too Big" part.)
Three years down the road and banks/shadow banks are bigger, more systemically critical and cancer-ridden than ever.
Obviously size isn't the only critical risk factor but the greater the size of any one institution the greater the systemic risk. Limiting size is the easiest and most technically elegant way to reduce systemic risk...and it looks like we're going to be beat over the head by events with this lesson yet again.
i punched it up and saw: "Last month U.S. banking regulators approved new rules that would treat all bank-holding companies with more than $50 billion of assets as systemically important financial institutions, based on average total assets for their previous four quarters.
since US banking regulators = the FED, this seems to be a way for the banksters to define the "system" of their corpo-fascist money machines and to protect (?) the "investors" (themselves?) from any losses due to zombie-like insolvency
Let Them Fail!!! the "capital" isn't real if it can only "survive" via continued Treasury ponzi. we need to re-define public v. private b/c the People are getting ass-raped by the fraudsters operating in the "grey areas" such as fannie & freddie, and now the FDIC has been turned over to the FED and its minions to protect such things as bond and common-stock values from stepping blythely into their own now-empty elevator shafts, b/c they pulled the wealth outa america and now hold it offshore, so we should protect their "investors"? riiiiiiight!
the thing about "insurance" is that one generally needs tp PAY FOR IT, but with the damned goobermint signing the "full faith & credit" of the citizenry over to their corpo-fascist "contributors", it's free to the fraudsters who can continue to pass profits to the buffetts and the macks and the uber-elites, while back-stopping their losses with OUR future and allowing these CRIMINAL CORPORATIONS to pay small "fines" (%-wise) and just keep rolling, playing the 99% inflation game and forming larger and larger corporate "combines" to avoid taxes and call the shots on the lives of those who serve in OUR military
now that we have a "blue-ribbon committee" to pass the death sentence and enforce it on american citizens via a clown in the W.H., i think we have all the "reasons" we need to put an end to this lawlessness, criminality, and psychopathy which results directly from the "free speech" accorded to non-human, non-citizen "fictions" and allows them to BUY and pay for the political systems, the very polity, of the USA.
and yes, that is very hypocritical of me and other americans. as long as the juggernaut was aligned w/ our needs and chewing up the lives of others, wtf, why not? but now that it is destrying america, and us, the monster has turned against its masters and we are truly in for the fight of our lives, b/c those who control and weild this power in our names will probably not lay it down peacefully, due to silver-tongued slewie talking them out of it!
"The odds that Congress would pass TARP II look slim, as long as Republicans control the House of Representatives."
If and when rubber meets road the rhetoric will be a memory and the formerly righteous will fall in line as their paymasters demand. Just like the "debt ceiling" debate...hot air for weeks followed by capitulation to the (financial) powers that be. Anyone who thinks they'd let someone with a checkbook suffer a fate as indignant as failure is a rube, if only because they know that the entire powder keg of derivatives can be triggered by any one of a thousand matches now.
China Currency Bill Passes US Senate Test
Dingy! Dingy! Dingy!
LOL! Futures really haven't moved much from to all the downgrades. Looks like the short squeeze is still in effect. Gotta goose these markets, OPEX is coming up. I'm pretty sure the banks sold a lot of puts to people. I'm glad that I'm still drunk from last night. Makes this even more hilarious.
"LONDON, Oct 6 (Reuters) - Britain's FTSE 100 share index extended gains on Thursday, boosted by news that the Bank of England monetary policy committee voted for a second round of 'quantitative easing' by buying 75 billion pounds ($116 billion) of assets to keep the sluggish economic recovery going."
"sluggish recovery". I have no idea what planet they're reporting from.
"I don't want a situation where we're just passing laws that are symbolic knowing that they're probably not going to be upheld by the World Trade Organisation, for example, and then suddenly US companies are subject to a whole bunch of sanctions."
I don't want to upset my campaign contributors just to make an attempt to level the playing field for the American worker.
The biggest problem with Chinese currency floating peg is that it is interfering with the FEDs flat out $ devaluation plan. Is there a provision to lock up Ben in it?
Besides how does this plan address the biggest overt manipulater we have seen in years, they aren't even trying to hide it. The Swiss!
The article said it would apply to all foreign countries, not just China, but who knows how flexible "currency devaluation estimates" can be when push comes to shove.
C'mon Tyler, you used to give us market insight 2-6 months in advance of what is really going on, now it's only 2-3 weeks ;P
Well done! Thank you very much for professional templates and community edition sesli chat sesli sohbet


text:
Reviews - Heroes Hostel-Hotel
Grainger Street, ,, Newcastle upon Tyne, NE1 5JE
Price FromView Rooms
Customer Reviews
Our reviews are from genuine LateRooms.com customers. We verify that the customer has stayed before leaving a review.
Very Good
100% would recommend it to a friend
Customer service
Room quality
Newcastle - Lads weekend
Very good for the money had a good stay - ideal for lads to crash
Of course the rooms are a wee bit small but for the money what else do you expect.
Great location and friendly staff, my stay was enjoyable and if I'm ever back in Newcastle I would definitely go back.
Read More Less
- < previous
- 1
- page 1 of 1
- > next


text: Tim De Cinces brings a diverse business background to HOM Real Estate. After playing 8 years of professional baseball for the Baltimore Orioles, San Diego Padres and Oakland Athletics, Tim founded Home Plate Development. HPD has developed 26 homes in the Coastal Orange County area. Tim has personally overseen the acquisition, entitlement, design and construction of each home site. In addition to his extensive residential development experience, Tim is the owner/operator of the Beach Pit BBQ restaurants. The original Beach Pit BBQ is in Costa Mesa with other locations in Old Town Tustin and Orange. The Beach Pit BBQ was chosen "Best Family Restaurant" by the OC Weekly and the NY Times picked it the can't miss food at Angel's Stadium of Anaheim. Tim has been nominated for Entrepreneur of the Year by the OC Business Journal and was recognized in the OC Metro Top 40 under 40 as one of the most influential OC Business people under 40. Tim graduated from UCLA in 1997 where he also was a 3 time All-American baseball player leading the Pac-12 in home runs his junior year. Tim has served as chairman of the UCLA Orange County Wooden Fund from 2009-current. He has been a licensed California Real Estate Broker since 2003. Tim has "all the bases covered" for his clients: an understanding of the local markets as an investor and developer; knowledge of the entitlement, permit and construction process should improvements be in the works; and the ability to handle any transaction no matter how complex as an accomplished entrepreneur.


text:
LF Collaboration Summit Preview: QuIC's Mark Charlebois
When I think back to the first Linux Foundation Collaboration Summit, I start to realize how much work the community has gotten done over the last five years. Since meeting at Google's headquarters in June 2007, we've seen real advancements for Linux in super computing, cloud computing and virtualization. There are really interesting things that have happened around high-availablity (HA), for example, that you will see first-hand at the upcoming Collaboration Summit. Working Groups at The Linux Foundation have also been hard at work on Accessibility, Networking, Device Drivers, Open Printing and Open Compliance, just to name a few. But perhaps no area of computing has gotten the attention in recent years for Linux as mobile and embedded. And, of course, this is one of the primary areas of emphasis on this year's schedule.


text:
Your Government
City Calendar
City Code
City Directory
City Employment
Comprehensive Plan 2030
Featured Stories and Archives
Forms, Applications & Docs
Frequently Asked Questions
Legal Notices
Links Library
Maps Library
Sister Cities
Special Notices
ADA Compliance
The City of St. Augustine remains committed to providing accessibility to all and provides for handicapped accessible parking in the city. For a map of accessible parking locations, Click Here To notify the city regarding accessibility concerns contact Todd Grant, Public Works Deputy Director, Phn: 904.825.1040, Fax: 904.209.4286, Email: firstname.lastname@example.com. You may also write City of St. Augustine, P.O. Box 210, St. Augustine, FL 32085-0210.
Consumer Confidence Report
The City of St. Augustine remains committed to providing clean and safe drinking water. For the previous year's sampling results please click here. To notify the city regarding water treatment concerns contact: Patrick Timoney, Water Treatment Plant Supervisor, Phn: 904.825.1044, Fax: 904.823-2280, Email: email@example.com; or firstname.lastname@example.com, or write the City of St. Augustine, P.O. Box 210, St. Augustine, FL 32085-0210.
The Castillo de San Marcos National Monument is St. Augustine's most famous historical landmark and probably the most visited. Constructed by the Spanish late in the late 1600's, the Castillo will celebrate its 70th anniversary as a national monument next year.
A recently released study that took a close look at St. Augustine's heritage tourism offers an assessment of the industry and makes recommendations aimed at enhancing that industry and maintaining its viability.
The study, "Heritage Tourism Assessment & Recommendations" was conducted over a two year period by a five member team from the Southern Office of the National Historic Trust for Historic Preservation. The cost of the study, $25,000, was shared equally by the City of St. Augustine and the St. Augustine Foundation Center.
After reviewing the study, St. Augustine Mayor George Gardner commented, in a column in the St. Augustine Record, "It is to my mind perhaps the most significant study our city has had for years -- perhaps generations. I'm gratified that many of its recommendations are elements we're already working on.
"Central to the Heritage Tourism study is the establishment of a Heritage Tourism task force, bringing in all the 'stakeholders' in our city's tourism industry: business owners, restaurants, accommodations, attractions, city government, our Heritage Tourism Department, our county Tourist Development Council and Visitors and Convention Bureau, the St. Augustine & St. Johns County Chamber of Commerce, the St. Augustine Historical Society, and our residents.
"If we can work together, as a community, the only special interest being our entire community, the rest of this study's road map will fall into place, with a destination undreamed of even today."
The 41-page study includes an overview of heritage tourism, discussions regarding the workings of the community and tourism industry, discussions of historic sites and programs and the need for authenticity and quality as well as recommendations regarding preservation and marketing.
Click here to read the report (PDF)
|Click here to get Adobe Acrobat Reader
The appendix of the report refers to the "Charleston Tourism Management Ordinance," which was included in the written report but not in the electronic version and thus does not appear in the above referenced PDF file.
To view the Code of the City of Charleston, click here, then click on "Chapter 29 Tourism."


text:
Lawyer Profile Detail
Kirsten Thompson
Corporate Commercial Litigation
Health Law
Life Sciences
Osgoode Hall Law School
Queen's University
Ontario, 2000
Kirsten Thompson is a partner in our National Technology Group. She has a general commercial practice with a focus on providing privacy, data security, information governance and e-discovery advice to clients in a wide variety of industries.
Ms. Thompson advises on the informational elements of business transactions and helps clients manage information crises such as data breaches, investigations and class actions. She assists clients navigating the legal and privacy requirements of new products and technologies, as well as provides compliance advice both within and across jurisdictions. She also assists clients in developing policies and practices around social media, surveillance, biometrics, marketing and telematics, including conducting privacy audits and information governance risk assessments. Prior to joining the firm, she was in house counsel at a technology company where she was responsible for both the business and legal aspects of information management.
- Advised both provincial and national employers on HR privacy issues, including employee records issues, recruitment and screening issues, employee drug and alcohol testing, workplace surveillance (including the use of biometrics, CCTV, and location-based tracking (GPS), as well as traditional methods) and technology management issues such Bring Your Own Device policies and information security.
- Conducted a privacy audit of the Canadian operations of a North American publicly traded (TSX) provider of technology solutions and services, including developing an enterprise-wide records retention policy.
- Retained by a US publicly traded (NASDAQ) information, analytics and marketing services provider to provide advice in respect of an expansion of a service into Canada.
- Advised a US-based acquiring corporation about the management and integration of Canadian personal information held by the target corporation; also conducted due diligence of a target corporation's privacy and information governance practices.
- Advised a gaming corporation on data security and privacy issues related to contracts with private service providers for the day-to-day operation of casinos.
- Advised a health care facility on the information and data security issues arising in the context of an agreement with a third party health care application developer.
- Reviewed and/or drafted employer policies on privacy, acceptable computer use, Bring Your Own Device, social media, data and records retention and surveillance.
- Retained to draft website and mobile app privacy policies and notices, terms of use policies and health information consent policies.
- Advised a technology company on legal and privacy considerations in respect of providing geo-fencing services to retailers.
- Advised an international client on best practices regarding the recording of customer calls in and across multiple jurisdictions, and the storage and use of such recordings.
- Advised an entertainment services company on the information management and sharing practices for a customer loyalty program across multiple providers.
CRISIS MANAGEMENT, LITIGATION and E-DISCOVERY
- Advised retailers, credit agencies and health information custodians in respect of data breaches, including managing the breach, drafting notices and notifications, responding to privacy commissioners, assisting with investigations and post-event debriefing.
- Initiated and defended against Freedom of Information and Access to Information requests in multiple jurisdictions and advised clients on the strategic use of access regimes in pre-litigation.
- Drafted and negotiated numerous e-discovery plans, as well as advised clients on implementing litigation holds, e-discovery plans, and management of privilege issues.
Ms. Thompson regularly speaks and writes on substantive matters of law and procedure, as well as being a regular contributor to a variety of legal and popular magazines. Her publications have been cited by the Supreme Court of Canada and the Quebec Superior Court.
Ms. Thompson received her LL.B. from Queen's University, where she graduated with a number of awards and distinctions, and her LL.M. from Osgoode Hall Law School. Prior to obtaining her law degrees, she obtained her B.Sc. from the University of Calgary and her B. Journalism (Hons.) from Carleton University.
Ms. Thompson was called to the Ontario bar in 2000. She is a member of the Canadian Bar Association, the Advocates' Society, International Association of Privacy Professionals, the Guild of Sommeliers, and is on the Board of Directors of Pride at Work Canada.
Blog Posts
Transactions & Cases
RIA Telecommunications of Canada Inc. and Euronet Worldwide, Inc. acquire XE Corporation
→ Read
Our Firm
→ Read


text:
According to a June 27 report from Cageside Seats, two new bouts have been added to this weekend's WWE Money in the Bank card in Boston. In WWE Divas action, Summer Rae is set to battle Layla, with Fandango as special guest referee. The other new addition to the card is a heavyweight match, as Big E takes on Rusev.
What should WWE Universe take away from the announcement? First of all, WWE Money in the Bank needed this. With Daniel Bryan still nursing a neck injury and Brock Lesnar not expected to appear, the main card needed a little boost to drive fan excitement. Before the additions of Summer Rae vs. Layla and Rusev vs. Big E, WWE Money in the Bank was only slated to feature two ladder matches, a pair of tag-team bouts and a WWE Divas championship.
The promotion did a fine job rounding out the WWE Money in the Bank card by making a pair of key announcements during this week's episode of WWE Smackdown, which aired on the SyFy network. Rae vs. Layla is interesting because the pair have been feuding over Fandango, a mutual love interest. Rae used to date Fandango, until he broke up with her via Twitter. Fandango currently dates Layla, but he appears to be torn between the two.
There's a couple different ways the WWE could script the Rae vs. Layla bout to go down. They could have Fandango split from Layla to go back to Rae, his former girlfriend. The WWE could also realistically have Fandango do a quick three count to notch Layla the victory. In all likelihood, Rae and Layla will team up and turn on Fandango because they'll realize its silly to fight over him. The WWE is working hard to get rid of their misogynistic image, so having Rae and Layla team together might be the right move.
It's a bit of a sexist, misogynistic storyline to have Rae and Layla fight for Fandango's love. Having them join forces to smash Fandango with a steel chair would be far more awesome, and way less misogynistic. As for Big E vs. Rusev, this one is a bit of a squash match. Rusev has been getting a major push lately as the WWE's top heel besides Lesnar, so it's likely he'll send Big E to an early shower.
Big E has been mired in midcard territory ever since losing the WWE Intercontinental Championship. A strong showing against Rusev, even in defeat, could elevate him back up the ladder. It's make or break time for Big E, and he has the opportunity to prove to WWE Universe that he has what it takes to carry a feud with the promotion's fastest-rising heel. As for Rusev, he hasn't yet lost in the WWE.
He's been getting a huge push by the promotion, and the fans have already latched on him as a lovable villain. Rusev was an unknown just six months ago, but he's been drawing some great heat from fight fans over the past few weeks. The WWE is very high on him right now, and he has a strong upside. WWE Money in the Bank is set for June 29 in Boston.
Suggested Links
- CM Punk's upcoming television appearance irks WWE officials
- CM Punk's new MMA-themed Twitter account confirmed a fake
- Daniel Bryan to return at WWE Monday Night Raw in Knoxville
- Daniel Bryan to be sidelined several weeks due to neck injury
- Daniel Bryan walks away from WWE Wrestlemania 30 as world champion


text:
Nicole Duke Raleigh-Clement Part Ways
Submitted by David on
From VeloNews
BOULDER, Colorado (VN) — After a series of health issues and an acrimonious split with her Raleigh-Clement team, American cyclocross racer Nicole Duke has put her 2012-13 season on hiatus.
A former World Cup downhill and dual-slalom mountain bike racer, Duke had her best cyclocross season to date last year racing for Cannondale-Cyclocrossworld.com, finishing second overall in the U.S. Gran Prix of Cyclocross series and third at the U.S. national championships.
However, during the first half of the 2012-13 cyclocross season the 38-year-old Boulder resident has struggled with setbacks off the bike, including a change in teams — her contract with Cannondale-Cyclocrossworld.com was not renewed — as well as a divorce, low iron levels, a tooth infection, and finally, an unexpected split with her new Raleigh-Clement team.
Related Articles
News Item:
2 Comments
Want to know more from Nicole?
Submitted by Kris Thompson on
If you want to know more about this from Nicole than tune in tonight on Over the Top Radio has George interviews Nicole Live from Retul headquarters in Boulder!
Points: 7
I don't "know" her but
Submitted by kung fu panda (not verified) on
she's always seemed REALLY nice. Quite a bit of drama lately, power through it.
Points: 11


text:
As society and industry is striving for always better alternative transportation, it may be helpful to reflect on the past — even attempt to look into the future.
We do that every time when talking about "out of the ordinary ways of moving goods and people" — just another term for sustainable mobility, which is nothing other than our ever-present alternative transportation commentaries.
The total number of vehicles driving around the streets of our planet had already exceeded one billion in 2010, not counting vehicles which operate off-road. It would not be difficult to imagine how city traffic would choke the streets and the air if we exclusively continued using petroleum products, when predictions are for 2.5 billion vehicles by the year 2050.
Can we learn from the past? — We must!
A century ago it seemed so much easier to use the fuel of the future — petroleum — rather than lite a fire to heat the water in the boiler of a steam car, or to re-charge the cumbersome accumulator of the electric vehicle overnight; — Petroleum is the reason we are where we are today.
How soon will we run out of oil and all the many products we derive from it? — Electricity will always be available, soon to be generated by many renewable natural resources.
We have learned from the mistakes of the past —great, if that were also true for armed conflicts! — And now we return to the age of the electric vehicle.
Already, more than half of the world's population live in cities, and the UN predicts that 9 billion people will live in cities 25 years from now – more the earth's inhabitants at this time.
For the last three quarters of a century, the opposite has been the case in North America. Low density suburbs were constructed, new factories and large box stores with huge parking lots even further away from city centers made cars an absolute need to make a living.
This brought prosperity to North America, and other countries followed the example, or are in the process to become motorized. Everybody wants wheels and the freedom to travel; advance from a bicycle to a motorized two-wheeler, then add a roof and two more wheels.
That progression has lead the "developed" countries to the predicament we find ourselves in.
A major automobile magazine recently invited 250 leaders of government and industry to a congress "The Future Of Mobility'. The keynote speaker from a large carmaker observed that in the past cities were built to accommodate the automobile, but from now on we must build cars to conform to the city.
City cars, such as Daimler's smart are a new sight in North America, but already seem "normal" again now (after the bubble cars of the post-war era) in cramped European communities. Japanese Kei cars have been around for more than half a century, but grew in engine size over the years.
A new version of micro cars for the future is now under development everywhere. General Motors, MIT (Massachusetts Institute of Technology) and a Spanish consortium developed the Hiriko; many carmakers are working on similar concepts of future mobility.
Hiriko comes from the Basque word for "urban" or "from the city".
Read the Forbes magazine story for an overview of Hiriko, then follow the vehicle's launch in Spain, and be amazed by the Hiriko driving around (video) in Berlin.
Mobility is essential for society to function, but with billions of new vehicles to be added in the BRIC countries (Brazil, Russia, India, China) and elsewhere, the elimination of emission is a matter of survival for civilization.
Peak Oil is one event forcing us to change now, will Peak Cars be the next?