The incoherent state of the Kuramoto model has a uniform conditional phase density, $\rho (\theta \mid \omega )=1/(2\pi )$, in the continuum population description. Its Kuramoto order parameter vanishes because ${\int }_0^{2\pi }{e}^{i\theta }d\theta =0$: individual phases cancel even though the oscillators keep moving.

The mean-field coupling then vanishes, so a uniform density remains uniform while each frequency class rotates. This state must be retained separately when deriving a self-consistency equation by dividing by a nonzero order parameter. A finite random sample generally has a small nonzero empirical order parameter; this fluctuation is not a contradiction of the continuum definition.^[ref]

The positive closure of a formal language $L$ is the language of all concatenations of one or more words from $L$:Here $L^n$ is $n$-fold concatenation of formal languages, while the Kleene star also permits $n=0$, whose contribution is the empty word $\epsilon$. Thus $L^{\ast }=L^{+}\cup \{\epsilon \}$.

For $L=\{ab\}$, positive closure is $\{ab,abab,ababab,\dots \}$. If $\epsilon \in L$, then $\epsilon \in L^{+}$ as well: positive counts chosen words, not their total character length. For the empty language, ${\varnothing }^{+}=\varnothing$ but ${\varnothing }^{\ast }=\{\epsilon \}$. This operation preserves regular languages and is one of the closure requirements in an abstract family of languages.

Two points of a filled simple polygon $P$, including its boundary, are mutually visible when their joining closed line segment lies entirely in $P$. The visible region from $p$ is $\{q\in P:[p,q]\subseteq P\}$. A segment crossing even a small exterior gap breaks visibility.

Every pair of points in a convex polygon is visible by the definition of convexity. In a nonconvex polygon, an inward corner can block a segment although both endpoints lie inside. A point sees the whole polygon precisely when it belongs to the kernel of a polygon. Thus a nonempty kernel permits one stationary point observer to see the entire filled region.

Visibility depends on the filled-region and boundary convention, rather than only on graph adjacency between polygon vertices. It is used in geometric path planning and coverage, where the whole intervening segment must be checked for obstruction.

A local-search perturbation deliberately changes the current solution before local search resumes. In iterated local search, the perturbation and improvement form a composite step: $s\mapsto \mathcal{L}(P(s))$, where $P$ changes the candidate and $\mathcal{L}$ applies the chosen local improvement procedure. The perturbation need not improve the objective function; a later iterated local search acceptance rule decides which improved candidate becomes current.^[ref]

A fully specified example shows why a weak perturbation can be ineffective. Let feasible solutions be the integers $0$ through $5$, with neighbors differing by one, and costsUse strictly improving, best-neighbor local search. Starting at5 is locally optimal: its only neighbor4 has cost3, above the current cost1. A one-step kick to4 is immediately undone by local improvement, which returns to5.

A different kick from5 to2 temporarily raises the cost to4, but the subsequent improving path is $2\to 1\to 0$, with costs $4\to 2\to 0$. The resulting candidate beats the old stopping point. These values are an original constructed example; they show how changing the perturbation can change which solution the same local search reaches.

Perturbation strength therefore concerns more than accepting a single worse local move. Too little change may repeatedly return to the same solution, while a nearly independent redraw can discard useful structure from the current candidate. Feasibility must also be handled explicitly: either the perturbation stays within the feasible set or the method specifies how an infeasible intermediate is repaired. Problem-specific moves and acceptance decisions must be evaluated together.^[ref]

An iterated local search acceptance rule chooses the next current solution after a perturbation has been followed by local search. Let the current locally improved solution be $s$ and the new locally improved candidate be $q$, with a minimized objective function $f$. The decision concerns these search states, not just the potentially poor intermediate output of the local-search perturbation.^[ref]

One rule accepts only improvement:The paper calls this policy Better. Its current costs cannot increase, which follows immediately from the two cases. That property does not establish that the search will reach a global minimum. The RW rule instead retains the latest candidate regardless of cost, allowing movement among locally improved solutions.^[ref]

For an original numerical comparison, suppose $f(s)=10$. A perturbation temporarily raises the cost to18, and subsequent local search lowers it to12. Better rejects the candidate with cost12, while RW accepts it; neither decision is made by comparing10 with the intermediate18. If the same procedure instead reaches cost8, both accept.

A simulated annealing-type option accepts a worse candidate with probability $\exp [-(f(q)-f(s))/T]$, with $T>0$. At cost difference2 and $T=2$, this probability is $e^{-1}\simeq 0.368$. The temperature is a parameter of the rule, not a guarantee that a particular finite run escapes every trap.^[ref]

A permissive current-state rule can retain a candidate worse than an earlier result. Keeping a separate best-so-far solution preserves that result while allowing exploration. Report both the current-state acceptance policy and the best-result bookkeeping when comparing search runs.

An angular isotropy test with planar irradiance measurements rotates a characterized receiver to test whether its readings agree with a specified model of an isotropic radiance field. A one-sided ideal cosine receiver measures $E(\mathbf{n})=\int L(\mathbf{\omega })\max (0,\mathbf{n}\cdot \mathbf{\omega })d\Omega$. Constant radiance gives the same $\pi L_0$ for every normal. Instrument angular response needs characterization; the primary guide describes experimental correction of cosine receptors.^[ref]

An original restricted-model example makes the inference quantitative. Assume a dipole anisotropy of a radiance field,Hemisphere integration gives $E(\mathbf{n})=\pi L_0[1+(2ϵ/3)\mathbf{a}\cdot \mathbf{n}]$. For $L_0=1\mathrm{W}{\mathrm{m}}^{-2}\mathrm{s}{\mathrm{r}}^{-1}$, $ϵ=0.30$ and $\mathbf{a}$ along the vertical axis, upward/downward-facing receivers give $1.2\pi$ and $0.8\pi \mathrm{W}{\mathrm{m}}^{-2}$. Their difference divided by their sum is $0.20$, implying $ϵ=0.30$ within this chosen model.

Use the same receiver position, background treatment and a stable source monitor while changing orientation. Gain drift or moving into a different spatial field can otherwise imitate an angular effect. A finite set of readings tests the assumed angular family; it does not prove unrestricted isotropy. The six-beam counterexample in isotropic radiance field shows why a few equal axis readings can miss other directional structure.