Senior Project - Roborodentia Robot

This project includes an autonomous robot capable of dispensing balls from a dispenser mounted on a wall and shooting the balls through targets five to eight feet away. The robot can hold up to five balls at a time and shoots balls one by one at targets

LUXOR: An FPGA Logic Cell Architecture for Efficient Compressor Tree Implementations

We propose two tiers of modifications to FPGA logic cell architecture to deliver a variety of performance and utilization benefits with only minor area overheads. In the irst tier, we augment existing commercial logic cell datapaths with a 6-input XOR gate in order to improve the expressiveness of each element, while maintaining backward compatibility. This new architecture is vendor-agnostic, and we refer to it as LUXOR. We also consider a secondary tier of vendor-speciic modifications to both Xilinx and Intel FPGAs, which we refer to as X-LUXOR+ and I-LUXOR+ respectively. We demonstrate that compressor tree synthesis using generalized parallel counters (GPCs) is further improved with the proposed modifications. Using both the Intel adaptive logic module and the Xilinx slice at the 65nm technology node for a comparative study, it is shown that the silicon area overhead is less than 0.5% for LUXOR and 5-6% for LUXOR+, while the delay increments are 1-6% and 3-9% respectively. We demonstrate that LUXOR can deliver an average reduction of 13-19% in logic utilization on micro-benchmarks from a variety of domains.BNN benchmarks benefit the most with an average reduction of 37-47% in logic utilization, which is due to the highly-efficient mapping of the XnorPopcount operation on our proposed LUXOR+ logic cells.Comment: In Proceedings of the 2020 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA'20), February 23-25, 2020, Seaside, CA, US

Priority sites for wildfowl conservation in Mexico

A set of priority sites for wildfowl conservation in Mexico was determined using contemporary count data (1991–2000) from the U.S. Fish & Wildlife Service mid-winter surveys. We used a complementarity approach implemented through linear integer programming that addresses particular conservation concerns for every species included in the analysis and large fluctuations in numbers through time. A set of 31 priority sites was identified, which held more than 69% of the mid-winter count total in Mexico during all surveyed years. Six sites were in the northern highlands, 12 in the central highlands, six on the Gulf of Mexico coast and seven on the upper Pacific coast. Twenty-two sites from the priority set have previously been identified as qualifying for designation as wetlands of international importance under the Ramsar Convention and 20 sites are classified as Important Areas for Bird Conservation in Mexico. The information presented here provides an accountable, spatially-explicit, numerical basis for ongoing conservation planning efforts in Mexico, which can be used to improve existing wildfowl conservation networks in the country and can also be useful for conservation planning exercises elsewhere

Model complexity reduction of chemical reaction networks using mixed-integer quadratic programming

The model complexity reduction problem of large chemical reaction networks under isobaric and isothermal conditions is considered. With a given detailed kinetic mechanism and measured data of the key species over a finite time horizon, the complexity reduction is formulated in the form of a mixed-integer quadratic optimization problem where the objective function is derived from the parametric sensitivity matrix. The proposed method sequentially eliminates reactions from the mechanism and simultaneously tunes the remaining parameters until the pre-specified tolerance limit in the species concentration space is reached. The computational efficiency and numerical stability of the optimization are improved by a pre-reduction step followed by suitable scaling and initial conditioning of the Hessian involved. The proposed complexity reduction method is illustrated using three well-known case studies taken from reaction kinetics literature. © 2012 Elsevier Ltd. All rights reserved

Optimization of minimum set of protein–DNA interactions: a quasi exact solution with minimum over-fitting

Motivation: A major limitation in modeling protein interactions is the difficulty of assessing the over-fitting of the training set. Recently, an experimentally based approach that integrates crystallographic information of C2H2 zinc finger–DNA complexes with binding data from 11 mutants, 7 from EGR finger I, was used to define an improved interaction code (no optimization). Here, we present a novel mixed integer programming (MIP)-based method that transforms this type of data into an optimized code, demonstrating both the advantages of the mathematical formulation to minimize over- and under-fitting and the robustness of the underlying physical parameters mapped by the code