Single-switch scanning systems allow nonspeaking individuals with motor disabilities to communicate by triggering a single switch (e.g., raising an eye brow). A problem with current single-switch scanning systems is that while they result in reasonable performance in noiseless conditions, for instance via simulation or tests with able-bodied users, they fail to accurately model the noise source...

To develop flexible, highly reliable IT systems, there is an emerging need to provide compact, low-cost, and low-latency 10-Gigabit Ethernet switches to interconnect highspeed servers and large storage systems. To meet this need, Fujitsu has developed the world's first single-chip, 10-Gigabit Ethernet switch LSI. This LSI features twelve 10-Gigabit Ethernet interface ports that support layer-2 ...

All-optical switching is a technique in which a gate light pulse changes the transmission of a target light pulse without the detour via electronic signal processing. We take this to the quantum regime, where the incoming gate light pulse contains only one photon on average. The gate pulse is stored as a Rydberg excitation in an ultracold atomic gas using electromagnetically induced transparenc...

A method and algorithm for modeling single-switch scanning for text input is presented. The algorithm uses the layout of a scanning keyboard and a corpus in the form of a word-frequency list to generate codes representing the scan steps for entering words. Scan steps per character (SPC) is computed as a weighted average over the entire corpus. SPC is an absolute measure, thus facilitating compa...

Nomon is a new selection method that allows users to carry out computer actions normally achieved by pointing and clicking. This method has diverse applications such as text entry, mobility control, internet browsing, and drawing. Among these, text entry is arguably the most important computer-based activity an individual, disabled or otherwise, will engage in. As such, and in order to make a c...

In database cracking, a database is physically self-organized into cracked partitions with cracker indices boosting the access to these partitions. The AVL Tree is the data structure of choice to implement cracker indices. However, it is particularly cache-inefficient for range queries, because the nodes accessed only for a few times (i.e, “Cold Data”) and the most accessed ones (i.e, “Hot Data...