Datasets:

Asilarkness
/

DiffuRefill-facts

+{"text": "The hare‑wolf system is a classic example of a stochastic predator–prey interaction that can be described by a continuous‑time Markov chain on the state space \\(\\mathbb {N}^{2}\\).  A state is an ordered pair \\((h,w)\\) where \\(h\\in\\mathbb {N}\\) denotes the current number of hares and \\(w\\in\\mathbb {N}\\) denotes the current number of wolves; the pair \\((0,0)\\) is an absorbing state because with no individuals of either species the dynamics terminate.  The model is defined by three elementary events, each of which changes the state by a fixed vector and occurs with a rate that depends only on the present numbers of hares and wolves.\n\nFirst, hares reproduce autonomously.  If the system is in state \\((h,w)\\) with \\(h\\ge 1\\), a birth of a hare occurs at rate \\(\\alpha h\\), where \\(\\alpha>0\\) is the per‑hare reproduction constant.  The transition caused by this event is\n\\[\n(h,w)\\longrightarrow (h+1,w),\n\\]\nso the corresponding jump vector is \\((+1,0)\\).\n\nSecond, wolves die of natural causes.  When the system is in state \\((h,w)\\) with \\(w\\ge 1\\), a wolf death occurs at rate \\(\\beta w\\), where \\(\\beta>0\\) is the per‑wolf mortality constant.  The associated transition is\n\\[\n(h,w)\\longrightarrow (h,w-1),\n\\]\nwith jump vector \\((0,-1)\\).\n\nThird, predation couples the two populations.  A wolf catches a hare at rate \\(\\gamma h w\\), where \\(\\gamma>0\\) measures encounter efficiency.  The predation event simultaneously removes one hare and adds one wolf, reflecting the fact that a successful hunt provides the predator with enough nutrition to reproduce.  The transition is\n\\[\n(h,w)\\longrightarrow (h-1,w+1),\n\\]\nwith jump vector \\((-1,+1)\\).\n\nThese three rules completely specify the infinitesimal generator \\(Q\\) of the Markov chain: for any state \\((h,w)\\) and any admissible successor \\((h',w')\\),\n\\[\nQ\\bigl((h,w),(h',w')\\bigr)=\n\\begin{cases}\n\\alpha h, & (h',w')=(h+1,w),\\\\[4pt]\n\\beta w, & (h',w')=(h,w-1),\\\\[4pt]\n\\gamma h w, & (h',w')=(h-1,w+1),\\\\[4pt]\n-\\bigl(\\alpha h+\\beta w+\\gamma h w\\bigr), & (h',w')=(h,w),\\\\[4pt]\n0, & \\text{otherwise}.\n\\end{cases}\n\\]\n\nTo illustrate the dynamics, consider the initial condition \\((h_{0},w_{0})=(4,2)\\) with parameters \\(\\alpha=0.5\\), \\(\\beta=0.3\\), and \\(\\gamma=0.02\\).  At this state the total exit rate is\n\\[\n\\lambda=0.5\\times4+0.3\\times2+0.02\\times4\\times2=2+0.6+0.16=2.76\\;\\text{events per unit time}.\n\\]\nA random exponential waiting time with mean \\(1/\\lambda\\) elapses before the next event.  Suppose the first event is a predation, which occurs with probability \\(\\frac{0.16}{2.76}\\approx0.058\\).  The state then jumps to \\((3,3)\\).  In the new state the exit rate becomes\n\\[\n\\lambda'=0.5\\times3+0.3\\times3+0.02\\times3\\times3=1.5+0.9+0.18=2.58,\n\\]\nand the three possible transitions are recomputed with the updated numbers.  Repeating this procedure generates a sample path \\(\\{(h(t),w(t))\\}_{t\\ge0}\\) that exhibits the characteristic oscillations of predator–prey systems: hares increase when wolves are scarce, wolves rise after a surge of hares, and both populations may eventually hit zero, reaching the absorbing state.  The rigorous definition above guarantees that every sample path is a càdlàg function taking values in \\(\\mathbb {N}^{2}\\), and standard results on continuous‑time Markov chains apply to analyze extinction probabilities, expected time to absorption, and long‑term behaviour."}
+{"text": "The notion of a “Powerhouse” in the theory of discrete dynamical systems refers to a finite directed graph \\(P=(V,E)\\) together with a non‑negative integer weight function \\(\\omega:E\\to\\mathbb N\\) that records the amount of energy transferred along each arc when the system is updated. The vertices of \\(P\\) represent distinct substations, the arcs represent one‑way transmission lines, and the weight on an arc \\((u,v)\\) tells how many units of energy are moved from \\(u\\) to \\(v\\) during a single synchronous step. A state of the Powerhouse is a map \\(s:V\\to\\mathbb N\\) assigning to each vertex a non‑negative integer amount of stored energy; the collection of all possible states is the Cartesian product \\(\\mathbb N^{|V|}\\). The update rule is deterministic: given a current state \\(s\\), the next state \\(s'\\) is defined by  \n\n\\[\ns'(v)=\\max\\Bigl\\{0,\\, s(v)-\\sum_{(v,w)\\in E}\\omega(v,w)\\Bigr\\}+\\sum_{(u,v)\\in E}\\omega(u,v),\n\\]\n\nwhich says that each vertex first expends the total outgoing energy required by its incident arcs, never dropping below zero, and then receives the incoming energy from all predecessors. The function \\(F:\\mathbb N^{|V|}\\to\\mathbb N^{|V|}\\) that sends \\(s\\) to \\(s'\\) is called the transition map of the Powerhouse. Because all weights and state components are natural numbers, the system evolves in discrete time and cannot generate fractional energy; the finiteness of \\(V\\) and the non‑negativity of \\(\\omega\\) guarantee that each orbit \\(\\{F^{t}(s_{0})\\mid t\\in\\mathbb N\\}\\) is eventually periodic.\n\nTo illustrate the definition, consider a Powerhouse consisting of three vertices \\(V=\\{a,b,c\\}\\) and arcs  \n\n\\[\nE=\\{(a,b),(b,c),(c,a)\\},\n\\qquad\\omega(a,b)=2,\\; \\omega(b,c)=1,\\; \\omega(c,a)=3.\n\\]\n\nA state is a triple \\(s=(s(a),s(b),s(c))\\) of natural numbers. Starting from the initial state \\(s_{0}=(5,0,4)\\), we compute the next state by applying the update rule componentwise. Vertex \\(a\\) must send \\(2\\) units to \\(b\\); it has \\(5\\) units, so after sending it retains \\(5-2=3\\). It then receives \\(3\\) units from \\(c\\), giving \\(s_{1}(a)=3+3=6\\). Vertex \\(b\\) must send \\(1\\) unit to \\(c\\) but has none, so it remains at \\(0\\) after the outgoing phase and then receives \\(2\\) units from \\(a\\), yielding \\(s_{1}(b)=2\\). Vertex \\(c\\) must send \\(3\\) units to \\(a\\) but only possesses \\(4\\); after sending it retains \\(1\\) and then receives \\(1\\) from \\(b\\), so \\(s_{1}(c)=2\\). Thus \\(F(s_{0})=s_{1}=(6,2,2)\\).\n\nRepeating the computation gives  \n\n\\[\ns_{2}=F(s_{1})=(5,4,4),\\qquad\ns_{3}=F(s_{2})=(4,5,5),\\qquad\ns_{4}=F(s_{3})=(3,6,6),\n\\]\n\nand one observes that each step reduces the total stored energy by the amount that cannot be dispatched because a vertex lacks sufficient supply for its outgoing arcs. Since the total energy is a non‑increasing natural number, the orbit must eventually reach a fixed point or a cycle. In this example the sequence stabilises at the periodic orbit \\((0,0,0)\\) after a finite number of steps, illustrating how the definitions of vertices, arcs, natural‑valued weights, and the transition map combine to produce a rigorously defined, live evolution of the Powerhouse."}
+{"text": "Richard S. Heyser (1927‑2000) was a United States Air Force officer whose most lasting contribution to modern intelligence was the development of the photographic reconnaissance technique later known as “high‑altitude, high‑resolution aerial photography,” a method that underpinned the United States’ ability to monitor Soviet missile deployments during the early Cold War. Heyser entered the Air Force in 1945, trained as a pilot, and after the Korean War was assigned to the 7406th Support Group at the then‑newly created U‑2 reconnaissance program. In 1958 he was tasked with evaluating whether a single, high‑altitude photograph could replace a series of lower‑altitude passes that required multiple sorties and exposed aircraft to hostile fire. The problem was formalized in terms of state numbers: let \\(N\\) denote the natural number of distinct ground features that must be resolved in a given target area, and let \\(S\\) denote the state number, i.e., the minimum number of separate photographic exposures required to guarantee that each of the \\(N\\) features is captured with sufficient resolution to be identified.\n\nHeyser’s insight was to treat the imaging system as a linear operator on the spatial frequency domain. He showed that, for a camera with focal length \\(f\\), aperture diameter \\(D\\), and film grain size \\(g\\), the ground‑sample distance (GSD) at altitude \\(h\\) is approximately \\(\\text{GSD}= \\frac{h\\,g}{f\\,D}\\). The resolution requirement for a feature of size \\(L\\) meters translates to a maximum permissible GSD of \\(L/2\\). Solving for altitude yields the critical altitude \\(h_c = \\frac{L\\,f\\,D}{2g}\\). If an aircraft flies at altitude \\(h \\ge h_c\\), a single exposure will resolve all features of size \\(L\\) or larger, so the state number collapses to \\(S=1\\).\n\nConsider a worked example. Suppose the intelligence analyst must identify missile launch pads that are at least \\(L=10\\) m in diameter. The reconnaissance camera has focal length \\(f=1.5\\) m, aperture diameter \\(D=0.3\\) m, and the film grain size is \\(g=0.02\\) mm. Substituting into the altitude formula gives\n\\[\nh_c = \\frac{10\\;\\text{m}\\times1.5\\;\\text{m}\\times0.3\\;\\text{m}}{2\\times0.00002\\;\\text{m}} = \\frac{4.5}{0.00004}=112{,}500\\;\\text{m},\n\\]\nwhich is clearly unattainable. However, by employing a higher‑resolution film with \\(g=0.002\\) mm, the critical altitude drops to\n\\[\nh_c = \\frac{4.5}{0.000004}=1{,}125{,}000\\;\\text{m},\n\\]\nstill unrealistic, indicating that the original parameters are insufficient. Heyser’s actual U‑2 system used a panoramic camera with effective focal length \\(f\\approx 6\\) m and a large aperture \\(D\\approx 0.5\\) m, together with 0.001 mm grain film. Plugging these numbers yields\n\\[\nh_c = \\frac{10\\times6\\times0.5}{2\\times0.000001}=15{,}000{,}000\\;\\text{m},\n\\]\nwhich, after correcting for the panoramic optics that effectively reduce the GSD by a factor of ten, gives an operational altitude near \\(70{,}000\\) ft (≈21 km). At that altitude the U‑2 could capture the entire target area in a single exposure, so \\(S=1\\) for \\(N\\) equal to the number of launch pads within the photographed swath. Heyser’s analysis demonstrated that by raising altitude and improving optical parameters, the state number could be reduced from the natural number of required passes \\(N\\) to the minimal value \\(S=1\\), a principle that guided the design of subsequent reconnaissance platforms such as the SR‑71 and modern satellite systems. His work exemplifies how careful definition of natural numbers and state numbers, coupled with physical modeling, yields decisive operational advantage."}