Design, build, and test a lunar soil testing system that will be mounted on a small ROV. The tester will include a host of mechanical and electrical properties, taking samples up to 10cm deep.

Umpires play a critical role in baseball by enforcing rules and making judgment calls, particularly in pitch-calling, which significantly affects game flow and results. Given the subjective nature of these decisions, umpires are susceptible to cognitive biases that may consciously or unconsciously influence their calls.

This ongoing study provides an initial examination into a few dimensions of umpire bias.

This work presents the design, simulation, and layout of a CMOS active pixel sensor (APS) employing a three-transistor (3T) architecture with integrated column-parallel readout. Each pixel consists of a reset switch, source-follower amplifier, and row-select device, interfacing with a photodiode that generates a photocurrent proportional to incident illumination. A current-mode column readout circuit enables robust signal acquisition and biasing. Pixel functionality is validated through transient simulations utilizing modeled photocurrents and bias voltages. Row and column scanning are achieved using custom C²MOS shift registers to facilitate sequential raster readout. A 4×4 pixel array is implemented and laid out within a 2.5 mm × 2.5 mm die area, achieving full DRC and LVS compliance. The design demonstrates high fill factor, low-power operation, and scalability, providing a foundation for future monolithic CMOS imaging systems.

We examine the total number of random walk labelings of various graphs, focusing specifically on caterpillar graphs. Random walk labelings are based on walks along graph edges where each previously unvisited vertex is labeled in increasing order. A caterpillar graph has a path of n vertices (the “backbone”), with additional vertices connected by edges (‘legs”) to the backbone. Each leg connects to only one backbone vertex, and leg vertices connected to different backbone vertices cannot be connected to each other; however, legs from the same backbone vertex may connect freely. We focus on symmetric caterpillars, where each backbone vertex has the same configuration of j legs. Configurations include standard caterpillars and those where legs induce a complete graph or path. We find a general formula for the number of labelings for any such symmetric configuration and derive a closed-form expression for the standard caterpillar of length n with j legs.