A new simulation-optimization methodology is developed for cost-effective sampling network design associated with long-term monitoring of large-scale contaminant plumes. The new methodology is similar in concept to the one presented by Reed et al. (Reed, P.M., Minsker, B.S., Valocchi, A.J., 2000a. Cost-effective long-term groundwater monitoring design using a genetic algorithm and global mass i...

Moment invariants have been widely introduced in recognizing planar objects for a few decades. This is due the robustness of moment function in distinguishing the original identity of object under various two Dimensional (2D) transformations. A set of moments computed from a planar images, represents the global description of an object’s shape and geometrical features of an image. Since global ...

This article proposes a novel moment-based local cluster division optimization method in wireless sensor networks, and improves the energy efficiency of local cluster area with uneven nodes distribution. In the proposed method, first, each node estimates the higher moment of local sensors’ coordinates. Second, the current cluster zone is divided into four quadrant zones with cluster head’s (CH)...

We hypothesise that all electroweak symmetry breaking terms such as fermion masses and the W and Z gauge boson masses arise radiatively from just one explicit symmetry breaking term in the Lagrangian. Our hypothesis is motivated by the lack of experimental support and the lack of predictivity of the standard symmetry breaking scenario. We construct a simple model which illustrates our ideas. We...

Distributionally robust stochastic optimization (DRSO) is a framework for decision-making problems under certainty, which finds solutions that perform well for a chosen set of probability distributions. Many different approaches for specifying a set of distributions have been proposed. The choice matters, because it affects the results, and the relative performance of different choices depend o...

A k-edge-weighting of G is a mapping ω:E(G)⟶{1,…,k}. The edge-weighting naturally induces vertex-colouring σω:V(G)⟶N given by σω(v)=∑u∈NG(v)ω(vu) for every v∈V(G). ω neighbour sum distinguishing if it yields proper σω, i.e., σω(u)≠σω(v) edge uv G. We investigate with local constraints, namely, we assume that the set edges incident to vertex large degree not monochromatic. graph nice has no comp...