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 2013 (2013), Article ID 478470, 12 pages
Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks
1College of Computer, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210003, China
2Basic Experiment and Teaching Center, Henan University, Kaifeng 475003, China
3Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China
Received 9 June 2013; Accepted 2 August 2013
Academic Editor: Han Zhijie
Copyright © 2013 Du Xiaoyu 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.
We discuss the problem of maximizing the sensor field coverage for a specific number of sensors while minimizing the distance traveled by the sensor nodes. Thus, we define the movement task as an optimization problem that involves the adjustment of sensor node positions in a coverage optimization mission. We propose a coverage optimization algorithm based on sampling to enhance the coverage of 3D underwater sensor networks. The proposed coverage optimization algorithm is inspired by the simple random sampling in probability theory. The main objective of this study is to lessen computation complexity by dimension reduction, which is composed of two detailed steps. First, the coverage problem in 3D space is converted into a 2D plane for heterogeneous networks via sampling plane in the target 3D space. Second, the optimization in the 2D plane is converted into an optimization in a line segment by using the line sampling method in the sample plane. We establish a quadratic programming mathematical model to optimize the line segment coverage according to the intersection between sensing circles and line segments while minimizing the moving distance of the nodes. The intersection among sensors is decreased to increase the coverage rate, while the effective sensor positions are identified. Simulation results show the effectiveness of the proposed approach.
1. Introduction
A wireless sensor network (WSN) consists of a large number of resource-limited (such as CPU, storage, battery power, and communication bandwidth) tiny devices, which are called sensors. These sensor nodes can sense task specific environmental phenomenon, perform in network processing on the on the sensing field and communicate wirelessly with other sensor nodes or with a sink (also called data gathering node), usually via multihop communications [1]. Water will be the material basis of human sustainable development for affording food, raw materials, and living space for the survival of mankind in the future [2]. However, people cannot easily monitor and develop resources in a large scale because underwater environment is still more serious to human being. Therefore a lot of science and technology communities in different countries have focused on monitoring and exploring underwater resources reasonably by various technologies [3]. Underwater sensor networks are envisioned to enable applications for oceanographic data collection, pollution monitoring, offshore exploration, disaster prevention, assisted navigation, and tactical surveillance applications [4], so it will play an important role in monitoring and developing water resource. The coverage and connectivity are fundamental issues in WSNs, which can determine the scope of services provided by the network, and have a great influence on the network cost and performance of specific applications. The coverage can be considered as a measure of the service quality of WSNs [5, 6].
We analyze the coverage issues in 3D underwater sensor networks (USNs), where sensors are randomly deployed in a 3D field (Figure 1). Underwater sensor nodes are placed in 3D space, and the computational complexity of the coverage optimization algorithm in 3D space is higher than the coverage optimization algorithm in a 2D plane. Therefore, some applications cannot be effectively modeled in 3D space. We propose a 3D coverage optimization algorithm based on sampling (COS) that combines the concepts of simple random sampling in statistics [7] and optimization algorithms [8]. First, we transfer the coverage in 3D space into a 2D plane for heterogeneous networks by plane sampling in a target 3D space. Second, we convert the plane coverage to line segment coverage by the sampling line in the sample plane. Finally, we establish a quadratic programming mathematical model to optimize the line segment coverage according to the intersection between sensing circles and the line segment while minimizing the moving distance of the nodes. The plane coverage should be optimized to enhance the line segment coverage. We summarize the main contributions of our study as follows.(1)Sample random sampling is applied to the coverage problem in 3D space for dimension reduction.(2)A quadratic programming mathematical model is established according to the intersection position of the sensing circles and sample line, position of the sensing circles, and radii of the sensing circles. (3)We conclude that the sum of the node traveling distance for the unchanging node sequence is less than the sum of the changing node sequence. This conclusion is mathematically proven in this study.(4)A nonlinear quadratic optimization problem is converted into a linear quadratic optimization problem by tightening constraints to obtain the suboptimum solution.
The remainder of this paper is organized as follows: Section 2 reviews prior studies on sensor network coverage and discusses related works. Section 3 provides some assumptions and key definitions and describes the system model for underwater wireless sensor networks. Section 4 discusses the development of the mathematical model for sensor network coverage and presents the COS algorithm in detail. Section 5 presents the simulation results of the COS algorithm. Finally, Section 6 concludes and outlines the direction of future works.
2. Related Works
The sensor coverage problem has been extensively studied in the field of multirobot systems and computational geometry the Art Gallery Problem (AGP) and the circumference coverage are related to the coverage of WSNs closely [9]. -Coverage of sensor networks is one of research focuses in WSNs [1, 10–14]. Huang et al. present a polynomial time algorithm formulating circumference coverage to a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least sensors [10] the optimal deployment density bound for two-coverage deployment patterns is derived in [11] where Voronoi polygons generated by sensor nodes are congruent. The authors design a set of optimal patterns that achieve two-coverage and one-, two-, and three-connectivity thought extending these patterns by considering the connectivity requirement. Ammari and Das focus on coverage and connectivity in 3D WSNs using a continuum percolation theory based approach [13]. The network exhibits a coverage percolation (resp., connectivity percolation) when a giant covered region (resp., giant connected component) almost surely spans the entire network for the first time. It proposes an integrated-concentric-sphere model to address coverage and connectivity in 3D WSNs in an integrated way. Ammari uses Helly's Theorem and the Reuleaux tetrahedron model for characterizing -coverage of a 3D deployment field and develops a placement strategy of sensors to fully -cover a 3D field [12, 13].
Coverage algorithm based on virtual force is one of research hotspots currently [15–19]. For a given number of sensors, the VFA algorithm attempts to maximize the sensor field coverage. The sensor nodes are assumed to be deployed in virtual force field; moreover, a judicious combination of attractive and repulsive forces is used to determine virtual motion paths and the rate of movement for the randomly placed sensors. Once the effective sensor positions are identified, a one-time movement with energy consideration incorporated is carried out; that is, the sensors are redeployed to these positions. In [18], Delaunay triangulation is formed with these nodes, and adjacent relationship is defined if two nodes are connected in the Delaunay diagram. Force can only be exerted from those adjacent nodes within the communication range.
The application of linear programming in coverage problem focuses on point (or target) coverage, where the objective is to cover a set of points (targets) [6, 8, 20–22]. Zhao and Gurusamy consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity. The authors determine an upper bound and a lower bound on the network lifetime for the MCT problem and then develops an approximation algorithm to solve it [20]. In [21], the sensing task of covering maximum number of targets while minimizing the energy consumption of the sensing operation is defined as an optimization problem of adjusting the sensing range parameter jointly with selection of nodes in a target coverage mission. A distributed greedy-based heuristic is proposed that nodes with less priority reduce their sensing range before their neighbors and optimal adjustment of sensing range of active nodes is done via a dual-based algorithm. Cardei et al. model the solution as the maximum set covers problem and design two heuristics that efficiently compute the sets, using linear programming and a greedy approach [8]. In [22] the sensor node deployment task has been formulated as a constrained multiobjective optimization problem where the aim is to find a deployed sensor node arrangement to maximize the area of coverage, minimize the net energy consumption, maximize the network lifetime, and minimize the number of deployed sensor nodes while maintaining connectivity between each sensor node and the sink node for proper data transmission.
As described earlier, almost all of coverage strategies in 3D space are based on a premise that sensor nodes are deployed in a specified location and stay there so that the maximum coverage of 3D space is achieved. However, sensor nodes are usually deployed at random and are impossible suspended at specified location without any connection in water. Most of the researches on coverage and connectivity in WSNs are not suitable for underwater because of two-dimensional application only. We propose a 3D coverage optimization algorithm for underwater 3D sensor networks (USNs) in which sensor nodes are randomly deployed and are fixed by cables, in which quadratic programming is applied to coverage optimization problem in 2D plane and 3D space.
3. Assumptions and Definitions
3.1. Assumptions
We assume that a large number of underwater sensors are distributed in an area of interest. A 3D USN model is described as follows [23, 24].(1)A 3D USN contains two types of sensor nodes: one is used for communications and is deployed on the water surface; the other is used for sensing and is deployed underwater.(2)All sensor nodes that are deployed underwater have homogeneous models; that is, all sensors have binary sensing coverage models. Thus, the sensing model is a sphere, and all sensors adopt the radius of the sensing sphere model.(3)The underwater sensor node communicates with the surface node via a cable that connects the two sensors.(4)Sensor node position and depth can be acquired via the sensor nodes deployed on the water surface and cables.(5)The sensor nodes on the water surface are fixed in place with an anchor. However, the underwater nodes can move to a specified location vertically.(6)Sensor nodes have enough residual energy to move the specified location because coverage algorithm is executed during network initialization.
We assume that sensor nodes are randomly deployed in a 3D cuboid space and denote the distance between two spots as a Euclidean distance.
3.2. Definitions
Definition 1 (binary sensor model). Suppose that the distance between sensor node and space spot is and that each sensor node has a sensing range . The sensing probability is shown as follows:
Definition 2 (sensing sphere). Sensor node is positioned at , and the sensor model is the binary sensor model with radius . Thus, the coverage space of the sensor node underwater is a sphere with a center located at . The radius is denoted by .
Definition 3 (sensing circle). The distance of underwater sensor node to the sample plane is . When the sensing sphere of and sample plane intersect, a circle in the plane will be formed. The circle center is the projection of to , and the radius of the circle is .
Definition 4 (sample plane). An arbritrary plane in 3D space intersect the boundary of 3D monitoring space to form polygon MNOP, as shown in Figure 2. The plane area which is contained by polygon MNOP is defined as sample plane.
Definition 5 (sample line). Choose a line at random in sample plane and denote it as "", line , and the boundary of sample plane intersect at points and , as illustrated in Figure 3. Line is defined as sample line.
Definition 6 (coverage rate). Coverage rate is determined by the ratio between the volume of coverage space and the volume of deployed space , which is given by the following equation:
3.3. Problem Definition
The proposed algorithm attempts to maximize the coverage of USNs while striving to minimize the movement distance of the nodes. This problem can be defined as follows: given that sensors are randomly and uniformly deployed on the surface of the ocean/sea, we devise an algorithm that maximizes the total 3D coverage of the nodes and minimizes the message and travel distance complexity. As mentioned in the Introduction, we seek a fully distributed algorithm that will enable the sensor nodes to self-organize before data collection commences. Our proposed algorithm has five phases: sample plane in a target 3D space, sample line in the sample plane, establishment of a quadratic programming mathematical model to optimize line segment coverage, depth assignment, and additional rounds.
4. Coverage Optimization Algorithm Based on Sampling
The sample planes intersect with the sensing spheres. The distance of the center of the sensing spheres to the sample planes is less than . The intersection of the sensing spheres and sample planes are a set of sensing circles with different radii (Figure 4). We analyze the influence of the position of coverage circles on the coverage rate of sample planes in the and directions. Although sensor nodes move in the -axis, the radii of the sensing circles will change in the horizontal plane and locations will remain unchanged, respectively. In the vertical plane, the sensing circles also move in the -axis; however, the radii of these sensing circles contain an original value. A coverage optimization algorithm is executed to change the radii and locations of the sensing circles in the sample planes. Thereafter, the sensor nodes corresponding to the sensing circles will be redeployed according to the new radii and locations of the sensing circles.
4.1. Coverage Optimization Analysis Based on the Horizontal Sample Plane
is a horizontal sample plane in 3D space and has a plane function of (Figure 4). The sample plane interacts with the coverage sphere to form a coverage circle (Figure 5). The radius of the sample plane is expressed as follows:
is a random straight line in plane . The distance of lines and to line is . Suppose that sensing circles exists and that the centers of these sensing circles are located between lines and . Each of these sensing circles may intersect with line ; for example, and line may intersect at points and . We describe the sensing line segment of line and as a set; that is, . will be an empty set if and line do not intersect. The union of these sets should include line segment set , and straight line is completely covered by the sensing circles
The radii of the sensing circles increase as the underwater sensor node moves closer to plane in the -axis. Thus, the sensing line segment is longer than the previous sensing line segment. The radius of the sensing circle corresponding to the underwater sensor node increases with the movement of the underwater sensor node toward the plane.
Suppose that the center of the th sensing circle is at and that the radius is . For , the sensing circle intersects line . The points of the intersection are shown as follows:
For , the segment set corresponding to the sensing circle will be empty because the sensing circle and line do not intersect. This problem is hard to resolve because of two reasons: the constraints in (5) cannot be algebraically described because confirming the relationship among the sets is difficult; this problem is a nonlinear programming problem because the upper and lower bounds of the sets and variables are nonlinear, so the problem is hard to be resolved [21].
4.2. Coverage Optimization Analysis Based on the Vertical Sample Plane
In this section, we derive the optimization coverage in a vertical sample plane (Figures 6 and 7). is a vertical sample plane, and the function of plane is . is a random straight line in plane and is parallel to the -axis. Line intersects sensing circles , which correspond to sensor nodes . The sensor nodes are located at , and the centers of the sensing circle are located at , . Plane has . The radii of the sensing circles are expressed as follows:
Definition 7 (upper and lower intersections). Coverage circle and sample line () intersect at points and , where . Points and are denoted as the upper lower intersections, respectively, (Figure 8).
The sensing circles and line segments intersect at , , , . The intersection segments of the sensing circles and line are described as sets; that is, . The union of these segment sets should include the segment set if line is completely covered by sensing circles
The sensing line segments move with the corresponding underwater sensor nodes moving in -axis, but the length of sensing line segment is unchanged. We suppose that the movement distance of sensing circles is separately. The sensing line segments after moving are described by sets, that is, . The optimization algorithm is developed to deal with the sample straight line coverage completely with the object minimum of the sum of sensing line segment moving distance. That is, Constraint conditions are shown as
It is difficult to find the optimal solution because the previous problem is nonlinear. Therefore we seek the feasible solution by tightening constraints. First, we analyze the affection of the sensing circles' position on optimization algorithm.
Theorem 8. The sum of the traveled distance of the nodes is small when the order of the nodes remains the same compared with other nodes.
Proof. We assume that only two sensing circles with centers located at and exist in interval (Figure 9). Suppose that . These two sensing circles and the -axis intersect at points , and , . The spot coordinates are expressed as follows:
Both and are the moving distance of sensing circles and , respectively. We assume that both sensing circles will be arranged in the same order along the -axis after optimization coverage The complete coverage of line segment implies the following: We then derive the following equation: The minimum moving distance of the sensing circles is computed as follows: We obtain , and the order of the sensing circles changes. The complete coverage of line segment implies the following: Equations (18) denote the following: Thus, the minimum moving distance of the sensing circles is computed as follows: that is, According to the nature of the circle, we derive the following equation:
Thus, ; that is, . We conclude that the sum of the moving distance of sensing circles in the same order is less than the sum of the moving distance of sensing circles in different orders. Thus, sensing circles intersect at the sampling line and can be decomposed into multicoupled combinations of mobile nodes. After executing the coverage optimization algorithm, each pair of sensing circles will maintain their order. Thus, the order of all nodes will not change.
On the basis of the previous analysis, we assume that the relative order of the sensing circles after optimization is the same before optimization. We propose different constraint conditions depending on the length of the sensing line segments. The length of the sensing line segment is , and the sensing circle and sample line intersect at and . If sensing circles intersect at the sample straight line, the sum of the length of the sensing line segments can be written as follows: For , the sample can be completely covered by sensing circles. Therefore, the intersection coordinates of the sensing circle and straight line imply the following inequalities: The upper intersection of circle should be the lower side of the lower intersection of sensing circle . The lower intersection of circle should be the upper side of the upper intersection of sensing circle . The constraint conditions of the optimization algorithm follow the following equation: For , the sample cannot be considered a solution to the optimization problem because the sample straight line cannot be fully covered by sensing circles. Therefore, the maximum coverage of the sample straight line is expected. The sample straight line is covered maximally when the sensing line segments in the sample straight line are disjointed. We establish the new optimization algorithm as follows:
The new positions of the sensing circles are , , and the corresponding sensor nodes are located at , . Figures 10(a) and 10(b) illustrate the position of the sensing circles after random placement and the final sensor positions determined by the COS algorithm, respectively. Figures 10(a) and 10(b) illustrate an example of , whereas Figures 11(a) and 11(b) illustrate an example of .
We find a feasible solution after limiting the constraints of the optimization algorithm in vertical planes. Moreover, the 2D plane coverage optimization in the - direction is similar to the - direction. Thus, we only sample the vertical plane in underwater 3D space (Figure 6).
4.3. Complete Algorithm
The pseudocode of the COS algorithm and the single sample plane coverage function are presented in Algorithms 1 and 2, and the flowchart of the single sample line coverage function is presented in Figure 12. The following parameters are defined for the mathematical modeling process: Sensor_set: the set of sensor node position, Sensor_set, circle_set: the set of sensing circle position and radius, circle__set: the set of sensing circle position and radius after optimization, _step_plane: the step size of plane sampling, _step_line: the step size of line sampling, (, , ): the length, width, and height of the 3D space, respectively, _int, _int: the initial position of the sample line in the and directions, respectively, _line, _line: the position of the sample line in the and directions, respectively, : the sensing radius of the sensor node.
The COS algorithm is performed by the sink node on land. First, a plane that is parallel to the - plane is sampled in interval (0, ) (Line 1). In Lines 3 to 6 of the COS algorithm, the positions and radii of the sensing circles in the sampling plane are calculated if the sensing spheres intersect at the sampling plane. The plane coverage subroutine is invoked in Line 8 to optimize the sampling plane coverage. Thereafter, the sink node sends DEPTH messages to the underwater sensor nodes. Any node receiving a DEPTH message performs its specified movement (Line 9). After the first optimization, additional planes are sampled according to the step length until the sampling plane is beyond the boundary of 3D space, and the optimization algorithm is conducted numerously to optimize all sampling planes coverage. Additional rounds are also conducted when the sampling planes are parallel to the - plane to increase the total coverage in Lines 14–24.
Given the sampling plane function, the position of the initial sampling line, boundary of the plane, step length of the sampling, and positions and radii of the sensing circles, the subprogress can be used to optimize the coverage of the sampling plane. Line 1 is the line function of the initial sampling line. Line 3 performs the line coverage optimization function and calculates the new positions of the sensing circles. Additional optimization sequences are conducted until the sampling line is beyond the boundary of the sampling plane.
We describe the single-line coverage optimization function in a flowchart (Figure 12). The following equation is the expression of single-line coverage optimization function:
5. Simulation
In this section, we describe the simulation setup, performance metrics, and performance results of the study. We assume that all messages can be transmitted/received without any errors and that the sensor nodes are uniformly distributed in a 100 m 100 m 100 m 3D space. The sensing radius of the underwater sensor node is 20 m, and the communication nodes that are deployed on the water surface can communicate with each other. A coordinator node is attached to the server and acts as a gateway to the USNs. The server implements the COS algorithm presented in Section 4 and conveys the new position of the underwater sensor nodes to the coordinator. The location of an underwater sensor node is adjusted by its corresponding buoy via the cable after receiving the information.
Figure 13 shows the initial position of the sensing circles in one of the vertical sample planes after random distribution. Figure 14 shows the final position of the sensing circles of the COS algorithm in the same vertical sample planes. We observe that the overlap area in Figure 14 is less than the overlap area in Figure 13.
Figure 15 shows the coverage rate comparison between the random placement and COS algorithm in the sample vertical planes. The simulation is conducted with 60 sensor nodes, and the sensing range is set to 20 m. The sampling plane coverage rate of the COS algorithm outperforms the random approach by approximately 10%. This improvement is insignificant and is caused by the limited movement direction of the nodes (i.e., vertical movement only).
We have conducted experiments with different node quantities. The results shown in Figure 16 clearly reveal that our algorithm is valid for various node quantities. The simulation is implemented twice, and the sensing range is set to 20 m. The COS algorithm outperforms the random approach by approximately 10% in terms of coverage. The performance of the COS algorithm is superior when the number of nodes is relatively few. Considering that the 3D space coverage and node deployment on the surface have a close relationship, the optimal coverage in 3D space will be achieved by the COS algorithm if the nodes on the surface are distributed well.
Figure 17 presents the simulation results in different sampling steps for 40 to 80 underwater sensor nodes. The algorithm performance is weak when additional iterations are implemented because the optimization in the second plane will have a negative effect on the first plane if two adjacent planes intersect at the same sensing sphere.
Similarly, when sensing range is increased while the number of nodes is fixed as 60 and 80, respectively, coverage increases as seen in Figures 18 and 19. The patterns show that the coverage can be effectively enhanced by the COS algorithm. We consider the influence of node quantity, iteration, and sensing range in the experiments and find that the proposed algorithm works effectively under extreme surroundings.
6. Conclusion
This study proposes a 3D COS to enhance the coverage of USNs. We convert a 3D space coverage into a 2D plane coverage for heterogeneous networks by a sampling plane in the target 3D space. The positions of the sensing circles in the sample plane are calculated by the COS algorithm to enhance coverage. Thereafter, the sensor nodes that correspond to the sensing circles are redeployed. The simulation results show that the COS algorithm can improve the coverage provided by an initial random placement. To a certain degree, the coverage in the 3D space improves when the iterations increase. However, the coverage will remain unchanged or decrease when the number of iterations surpasses a certain value for the adjacent sample planes. The performance of the COS algorithm is affected by two aspects:(1)for the limitation of the network model, the coverage cannot be significantly improved when the wireless sensor nodes are nonuniformly distributed,(2)the COS algorithm is performed on each sample plane alone because we do not consider the relativity between the adjacent sample planes.
In the future, we will consider the relativity of the sample planes to ensure the flexibility of the COS algorithm as well as adjust the positions of the wireless sensor nodes on the water surface to distribute uniformly the sensor nodes and enhance their coverage in 3D space.
The subject is sponsored by the National Natural Science Foundation of China under Grant nos. 61373139, 61300239 and 61171053; the Doctoral Fund of Ministry of Education of China under Grant no. 20113223110002; Science & Technology Innovation Fund for higher education institutions of Jiangsu Province (CXZZ12_0481).
- H. M. Ammari and S. Das, "A study of k-coverage and measures of connectivity in 3D wireless sensor networks," IEEE Transactions on Computers, vol. 59, no. 2, pp. 243–257, 2010. View at Publisher · View at Google Scholar · View at Scopus
- C. Wen-Yu, L. Jing-Biao, and Z. Xue-Ting, "CDS-based coverage control algorithm for Buoys based sensor networks," in Proceedings of the IEEE (OCEANS '10), pp. 1–5, Sydney, Australia, May 2010. View at Publisher · View at Google Scholar · View at Scopus
- A. Stefanov and M. Stojanovic, "Design and performance analysis of underwater acoustic networks," IEEE Journal on Selected Areas in Communications, vol. 29, no. 10, pp. 2012–2021, 2011. View at Publisher · View at Google Scholar · View at Scopus
- I. F. Akyildiz, D. Pompili, and T. Melodia, "Underwater acoustic sensor networks: research challenges," Ad Hoc Networks, vol. 3, no. 3, pp. 257–279, 2005. View at Publisher · View at Google Scholar · View at Scopus
- L. Peng, K. Liu, and G. Liu, "Research on wireless sensor networks fault-tolerant coverage algorithm base on particle swarm optimization," in Proceedings of the IET International Conference on Wireless Sensor Network (IET-WSN '10), pp. 286–290, November 2010. View at Publisher · View at Google Scholar · View at Scopus
- Y. Gu, Y. Ji, J. Li, and B. Zhao, "QoS-aware target coverage in wireless sensor networks," Wireless Communications and Mobile Computing, vol. 9, no. 12, pp. 1645–1659, 2009. View at Publisher · View at Google Scholar · View at Scopus
- M. Wang and H. Shen, Probablility Theory and Mathematical Statistics, Higher Education Press, Peking, China, 2007.
- M. Cardei, M. T. Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), pp. 1976–1984, March 2005. View at Scopus
- M. Marengoni, B. A. Draper, A. Hanson, and R. Sitaraman, "Placing observers to cover a polyhedral terrain in polynomial time," in Proceedings of the 3rd IEEE Workshop on Applications of Computer Vision (WACV '96), pp. 77–82, December 1996. View at Scopus
- C. Huang, Y. Tseng, and L. Lo, "The coverage problem in three-dimensional wireless sensor networks," in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '04), pp. 3182–3186, December 2004. View at Scopus
- X. Bai, Z. Yun, D. Xuan, B. Chen, and W. Zhao, "Optimal multiple-coverage of sensor networks," in Proceedings of the IEEE (INFOCOM '11), pp. 2498–2506, April 2011. View at Publisher · View at Google Scholar · View at Scopus
- H. M. Ammari, "On the problem of k-coverage in 3d wireless sensor networks: a Reuleaux tetrahedron-based approach," in Proceedings of the 7th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP '11), pp. 389–394, December 2011. View at Publisher · View at Google Scholar · View at Scopus
- H. M. Ammari and S. K. Das, "Critical density for coverage and connectivity in three-dimensional wireless sensor networks using continuum percolation," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 6, pp. 872–885, 2009. View at Publisher · View at Google Scholar · View at Scopus
- K. A. Crews Baumgartner, Control and optimization of track coverage in underwater sensor networks [Ph.D. thesis], Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA, 2007.
- Y. Zou and K. Chakrabarty, "Sensor deployment and target localization based on virtual forces," in Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies, pp. 1293–1303, April 2003. View at Scopus
- J. Huang, H. Huang, P. Sun, R. Wang, and X. Wei, "Probability model based coverage-enhancing algorithm for WSNs of nodes' adjustable movement pattern," International Journal of Distributed Sensor Networks, vol. 2012, Article ID 570643, 10 pages, 2012. View at Publisher · View at Google Scholar
- J. Huang, L. Sun, R. Wang, and H. Huang, "Improved virtual potential field algorithm based on probability model in three-dimensional directional sensor networks," International Journal of Distributed Sensor Networks, vol. 2012, Article ID 942080, 9 pages, 2012. View at Publisher · View at Google Scholar
- X. Yu, W. Huang, J. Lan, and X. Qian, "A novel virtual force approach for node deployment in wireless sensor network," in Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems (DCOSS '12), pp. 359–363, May 2012.
- H. Ma, X. Zhang, and A. Ming, "A coverage-enhancing method for 3D directional sensor networks," in Proceedings of the IEEE 28th Conference on Computer Communications (INFOCOM '09), pp. 2791–2795, April 2009. View at Publisher · View at Google Scholar · View at Scopus
- Q. Zhao and M. Gurusamy, "Lifetime maximization for connected target coverage in wireless sensor networks," IEEE/ACM Transactions on Networking, vol. 16, no. 6, pp. 1378–1391, 2008. View at Publisher · View at Google Scholar · View at Scopus
- M. Naderan, M. Dehghan, and H. Pedram, "Sensing task assignment via sensor selection for maximum target coverage in WSNs," Journal of Network and Computer Applications, vol. 36, no. 1, pp. 262–273, 2013. View at Publisher · View at Google Scholar
- S. Sengupta, S. Das, M. D. Nasir, and B. K. Panigrahi, "Multi-objective node deployment in WSNs: in search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity," Engineering Applications of Artificial Intelligence, vol. 26, no. 1, pp. 405–416, 2013. View at Publisher · View at Google Scholar
- H. Tezcan, E. Cayirci, and V. Coskun, "A distributed scheme for 3D space coverage in tactical underwater sensor networks," in Proceedings of the IEEE Military Communications Conference (MILCOM '04), pp. 697–703, November 2004. View at Scopus
- K. Akkaya and A. Newell, "Self-deployment of sensors for maximized coverage in underwater acoustic sensor networks," Computer Communications, vol. 32, no. 7–10, pp. 1233–1244, 2009. View at Publisher · View at Google Scholar · View at Scopus


text:
Thanatopsis (1962)
Becky Arnold and Mac Emshwiller
in a film by Ed Emshwiller
Sound design by Ed Emshwiller?
A powerful film that must be almost overwhelming when shown nice and big with a good sound system. And dig how early it is; anticipating industrial music and film/video by about 30-35 years.
More Ed Emshwiller
Screening Room with Ed Emshwiller (1975)Â 77 min.
Directed by Robert Gardner
Link offers video downloads for sale or rent
Ed Emshwiller appeared on [the weekly Boston TV program] Screening Room in July 1975 to screen and discuss the films Chrysalis, George Dumpson's Place, Carol Emshwiller, Thanatopsis, Film With Three Dancers, Scape Mates, and Crossings and Meetings.
…Ed Emshwiller started out as an abstract expressionist painter and an award-winning science fiction illustrator before becoming a major figure in avant-garde cinema and the experimental film movement of the 1960s and '70s. Eventually a highly respected video artist and dean at the School of Film/Video at the California Institute of the Arts, Emshwiller was always looking for ways to push the boundaries of film and video. He was a pioneer of computer-generated video and combining technology with art. Many of his films, including Relativity, Totem, Film with Three Dancers, and Thanatopsis received screenings and awards at New York, Cannes and other major film festivals worldwide.
…Screening Room was a 1970s Boston television series that for almost ten years offered independent filmmakers a chance to show and discuss their work on a commercial (ABC-TV) affiliate station. The series was developed and hosted by filmmaker Robert Gardner…who was Chairman of the Department of Visual and Environmental Studies and Director of the Carpenter Center for Visual Arts at Harvard for many years.
This unique program dealt even-handedly with animation, documentary, and experimental film, welcoming such artists as Jan Lenica, John and Faith Hubley, Emile DeAntonio, Jean Rouch, Ricky Leacock, Jonas Mekas, Bruce Baillie, Yvonne Rainer and Michael Snow. Frequently, guests such as Octavio Paz, Stanley Cavell, and Rudolph Arnheim appeared as well.
Nearly 100 programs were produced during the years Screening Room was broadcast. Recently, The Museum of TV and Radio in New York City offered to copy the two-inch master tapes that had been given to the Film Study Center.

subset: commoncrawl


text:
After dealing with individuals and small firms for a number of years, you get to see some patterns emerge.
One pattern, or trend, we've seen is that while a lot of firms "get" the idea of using Contact Management or CRM software, they often don't really "how" to use it. Now, I'm not talking about a lack of knowledge in terms of how to enter a contact or how to schedule a meeting. I'm talking about how to use this software tool in conjunction with their marketing and/or sales plans.
Think of it this way. A homeowner buys a cordless power drill from the home improvement superstore. The read the manual and begin to work with it. They change the bit. They charge it up. You get it. But they have no plan! Why did they buy it? They knew they needed it. They wanted to accomplish something. But they had no plan. Sounds ridiculous, right?
But often a small firm – and especially a sole proprietor – has not properly thought exactly how they'll use this tool. They don't have:
• A marketing plan
• A follow up plan
• A customer support plan
• A sales methodology
And since so many people are getting laid off from jobs and going into self-employment, little if any proper thought is given to the flow of how they'll conduct their business.
Large firms create "standard operating procedures". They create formal business plans, marketing plans and sales plans. They know that you can't get from point A to point B without a plan, a map.
You must know what you want to accomplish before you can begin using a tool that will automate your processes. Far too many just have no processes defined. A CRM tool will be useless without a well thought out and well defined plan.
We'll cover this topic more in detail in future articles.


text:
The GOP hounds are baying for Mitt Romney.
And even though the barking is coming from 2,300 miles away in Boston, Romney hears them.
Concerned Republicans are calling, asking the president of the Salt Lake Organizing Committee to sprint from the Winter Olympics back to his longtime home to run for governor this year.
The pleas are found publicly in political columns, in letters to the editor and radio talk shows. Privately, Romney is also getting telephone calls, he says.
The prospects of GOP Gov. Jane Swift, who as lieutenant governor inherited the job when former Gov. Paul Cellucci resigned to be part of the Bush administration, winning a new term are not good.
While officially backed by the Massachusetts Republican Party, in the polls she trails every Democratic candidate running against her in the basically Democratic state. And Swift recently got into a messy political fight over toll-road fees that alienated her conservative base.
Romney, also matched in some of the polls, beats Swift in a GOP primary hands down and does better against the Democratic wannabees.
And as the 2002 Winter Games are played up as a success and Romney portrayed as their savior the clamor is only rising in Bean Town.
"Please, Mitt Romney, get on the next plane out of town, come back to Massachusetts and run for governor," the Boston Globe columnist Brian McGrory writes.
Romney, however, stays coy.
Just last week Romney told CNN when asked about a challenge to Swift: "I'm pretty careful not to absolutely rule out anything, but I do think it would take an unusual circumstance for me to run against an incumbent from my own party. I'm very careful to make sure that even when doors seem pretty closed (to running), there's always a little opening."
He told the Deseret News he has turned down requests to allow political polling on his behalf and has yet to set up an exploratory committee to look at the race. But Romney knows he doesn't have much time if he's going to choose Massachusetts over Utah.
"What's challenging is, Massachusetts has a shorter fuse than the other option, so I've got to look at that sooner rather than later," he said. "I will evaluate the political landscape based on whether I can win and whether I can really make a contribution."
Utah GOP chairman Joe Cannon knows a little about Utah and national politics. "Right now, Mitt is golden, just golden," said Cannon, a U.S. Senate candidate in 1992 and older brother of Rep. Chris Cannon, R-Utah.
Romney "has done a masterful job of playing down expectations in Olympic success and delivering way over" those expectations, chairman Cannon says. Romney has become a darling of the media, not just here and in Massachusetts where people still remember his spirited challenge to Sen. Ted Kennedy, D-Mass., in 1994 but across the United States.
But all is not perfect for a Romney for Governor campaign this spring. There's the question of looking like a political opportunist a black mark on Romney's squeaky clean reputation.
"Mitt Romney has said in the past that he supports Jane Swift for governor. She takes him at his word," Swift spokesman Jim Borghesani told the Boston Herald two weeks ago.There are also the practical political problems:
- Money. While a wealthy man (Romney is a multimillionaire who has already announced he won't return to Bain Capital, the venture firm he helped found), Romney wouldn't like spending his own cash on a governor's race. He's said he wouldn't take a salary unless SLOC makes money, and that is yet to be seen. Romney has basically worked without pay for several years.
- The pimple dilemma: To pop or not to pop
- Dad who placed ad for a wife for his son gets...
- Prosecutors: Dad, son fleeing police killed...
- Quiz: Name that movie (filmed in Utah)
- Quiz: Who said it?: Utah coaches edition
- Quiz: Which Utah attraction should you road...
- Quiz: Which epic Airbnb in Utah should be...
- Costco begins new credit card agreement
- U. stadium gets bigger scoreboard,... 79
- 45 new locations open to provide free... 38
- Love won't go to GOP national convention 35
- Gov. Gary Herbert calls margin of... 33
- Supreme Court abortion decision could... 31
- Arches Health Plan shutdown leaves $33... 30
- Misty Snow likely to advance to general... 30
- Will 'Brexit' vote help Trump in Utah? 26


text:
Lynnette Blake: Woman sentenced to 15 years for posing as a doctor
Her 'patients' included terminally ill
Lynnette Blake, 38, is a wife, mother and a cancer survivor. But that didn't help her escape what was coming.
"I'm very sorry and I'm pleading for mercy from the court. The whole thing was to help people never hurt," she told a Martin County Judge Friday morning after she admitted to her part in a scheme that gave false hope to the health seeking, desperately hoping and at times, terminally ill.
"I am very sorry for everything I've done. If someone thought for one minute that I tried to harm somebody, I'm sorry," she said.
Last year, the mother of three was arrested for a series of charges including practicing healthcare without a license.
She wore a lab coat, performed IV injections and decorated her "Back to Eden Wellness Center" in Stuart with fake medical diplomas.
"I can't imagine what efforts you went to put this together, but it's shocking," said Judge Elizabeth Metzger moments before sentencing.
Christine Hughes fought her own emotions on the stand as she described Blake's treatment on her husband who was dying of stage 4 lung cancer.
"You don't prey on sick people, it's horrible what they're already going through," she said in court.
Hughes told the Contact 5 Investigators back in February how Blake's treatment plan for her husband included a cocktail of unknown IV injections and a 21 day protein-free diet.
During her sentencing hearing, friends and family described Blake as a good person with a big heart who just wanted to share what cured her of cancer with the rest of the world.
"Where you crossed the line is you really wanted to be a doctor and you weren't," said Judge Metzger who took no pity and sentenced Blake to the maximum allowed.
Prison for the next 15 years.
"She got what she deserved. You lie, you pay. She didn't deserve anything less," said a tearful Hughes moments after the sentence was announced.
As Lynnette Blake prepares for her future behind bars.
She left the courtroom whispering a few final words to her family.
It is not immediately known which prison Blake will serve her time.


text:
Jan 30, 2004
PULLMAN, Wash. (AP) - Jeff Varem scored 17 points and Marcus Moore scored all 12 of his points in the final 11 minutes to lead Washington State past Arizona State 63-56 Thursday night.
The Cougars (9-9, 3-5 Pacific-10) snapped a three-game losing streak, and a four-game losing streak against Arizona State (8-9, 2-6).
Ike Diogu led Arizona State with 13 points and five rebounds. Diogu went 9-for-10 at the free-throw line, but made just 2 of 7 field-goal attempts. Shami Gill and Justin Bellegarde hounded Diogu on defense.
The Sun Devils led most of the first half but also committed 13 turnovers and had to score the last five points to lead 26-23 at the half. An early 8-0 run in the second half pushed WSU ahead to stay. Arizona State finished with both a season-low 56 points and a season-high 24 turnovers.
Washington State shot just 31 percent in the first half, but hit 52 percent in the second half and 40 percent for the game. Arizona State shot 44 percent.


text:
It is so exciting to have the first 6 ANCS Middle Campus gardening beds turned and ready for soil building!
Dear Families of Elementary and Middle Campuses:
The Atlanta Neighborhood Charter School Nutrition Program welcomes you to our blog. Beginning January 4, 2012, this blog will serve as a way to dispense information, answer questions, share ideas, offer suggestions, and to promote special events for school nutrition. While we have limitations due to limited kitchen access and our participation in the National School Lunch Program, we want serve our community better.
As part of our outreach effort, the school nutrition department would like you and your student(s) to complete the surveys found at the links below:
These questions will allow our staff to gain insight to the wants and needs of our families so that we might better serve you, your student, and the ANCS community as a whole.
Below are several new things that are coming:
– Fun celebrations at both campuses
Peculiar People Day – January 10, 2012 (Middle Campus)
National Popcorn Day – January 19, 2012 (Middle Campus)
Penguin Awareness Day – January 20, 2012 (Elementary Campus)
– Contest opportunities for students to earn new equipment for recess, PE, classroom, or advisory.
– Online payment and account viewing for families
If you have any questions, please contact your School Nutrition Directors:
Mrs. Kelly Dennis (Elem. Campus) 404-624-6226 ext. 204
Mrs. Maria Larson (Middle Campus) 678-904-0051 ext. 504


text:
13 Sep 14:41 2011
Scratching an itch: copy-array
Svante Carl v. Erichsen <Svante.v.Erichsen <at> web.de>
Hello! I should like to propose a drop-in replacement for copy-array: (defun copy-array (array &key (element-type (array-element-type array)) (fill-pointer (and (array-has-fill-pointer-p array) (fill-pointer array))) (adjustable (adjustable-array-p array))) "Returns an undisplaced copy of ARRAY, with same fill-pointer and adjustability (if any) as the original, unless overridden by the keyword arguments." (let* ((dimensions (array-dimensions array)) (new-array (make-array dimensions :element-type element-type :adjustable adjustable :fill-pointer fill-pointer))) (dotimes (i (array-total-size array)) (setf (row-major-aref new-array i) (row-major-aref array i))) new-array)) My reasons can be seen from the following tests: (deftest copy-array.3 (let* ((orig (vector 1 2 3)) (copy (copy-array orig))) (typep copy 'simple-array)) t) (deftest copy-array.4 (let ((orig (make-array 21 :adjustable t :fill-pointer 0))) (dotimes (n 42) (vector-push-extend n orig)) (let ((copy (copy-array orig :adjustable nil :fill-pointer nil))) (typep copy 'simple-array))) t) I believe that these tests should pass for compliance with the specification of the type simple-array: "The type of an array that is not displaced to another array, has no fill pointer, and is not expressly adjustable is a subtype of type simple-array." In other words: I find it quite astonishing if the copy of a simple-array is not a simple-array itself. I am grateful for comments and, should you find this acceptable, directions how to proceed. Best wishes Svante P.S.: You can also reach me as 'serichsen' on #lisp at freenode IRC. -- Svante Carl v. Erichsen Wentorfer Str. 96 21029 Hamburg +49-(0)40-34923721 +49-(0)160-6941474 Svante.v.Erichsen <at> web.de


text:
Professional Staff Association
As an employee group, PVCC PSA is typically our students' first point of contact. We have the privilege to assist them from their first day on campus, until the completion of their unique pursuit: i.e. graduation, certificate, one class etc.
Let this be our common goal that we continue to work together and grow strong as a unit for the common good of our students, as well as ourselves.
Please join us and participate in the various PSA activities, share ideas and visions for a stronger voice for our campus, district and community.
We are looking forward to a year of growth and changes, receiving your comments, opinions and suggestions to improve PSA. The ratification of a common policy manual shared among all of Maricopa's employee groups (PSA, MAT, Crafts, M&O, and Public Safety) is underway. Proposed new policy language covers hiring, dispute resolution (policy and non policy disputes) and corrective actions.
District PSA
We're excited you are visiting this page. After taking a look here, visit the District PSA web page for information on items important to you like…


text:
Price: $159.00
Our luxurious bedcover is woven using the same technique as Mayan huipil blouses. Mayan women traditionally use a back-strap loom to weave textiles for their familiesblankets and bedcovers, blouses and skirts. They sit outdoors with one end of the loom attached to a tree branch and the other around their hips as they kneel and rock to the movement of the shuttle raveling thread across the weft of the fabric.
The cotton bedcover consists of several backstrap-loom woven panels that are finished with extraordinary blocks of brocade at the head and foot. Each panel is woven separately, then decoratively hand-stitched to its neighbor in contrasting thread colors.
The handcrafted nature of the materials ensures that no two pieces are exactly identical.
100% cotton. Handmade in Zacualpa, Guatemala. Dry clean, or wash in cold water and line dry.
Queen: 90"W x 104 3/4"LKing: 108"W x 104 3/4"L
Maya mythology says that the sun and moon goddess Ixchel (pronounced Ik-shell) gave the gift of weaving to the Maya. She is the benefactor of weavers as well as of pregnant women, and her ancient craft is still central to women's lives throughout Guatemala. Garments are especially important, as their colorful patterns show off not only the weaver's skill, but also let others know what village she is from. This tradition was started by Spanish officials to aid tax collection, and was a form of identification during recent civil wars, but many indigenous women wear their village's pattern as a matter of local pride.
Many Mayan women sell their old woven garments in the weeks leading up to the patron saint day of their village to finance the purchase of a new huipil or corte for the fiesta. Finding a new use for these handcrafted fabrics not only allows their beauty to be appreciated by new audiences, but also helps extend the market for this ancient skill and creates jobs in rural villages.
This luxurious 100% cotton bedcover was developed from the traditional huipils or blouses of Mayan women from the mountainous village of Zacualpa. The women of Zacualpa wear some of the brightest huipils in the western highlands, with a vivid purple yoke and red body with green and white stripes, although our bedcover is primarily rich earth tones.


text:
Summit Speaker: Jack Peurach
Jack Peurach
Executive Vice President, Research and Development
SunPower Corporation
Jack Peurach serves as SunPower's executive vice president, research and development where he is responsible for all aspects of SunPower's PV cell, module, and systems research and product development. Previously, Peurach led the research and development efforts for SunPower's PV Systems, PV Modules, and Advanced Product Development groups. Prior to the company's acquisition of PowerLight, Peurach was PowerLight's vice president, product development, where he drove systems product strategy and development for product execution and management, and built a pipeline for a number of new products. Earlier in his career, he was a strategy consultant for Mercer Management Consulting and director of engineering at Berkeley Process Control, Inc. Peurach holds a bachelor of science degree in mechanical engineering from Michigan State University, a master of science degree in mechanical engineering from the University of California, Berkeley, and a master of business administration, finance and entrepreneurship from the Wharton School, University of Pennsylvania.


text:
story campaign and galactic conquest
View Single Post
Commander, Rogue Squadron
Join Date
: Jul 2002
: Ithaca, NY
: 2,320
story campaign and galactic conquest
I was just reading in the
latest preview
about how the expansion will feature a more developed story campaign and a bit of de-emphasis on "sandbox" galactic conquest mode. I think this is interesting; as a Blizzard fan I always love it when a good story is built into a RTS game. However, it occurs to me after playing several GC's and reading that tidbit that I think the game would be a lot more immersive if the galactic conquest scenarios incorporated some amount of randomly-occurring "story missions" as well. Especially if the Rebels send a raid fleet or one or more heroes is present in the battle, you would not expect the same battle for control of the planet to take place as if each side just had an army at their disposal! I think that a neat way to implement this would be to add in "side quests" like in WarCraft III that are triggered only in particular circumstances. For instance, if Rebel Infiltrators go on a raid mission to occupied Alderaan, they might be asked to recapture some Rebel political prisoners and the player would have the option of doing that instead of attacking the Empire directly. Similarly, if Darth Vader landed alone on Dagobah and Yoda was hiding there, I'd expect some sort of serious Force battle to take place, not just a half a lightsaber duel and then each hero retreating to their bacta tanks.
This kind of idea might be more meaningful if there was some mechanism for capturing enemy heroes. I'd propose a simple mechanism for this: if one hero kills another hero, the second hero is considered "captured" and unavailable for use until his comrades either kill the capturing hero or force him to retreat in battle. For example, if Vader kills Han, then Han is considered "captured" and the Rebel player doesn't get to use him again until they either kill Vader (releasing Han and starting Vader's recharge timer) or engage Vader in battle and Vader retreats. Now imagine if Luke were to land on Vader's planet with an army while Han was in custody: it would be cool for the battle for that planet to have a different slant than a usual conquest battle: "recapture Solo!" rather than "take the planet!"
I'm all for more random events happening in GC games, but I'd love a little more tie-in between the galactic map and the tactical maps. This is just one way I thought of to do it. Anyone have any thoughts?
you may:
View Public Profile
Visit wedge2211's homepage!
Find More Posts by wedge2211


text:
It is always a nervous moment for industry professionals when a food or wine journalist comes to your restaurant. What menu would a Chef prepare so he or she will have the full experience of your place? What wine would a Sommelier pair to add a touch on Chef's masterpiece?
On the day when the journalist Mr. Scott Bridges visited Crustacean Beverly Hills, the team presented a wonderful creation of modern fusion involving the latest culinary trend nuance in the each course. (to read his actual article: Click Here)
Sashimi Tapas - Tuna taco, Ocean Roll, Hamachi Sashimi, Seared Tuna
2011 Schloss Vollrads Riesling Spatlese, Rheingau, Germany
This one-bite-each tapas is a fusion of the flavors of Vietnam, Japan, and Mexico, very sensitive yet the sauces are inspired by the bright tropical citrus which gives the refreshing sensation on the palate. The wine provides a 'harmony pairing' that follows the flavor of the dish.
Turkey Meatball & New Zealand Green Lip Mussels Broiled with Asian Pesto
2011 Domaines Schlumberger Gewurztraminer Les Princes Abbes, Alsace, France
The second dish is a flavorful one with more Mediterranean influence. The meatball is on the lighter side so it will not compete with the Mussels broiled with the secret pesto sauce. The wine, on the other hand, provides 'contrast pairing' which gives the opposite flavor with honey spice, shifting the flavor to hint an Asian breeze.
Ginger Chicken Ravioli with Porcini Mushroom Sauce
2012 Château Mercian Koshu Kiiroka, Yamanashi, Japan
This third course is a great example of Euro-Asia modernism. The sauce is made in a very elegant texture and the herbs offer a minty refreshing finish. To pair with this complex dish, Sommelier team decided to go for a super unique Japanese wine made with Koshu grape. This is a white grape variety often described as the mix of Viognier and Pinot Grigio, aromatic yet the mountain minerals give crisp and clean finish.
Charbroiled Colossal Royal Tiger Prawn with The Signature Garlic Noodle
An's Famous Roasted Crab Out of Shell Ichishima
Silk Deluxe Junmai Sake, Niigata, Japan
These two dishes are what the restaurant is known for. The 'crustaceans' prepared with the Master Chef's secret sauce have been the love of Beverly Hills foodies. To pair with the layered complexity with the touch of garlic, Sake Sommelier selected a quality sake that has a tinge of sweetness. The sake pairs well with seafood and especially the mild and silky texture rounds the finish of the dish's structured flavors.
Wagyu Steak with Herbal Secret Sauce with the side of Mushed Potato and Smoked Shiitake Mushrooms
2011 Byron Pinot Noir Julia's Vineyard, Santa Maria Valley, California, USA
This Wagyu plate was created to celebrate the Centennial Anniversary of the City of Beverly Hills. Rich in 'umami' flavor so the team decided to pair with the quality local Pinot Noir with great mineral and body.
Swiss Chard, Baby Bok Choy, Kale, Goji Berry Sautéed with Garlic and Herbs, served with Brown Rice
2009 Mas Doix Priorat Salanques, Catalunya, Spain
Last dish is the Chef's new addition to the menu, with a focus on the cutting edge health trend such as Kale and Goji berry. Brown rice adds the greens some earthly touch. Therefore, the Spanish Grenache-based red with berry taste and earth tone creates a great harmony.
Vietnamese Banana Fritter a la Mode
2007 R.A. Harrison Family Cellars Nobility Late Harvest, Napa Valley, California, USA
This dessert is a traditional Vietnam sweet, complemented by the hand-made vanilla ice-cream with actual vanilla bean chips. Sommelier's choice to pair with this dessert was the Sauternes style dessert wine from Napa. The wine has brioche, almost banana-like depth aroma with dried apricot flavor, and this provides an additional dimension.
Master Chef: Helen An
Sommelier Team: Fabrizio Nocilla, Alice Hama
(The original article was published in Japanese on Nikkan San Newspaper wine article series "Alice in WINEderland Vol.55)


text:
Personal Software Purchasing Instructions
Would you like to buy a copy of Office through the University and pay a lot less than you would at the stores? How about SPSS or some other program vital to your major? We can help with that! TWU has partnered with E-Academy OnTheHub, who offers discounted software prices to our students, faculty and staff. To buy from them, you have to create an account using your TWU email address (thats how they know you are with TWU). Heres how it all works:
1. Click this link to access the E-Academy software store:
Purchase Software
2. Login to the site (click the Sign In link in the upper-right), or
create your account as follows:
- Click the Sign In link on any page and then click the Register button.
Choose I have an institution issued email address and click Continue. Enter your email address and click Continue.
Enter your name, create a strong password, specify which group you are in, and then click the Register button. E-Academy will send a confirmation email to you containing a link that you must click on. When received, click the link and your account is now active and verified, so you may now sign in. If you dont receive the confirmation email within 5 minutes, go back to the registration screen and click the Resend Confirmation Email button.
3. There are 2 tabs: one for Students and one for Faculty/Staff.
Click the one that applies to you.
4. There are 2 tabs: one for Students and one for Faculty/Staff.
Click the one that applies to you.
5. Once you have selected the software you want to purchase,
you will click on Shopping Cart in the upper-right of any page.
6. During checkout, you will need to choose the "delivery" option
during checkout-some software can be downloaded, while
some can be mailed to you on a DVD. It is important to keep
the software in case you everneed to reinstall it in the future.
7. If you are asked to choose a 32-bit or 64-bit version of a
program, here is how to tell which one your computer needs:
- Windows: How to Tell
- Apple/Mac: see this Apple article
8. Once you have paid, look for any Product Keys or Serial
Numbers on the screen. These are the most important
thing you just bought; without these, the software cannot
be activated or used. Print these, then copy them and email
them to yourself.
9. Install the software using the instructions provided with the
page updated 5/9/2016 4:53 PM


text:
Lois Dodd papers, 1945-2013
Dodd, Lois, b. 1927
Painter, Arts administrator, Art teacher
Active in New York, N.Y.
Collection size: 6.8 linear feet
Collection Summary: The papers of New York City painter, educator, gallery owner, and activist Lois Dodd date from 1949 to 2001 and measure 1.8 linear feet. The papers focus on Dodd's personal work and contain little documentation of her involvement with Tanager Gallery. Found are biographical materials, including an interview conducted by Pat Mainardi in 1973; personal business records; professional correspondence; project and teaching files for Artist Housing Projects and various teaching positions; scattered writings and notes; printed materials including exhibition catalogs and announcements; and photographs.
Biographical/Historical Note: Lois Dodd (1927- ) is a painter and art instructor from New York, N.Y. Founding member of the Tanager Gallery, New York City and served as chairperson and Board member of the Skowhegan School of Painting and Sculpture.
Lois Dodd donated her papers to the Archives of American Art in several increments between 1981-2007 and in 2014-2015.
Funding for the processing of this collection was provided by the Terra Foundation for American Art
How to Use this Collection
- Read the Finding Aid for this collection
- Use of original papers requires an appointment and is limited to the Archives' Washington, D.C., Research Center. Contact Reference Services for more information.
- For more information on using the Archives' resources, see the FAQ or Ask Us.


text:
A Redmond, OR, witness reported a silent, round, low flying object with red flashing lights moved across town about 5:30 a.m., January 30, 2014, according to testimony in Case 53805 from the Mutual UFO Network (MUFON) witness reporting database.
I was driving in my car heading back home and seen a strange object in the sky," the witness stated. "It made no noise and was completely silent. The object was round and had red flashing lights on it."
Unidentified low flying objects have been reported recently in other parts of the country, including the following reports covered here from four other states:
- Triangle UFO reported dipping below tree line in Michigan town
- Low flying orange UFO made U-turn while Arkansas witness watched
- UFO reports wanted: Washington witnesses say disc-shaped craft too big to miss
- Low flying orb UFO observed hovering before darting away over California town
No other information was available. No images or videos were included with the report. Redmond is in Deschutes County, OR, population 26,215. Oregon is a current UFO ALERT 5 rating, with a low number of UFO sightings nationally. Oregon had 7 reports in December 2013 - while California had 68 reports - the highest reporting state in the nation.
You can read more details about other recently reported cases at the UFO Examiner home page.
The above quotes were edited for clarity. Please keep in mind that most UFO reports can be explained as something natural or man-made. If Oregon MUFON investigates and reports back on this case, I will release an update. Please report UFO activity to MUFON.com.


text:
BigOven Pro required (try it free)
Notice a categorization error? Let us know by clicking [alert editor] on the recipe page, in the ingredients box.
Asian Sesame Salad with Seared Ahi Tuna
tsuyu-fried tilapia
Singapore Noodles
Purple Haze Veggie Paradise
Sweet and Sour
One-pot Chicken Pasta
Asian Stir Fry THM FP
Rib wraps
Stir Fry Beef
Quick Szechuan Stir-Fry
You've found more than 100 recipes and added them to your Favorites and Try Soons! Glad you've found some great ideas.
Want to better organize them? With BigOven Pro, you can create folders by occasion, people
you're cooking for, and much more. It saves you time.
BigOven Pro is just $1.99/mo and removes all ads on the BigOven website and mobile apps. Try BigOven Pro free!


text:
Top Definition
A female (or homosexual male) who is dating a man with far less than average penis size.
Your Noodle Humper girlfriend looks really deprived lately. Perhaps you are not pleasing her enough sexually.
av ?M冿 9. mai 2005
Alle eposter sendes fra email@example.com. Vi lover å ikke spamme.×


text:
Black River Schools officials are hoping for the best, but are preparing for the worst.
If the district's 8.7-mill, five-year additional levy on today's ballot is defeated, voters can expect to see another levy in August.
The school board voted last month to place the levy on the Aug. 7 special election ballot as a backup plan.
Wednesday is the deadline for filing for the August special election.
Black River school board President Janet Eichel said she was cautiously optimistic that voters would approve the levy today.
"I think we have a chance," she said. "I sure hope we do."
Voters haven't approved a levy providing additional money for Black River Schools since 1997.
The Black River levy will cost the owner of a $100,000 home an additional $266.44 a year and bring in $1.6 million a year in operating funds for the district, which the state placed on a "fiscal caution" list in 2011 because of its strained finances.
The Black River levy is one of only two school issues on today's ballot.
The other is a 7.9-mill, 10-year additional levy for Cloverleaf Schools. That levy would bring in $3.7 million a year for 10 years and would cost the owner of a $100,000 home an additional $248 a year.
Cloverleaf school officials have indicated they also would try for a levy in August if today's attempt fails.
Two other school levies — for Medina and Brunswick — were withdrawn from the ballot.
The Medina school board said it pulled the levy because it had lost hope of passage because of controversy surrounding Superintendent Randy Stepp's contract.
Brunswick officials said they decided to wait until they knew how much money the district would get in the new state budget before trying for a levy.
As a result of the levy withdrawals, today's election will be the smallest spring election in at least a dozen years.
Only 41 of the county's 117 precincts will be voting. The precincts include only about 41,000 registered voters — less than a third of the county's more than 125,000 registered voters.
Three other issues will be decided:
— Montville Township wants a 1.3-mill, five-year renewal levy for fire protection.
— n Chippewa Lake is asking for a 6-mill, five-year replacement levy for operating expenses.
— n Voters in Homer Township will vote on a 3.3-mill, permanent replacement levy for the Town and Country Fire District, which is headquartered in Wayne County.
There are only two contested races today — both for Wadsworth City Council.
Four Republicans — Joseph A. Rodgers, Bob L. Thurber, Robert D. Titus and David L. Williams — are vying for three at-large nominations.
In another Republican face-off, in Ward 1, Ralph J. Copley is challenging incumbent Councilman Timothy J. Eberling.
Carol Lawler, director of the Medina County Board of Elections, said 603 voters cast early ballots for today's election.
Lawler declined to predict a voter turnout.
"I don't know what to expect," she said.
Contact reporter Kiera Manion-Fischer at (330) 721-4049 or firstname.lastname@example.com.


text:
"The introductory exercises were by Rev. Dr. Welsh and Rev. Mr. Hodge. Address by Rev. Dr. Dowling, Ceremony of laying the stone, with the benediction, by the pastor.
"The address was one of the happiest efforts of the author, particularly Baptistical and orthodox. While the speaker disclaimed any New Testament injunction or precept for the customary ceremony in laying the corner stone of a church edifice, he nevertheless most happily showed the appropriateness of such a service, and satisfied his hearers that in its observance on the present occasion neither himself nor the church and society engaged in the enterprise could be charged with 'going toward Rome.' "
Of course not. Every beast must have his day. The first has had his, and now the second must reign. Therefore, instead of your 'going toward Rome,' she must come towards you, and present you with the image. See 13th chapter of Revelation.
The description of the exercises, from the Recorder, thus continues:
"The history of the Baptists and their connection with the development and progress of religious liberty in England and our own country, was briefly but most happily set forth. It was on the whole one of the most interesting ceremonies of this nature, we were ever privileged to enjoy. The leaden box, closely sealed and put in the corner stone, contained, among other matters, the following: A Bible, bearing the imprint of the American and Foreign Bible Society; Brooklyn City Directory; New York Recorder, Watchman and Reflector, and other denominational papers; Annual Reports of denominational Societies; a quantity of American coin, &c.
"The prospects of the young church and society are encouraging. They have a subscription of twenty thousand dollars raised among themselves, with expectations of a still farther increase from the vicinity in which their house is located, of which it is to be an ornament. The church was constituted in March, 1849, with but sixty— six members; it now numbers one hundred and ninety— three. They built their present chapel at an expense of about ten thousand dollars, and supposed it would be ample in its accommodations for four or five years. The increase of the church and congregation has so far exceeded their expectations as to render it necessary to enlarge immediately the place of their habitation. Their contracts require the house to be ready for occupancy by the first of April next.
"The building, with a spire of about two hundred feet, is to be of solid stone work. A description of the design of the building will be hereafter given."
Now why, we ask in all candor, was this 'quantity of American coin' hid in a 'leaden box' from all practical use, while those who did it profess to believe it might have been instrumental in saving souls from eternal death? Which are we to believe, their words or their acts?
Again, they had twenty thousand dollars subscribed, to which they expected a farther increase, for building a new chapel, with a spire of two hundred feet. Why all this extravagance to make their chapel an 'ornament to the vicinity?' If this people believed what they pretend to believe, would it not be more consoling to their hearts and consciences to worship in a house less costly, and with the balance of the money save a portion of the heathen from endless woe, than to gratify their pride and vanity by an ostentatious display? Surely, they could have curtailed a little for the benefit of the poor heathen, even if it had been only ten feet of the spire. That would have left one hundred and ninety feet, which, if not so 'ornamental,' certainly would have been ample for a Baptist church.
We shall now conclude this part of the subject with an extract from a letter written by Rev. Joseph Kennard, to the New York Recorder, showing the spirit and manner of raising funds for these purposes, viz:
"I suppose you have accounts of the progress of mission feeling among our churches. I have been a pastor many years in Philadelphia, but I have never before witnessed anything to equal what we have seen in the last two weeks. The spirit of God seems to be poured out from on high. The meeting of last Wednesday evening was with my people, and to my grateful astonishment resulted in securing twenty— six life— memberships, in the midst of a special effort to pay a heavy debt on our meeting house. As a friend of Missions you will rejoice in this result. The same spirit is manifested in all the churches in this city."
We must now conclude this chapter on Missions. We have designedly travelled over a wide field, for the purpose of showing the outline of missionary character. But we must inform the reader, that we have mainly kept on the outskirts. We have not attempted to enter the deep, dark, mysterious ocean of iniquity, which has been practiced by priestcraft among "the great and particularly civilized nations of the earth." As the grand objects of missions is to evangelize the world and to advance the Redeemer's kingdom, we will conclude this chapter with a few extracts, showing the result of all their efforts. Lest we might be considered unfair in our selections, we have given extracts relative to the state of morals in Boston and New York City, the great headquarters of missionism.
The Boston Christian Observer, of October 24, 1851, in a leading editorial, after alluding to the recent murders in that city, says:
"Other vices are by no means confined to our foreign population, as we have continual occasion to know. We must, then, come to the conclusion that the morals of our city, taking its population, with their origin, numbers, &c, into the account, is alarmingly low. If we were disposed to dwell upon the vice of licentiousness alone, and give the proofs which are at hand of its existence in high places, as well as low, and especially among heads of families, of both sexes, the same conclusion would be reached."
The New York Recorder comments on the above as follows, viz:
"Such a statement as this, and particularly that portion of it which I have black faced, call for the instant and serious consideration of every true friend of his country. For what is alleged of the morals of Boston, it is to be feared is also applicable to our own city; indeed, to the country at large."
The foregoing extracts are the admissions of missionary papers. If our limits and inclination permitted, we could select hundreds of extracts, from the religious and political press, showing a worse picture of affairs than is exhibited above.
We shall now close this chapter with an extract from the Sunday Times, being a reply of the late Major Noah, a learned Israelite, to a question propounded, relative to the second coming of Christ, viz:
"He would, we think, be less welcome to the Christians than to the Jews. He could not, we think, recognize reformed religion which is carried out in his name. He who preached against pride, ostentation and arrogance —who was the friend of the poor, and rebuked the rich and worldly— minded—who preached peace on earth and good will to men—who ordained obedience to the laws and submission to rulers—would not brook the desecration of the Christian pulpit, occupied by some men who endeavor to stir up rebellion and division among the people—who falsely quote the scriptures to carry out their fanaticism—who openly defy the laws, and wickedly commend opposition to them—who are sowing division and misery throughout the land. He would say, 'I had trouble with the Scribes and Pharisees, who were my own people—they did not recognize my mission; but here are my followers—as they represent themselves to be—who ought, in my name, to carry out my principles, but do not—who consider that there are many of my orders, directions, and doctrines which they cannot carry out, alleging that they do not conform to the spirit of the age! !' He would find his own people as he left them two thousand years ago—with one faith and one God; but the modern church he would find divided into numerous sects, one arrayed against the other—preaching all kinds of doctrines— and understanding better what he meant to establish than he did himself. The question is not, 'How could the Jews receive him?' but, 'How would he be received by those professing to be Christians?"
The Primitive or Old School Baptists cling to the doctrines and practices held by Baptist Churches throughout America at the close of the Revolutionary War. This site is dedicated to providing access to our rich heritage, with both historic and contemporary writings.


text:
Fitness business will collect toys
Published: Tuesday, December 11, 2012 at 11:14 a.m.
Last Modified: Tuesday, December 11, 2012 at 11:14 a.m.
Fitness A to Z will host a 90-Minute Zumba Class to collect items for the Toys for Tots of Davidson County at 9 a.m. Saturday.
Admission to class is a new, unwrapped toy.
Fitness A to Z is located in the Welcome Shopping Plaza, 6483 Old U.S. Highway 52, Suite 1B.
For more information, visit www.fitatoz.com or call Amalia at 306-8081.
Reader comments posted to this article may be published in our print edition. All rights reserved. This copyrighted material may not be re-published without permission. Links are encouraged.


text:
Ultrasurf is free, proxy-based 'anti censorship', 'pro-privacy' software. It tunnels through firewalls (whether at work or country-wide), encrypts online communications, hides your real IP from the websites that you are visiting, automatically deletes your browser history, and provides you with a US-based location so that you can access geographically restricted websites such as Hulu or →
View your favorite web sites in a 'virtual newspaper' style with Surfboard
Surfboard is a free website that takes your web viewing experience in new directions by giving you a more visual interface. By allowing you to view the web dynamically, Surfboard will bring more data to your personal off-ramp of the information superhighway, faster and easier. When the internet was taking its first toddler steps toward →
Create beautiful carousel slideshows with WOW Slider Free edition
WOW Slider is a free program that makes sliders or carousels for your non-commercial website. It features multiple templates, a simple point and click interface, and even a WordPress plugin. Available for Windows and for Mac, WOW Slider is one of the best ways to create great visuals for your personal web pages at no →
Monitor and restrict your child's activities online, remotely, with Care4teen
Care4Teen is a free internet monitoring and censoring program that combines some principles of anti-virus recognition software with the standard online monitoring functions. Still in early stages, Care4Teen shows promise as a great bit of freeware in the future. When I consider what program to use to protect my children online, I take a hard →
Learn coding and programming for free while having fun with Code Year
Code Year is a free web site that will teach you the basics and even some advanced techniques for writing program code, or "coding" as it is called. Code Year offers you basic lessons, skill increasing exercises, and a load of fun while learning, all at no cost. The only thing you need is a →
Open multiple websites using a single URL with Krunch.us
With Krunch, you can create custom URLs that will open multiple web sites. For example, you can use a Krunch URL that might look like 'Krunch.Us/freeware' to open all of your favorite freeware sites. Krunch.us can serve as a creative alternative bookmarking tool. You could use your own custom URLs to distribute collections of sites →
Test drive GhostEdit, a new standalone WYSIWYG rich text editor, before it goes public
GhostEdit is a brand new WYSIWYG editor focused on usability. Currently in private Beta, it will support most popular browsers like Chrome and Safari, Firefox and IE. GhostEdit features some familiar editing tools, as well as context sensitive buttons for the various controls. What is a WYSIWYG editor and why would you need one? WYSIWYG →
Build, customize and maintain your web site with Berta: a free, open-source CMS loaded with options
Berta is a great, open source web building application, also called a CMS (Content Management System). It costs nothing, is loaded with features and options, and is very user friendly. The pages you build with Berta can be used on pretty much any domain, and unlike some other 'free' CMS apps, they do not require →


text:
Happy Camp Complex
The Happy Camp Complex of fires in a remote area of northwestern California continued to chew up additional acres on Saturday, though at a somewhat slower rate than the previous two days. Now mapped at 62,626 acres, a 24-hour increase of 4,904 acres, it has reached Highway 96 near the small community of Seiad Valley. Several areas are under a mandatory evacuation order affecting 250 homes, and approximately 695 homes are threatened. The fire is being fought by 2,116 personnel, 52 crews, 137 engines, 19 helicopters and 18 dozers. The incident management team is calling it 15 percent contained.
The fire is burning in an area infamous for inversions that trap wildfire smoke, at times making it difficult for firefighting aircraft to fly, and firefighters and residents to breathe.
More information about the Happy Camp Complex of fires.
Uncredited photos on InciWeb
It is unfortunate that we don't know who took the excellent photo posted above. Public Information personnel posting photos on InciWeb REALLY need to provide at least four pieces of information about each photo: 1) photographer's name, 2) date taken, 3) location, and 4) a description.
Dust from wildfire causes traffic problems
Dust being blown off a recent wildfire close to Interstate 90 near Vantage, Washington resulted in a 20-mile stretch of the highway being closed on Thursday and Friday.
Fifteen cars and nine tractor-trailers collided in the area on Thursday, leaving nearly a dozen people injured and causing a pileup that snarled traffic on the main route across Washington state, authorities said. According to Trooper Darren Wright, it's not yet known how the pileup started.
A third DC-10 joins the fleet
A third DC-10 jumbo jet has been converted into an air tanker. 10 Tanker Air Carrier announced Saturday that Tanker 912 has been fully certified and has joined the other two DC-10s temporarily based at Castle Airport near Merced, California.
Report released on CL-415 accident
A report has been released on the CL-415 air tanker accident that occurred on Moosehead Lake in Newfoundland and Labrador July 3, 2013. Details are at Fire Aviation.


text:
Fun in the Sun: Entertain in Style9 photos
Key pieces that will get your garden party-ready for outdoor entertaining.
Made in the Shade
Shade your quests from the hot sun with a chic umbrella that adds visual interest. This bad boy can weather the elements as it's water and fade resistant. Portofino Umbrella at zgallerie.com.
By: Kyle Troutman via Kyle Troutman in Outdoor Entertaining (Original Photo)


text:
Notable Purchases:
- Larry Feinberg, founder of Oracle Investment Management and co-owner of in vitro diagnostics company Accelerate Diagnostics (NASDAQ:AXDX), bought 297,618 shares of company stock for $4,999,983.
- China Pioneer Pharma Holdings (HKG:1345), a marketing, promotion, and channel management service provider of imported pharmaceutical products and medical devices and a partner with clinical-stage biopharmaceutical company NovaBay Pharmaceuticals (NYSEMKT:NBY), bought 500,000 shares of company stock for $495,000.
- Benjamin D. Chereskin, an investment professional on the board of directors for US food company Boulder Brands (NASDAQ:BDBD), bought 25,000 shares of company stock for $334,250.
- David W. Williams, chairman of the board and president of Noble Corp. (NYSE:NE), a major contract driller of oil and natural gas wells, bought 10,000 shares of company stock for $306,400.


text:
Honestly I hate to see it go out of the driveway but have lots of projects to do over the Winter to spruce it up on the inside which require a sewing machine so I should be able to keep myself busy! We could keep it here in the drive but when we purchased it storage for the winter was part of the deal so we might as well take advantage of it this year!
We have no plans to go away any place warm this winter so not having it is ok!
We plan to take it over at some point today to the dealer but first I need to get some bounce fabric sheets and make sure that there are no places underneath that rodents can get in and plug them up if we find any with steel wool!
I told the Hub the other day that now we have this unit we need to make sure we take good care of it mechanically etc so we do not run into problems down the road due to lack of care!
Any how counting the days till it comes back to the house we finish the work on it we would like to do and head down the open road again and enjoy our time in it. That cannot come fast enough!
Views: 15


text:
Talk:Roar of Time (move)
Return to "Roar of Time (move)" page.
We should include a GIF of it in action because it is cool.--arceus fan 22:34, 9 October 2007 (UTC)
- It's hard enough to get a screenshot of D/P. Getting a GIF of one is even harder. Just because it's "cool", doesn't mean we need it >__>; TinaTheKirlia ♥ 22:35, 9 October 2007 (UTC)


text:
Letters to the Editor
We, the U.S.A., have reached a cultural and economic tipping point, the recent school shooting in Newtown, Conn., the recent killing of Christ Stevens, ambassador in Libya, the refusal of our former Secretary of State to take full and unconditional responsibility for insufficient security at many U.S. diplomatic residences and embassies around the world.
For access to this article please sign in or subscribe.
Plus the display of absolute dysfunction within the legislative branch of our government, which the whole world can easily see. And our dysfunctional national government has not shown any interest in starting to arrest our descent into the...