Using natural head movements to continually calibrate EOG signals

Electrooculography (EOG) is the measurement of eye movements using surface electrodes adhered around the eye. EOG systems can be designed to have an unobtrusive form-factor that is ideal for eye tracking in free-living over long durations, but the relationship between voltage and gaze direction requires frequent re-calibration as the skin-electrode impedance and retinal adaptation vary over time. Here we propose a method for automatically calibrating the EOG-gaze relationship by fusing EOG signals with gyroscopic measurements of head movement whenever the vestibulo-ocular reflex (VOR) is active. The fusion is executed as recursive inference on a hidden Markov model that accounts for all rotational degrees-of-freedom and uncertainties simultaneously. This enables continual calibration using natural eye and head movements while minimizing the impact of sensor noise. No external devices like monitors or cameras are needed. On average, our method’s gaze estimates deviate by 3.54° from those of an industry-standard desktop video-based eye tracker. Such discrepancy is on par with the latest mobile video eye trackers. Future work is focused on automatically detecting moments of VOR in free-living

Darwinian particle swarm optimization

Particle Swarm Optimization (PSO), an evolutionary algorithm for optimization is extended to determine if natural selection, or survival-of-the- fittest, can enhance the ability of the PSO algorithm to escape from local optima. To simulate selection, many simultaneous, parallel PSO algorithms, each one a swarm, operate on a test problem. Simple rules are developed to implement selection. The ability of this so-called Darwinian PSO to escape local optima is evaluated by comparing a single swarm and a similar set of swarms, differing primarily in the absence of the selection mechanism, operating on the same test problem. The selection process is shown to be capable of evolving the best type of particle velocity control, which is a problem specific design choice of the PSO algorithm

Particle Swarm Optimization for the Clustering of Wireless Sensors

Clustering is necessary for data aggregation, hierarchical routing, optimizing sleep patterns, election of extremal sensors, optimizing coverage and resource allocation, reuse of frequency bands and codes, and conserving energy. Optimal clustering is typically an NP-hard problem. Solutions to NP-hard problems involve searches through vast spaces of possible solutions. Evolutionary algorithms have been applied successfully to a variety of NP-hard problems. We explore one such approach, Particle Swarm Optimization (PSO), an evolutionary programming technique where a \u27swarm\u27 of test solutions, analogous to a natural swarm of bees, ants or termites, is allowed to interact and cooperate to find the best solution to the given problem. We use the PSO approach to cluster sensors in a sensor network. The energy efficiency of our clustering in a data-aggregation type sensor network deployment is tested using a modified LEACH-C code. The PSO technique with a recursive bisection algorithm is tested against random search and simulated annealing; the PSO technique is shown to be robust. We further investigate developing a distributed version of the PSO algorithm for clustering optimally a wireless sensor network

A Distributed Evolutionary Algorithmic Approach to the Least-Cost Connected Constrained Sub-Graph and Power Control Problem

When wireless sensors are capable of variable transmit power and are battery powered, it is important to select the appropriate transmit power level for the node. Lowering the transmit power of the sensor nodes imposes a natural clustering on the network and has been shown to improve throughput of the network. However, a common transmit power level is not appropriate for inhomogeneous networks. A possible fitness-based approach, motivated by an evolutionary optimization technique, Particle Swarm Optimization (PSO) is proposed and extended in a novel way to determine the appropriate transmit power of each sensor node. A distributed version of PSO is developed and explored using experimental fitness to achieve an approximation of least-cost connectivity

An Evolutionary Algorithmic Approach to Learning a Bayesian Network from Complete Data

Discovering relationships between variables is crucial for interpreting data from large databases. Relationships between variables can be modeled using a Bayesian network. The challenge of learning a Bayesian network from a complete dataset grows exponentially with the number of variables in the database and the number of states in each variable. It therefore becomes important to identify promising heuristics for exploring the space of possible networks. This paper utilizes an evolutionary algorithmic approach, Particle Swarm Optimization (PSO) to perform this search. A fundamental problem with a search for a Bayesian network is that of handling cyclic networks, which are not allowed. This paper explores the PSO approach, handling cyclic networks in two different ways. Results of network extraction for the well-studied ALARM network are presented for PSO simulations where cycles are broken heuristically at each step of the optimization and where networks with cycles are allowed to exist as candidate solutions, but are assigned a poor fitness. The results of the two approaches are compared and it is found that allowing cyclic networks to exist in the particle swarm of candidate solutions can dramatically reduce the number of objective function evaluations required to converge to a target fitness value

A Distributed Evolutionary Algorithmic Approach to the Coverage Problem for Submersible Sensors

Untethered, underwater sensors, deployed for event detection and tracking and operating in an autonomous mode will be required to self-assemble into a configuration, which optimizes their coverage, effectively minimizing the probability that an event in the target area goes undetected. This organized, cooperative, and autonomous, spreading-out of the sensors is complicated due to sensors localized communication. A given sensor will not in general have position and velocity information for all sensors, but only for those in its communication area. A possible approach to this problem, motivated by an evolutionary optimization technique, Particle Swarm Optimization (PSO) is proposed and extended in a novel way. A distributed version of PSO is developed. A distributed version of PSO is explored using experimental fitness to address the coverage problem in a two dimensional area

What is the Hidden Depolarization Mechanism in Low Luminosity AGN?

Millimeter wavelength polarimetry of accreting black hole systems can provide a tomographic probe of the accretion flow on a wide range of linear scales. We searched for linear polarization in two low luminosity active galactic nuclei (LLAGN), M81 and M84, using the Combined Array for Millimeter Astronomy (CARMA) and the Submillimeter Array (SMA). We find upper limits of $\sim 1 - 2\%$ averaging over the full bandwidth and with a rotation measure (RM) synthesis technique. These low polarization fractions, along with similar low values for LLAGN M87 and 3C84, suggest that LLAGN have qualitatively different polarization properties than radio-loud sources and Sgr A*. If the sources are intrinsically polarized and then depolarized by Faraday rotation then we place lower limits on the RM of a few times $10^7\, {\rm rad\, m^{-2}}$ for the full bandwidth case and $\sim 10^9\, {\rm rad\, m^{-2}}$ for the RM synthesis analysis. These limits are inconsistent with or marginally consistent with expected accretion flow properties. Alternatively, the sources may be depolarized by cold electrons within a few Schwarzschild radii from the black hole, as suggested by numerical models.Comment: Accepted for publication in ApJ

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs

In 1996, Karger [Kar96] gave a startling randomized algorithm that finds a minimum-cut in a (weighted) graph in time $O(m\log^3n)$ which he termed near-linear time meaning linear (in the size of the input) times a polylogarthmic factor. In this paper, we give the first deterministic algorithm which runs in near-linear time for weighted graphs. Previously, the breakthrough results of Kawarabayashi and Thorup [KT19] gave a near-linear time algorithm for simple graphs. The main technique here is a clustering procedure that perfectly preserves minimum cuts. Recently, Li [Li21] gave an $m^{1+o(1)}$ deterministic minimum-cut algorithm for weighted graphs; this form of running time has been termed "almost-linear''. Li uses almost-linear time deterministic expander decompositions which do not perfectly preserve minimum cuts, but he can use these clusterings to, in a sense, "derandomize'' the methods of Karger. In terms of techniques, we provide a structural theorem that says there exists a sparse clustering that preserves minimum cuts in a weighted graph with $o(1)$ error. In addition, we construct it deterministically in near linear time. This was done exactly for simple graphs in [KT19, HRW20] and with polylogarithmic error for weighted graphs in [Li21]. Extending the techniques in [KT19, HRW20] to weighted graphs presents significant challenges, and moreover, the algorithm can only polylogarithmically approximately preserve minimum cuts. A remaining challenge is to reduce the polylogarithmic-approximate clusterings to $1+o(1/\log n)$-approximate so that they can be applied recursively as in [Li21] over $O(\log n)$ many levels. This is an additional challenge that requires building on properties of tree-packings in the presence of a wide range of edge weights to, for example, find sources for local flow computations which identify minimum cuts that cross clusters.Comment: SODA 2024, 60 page

Laser Induced Breakdown Spectroscopy Diagnostics for Nuclear Debris

This paper demonstrates the suitability of Laser -Induced Breakdown Spectroscopy (LIBS) for nuclear debris analysis by presenting LIBS elemental maps of surrogate nuclear debris and isotopic measurements of lithium, a nuclear fuel, via LIBS and chemometrics