Lumenisity
Abstract:We report order-of-magnitude improvements in performance of field-deployable hollow-core fiber cables evidenced by a 38.4Tb/s (800Gb/s-x-48WDM-channels) 20.5km lab-trial using commercial terminal equipment and the demonstration of 1128km/126km reach in full-fill 400/800Gb/s WDM recirculating-loop experiments.
Abstract:We discuss the problem of designing and implementing controllers for insect-scale flapping-wing micro air vehicles (FWMAVs), from a unifying perspective and employing two different experimental platforms; namely, a Harvard RoboBee-like two-winged robot and the four-winged USC Bee+. Through experiments, we demonstrate that a method that employs quaternion coordinates for attitude control, developed to control quadrotors, can be applied to drive both robotic insects considered in this work. The proposed notion that a generic strategy can be used to control several types of artificial insects with some common characteristics was preliminarily tested and validated using a set of experiments, which include position- and attitude-controlled flights. We believe that the presented results are interesting and valuable from both the research and educational perspectives.
Abstract:We have developed a convolutional neural network (CNN) that can make a pixel-level prediction of objects in image data recorded by a liquid argon time projection chamber (LArTPC) for the first time. We describe the network design, training techniques, and software tools developed to train this network. The goal of this work is to develop a complete deep neural network based data reconstruction chain for the MicroBooNE detector. We show the first demonstration of a network's validity on real LArTPC data using MicroBooNE collection plane images. The demonstration is performed for stopping muon and a $\nu_\mu$ charged current neutral pion data samples.
Abstract:In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between two rules and one of the two rules, between two rules and another rule, and between three rules and two of the three rules.