This paper presents an approach to space transportation turnaround operations modeling using knowledge based complexity functions. This project is of significant relevance to the field of industrial engineering as it deals with knowledge based estimation of processing operations based on the design characteristics of an extremely complex product. The modeling approach uses expert’s knowledge to...

In this paper, we consider regression problems with one-hidden-layer neural networks (1NNs). We distill some properties of activation functions that lead to local strong convexity in the neighborhood of the ground-truth parameters for the 1NN squared-loss objective and most popular nonlinear activation functions satisfy the distilled properties, including rectified linear units (ReLUs), leaky R...

A new approach to the localization of high impedance ground faults in compensated radial power distribution networks is presented. The total size of such networks is often very large and a major part of the monitoring of these is carried out manually. The increasing complexity of industrial processes and communication systems lead to demands for improved monitoring of power distribution network...

In five experiments, we investigated the detection of symmetry (i.e., translation plus reflection) or repetition (i.e., translation alone) between two vertical jagged contours. The complexity of the two contours was manipulated, as was their figure-ground assignment; the two contours either belonged to a common object “inside” them, to two separate objects “outside” them, or to two separate obj...

High data rate communication between airborne vehicles and ground stations over the bandwidth constrained Aeronautical Telemetry channel is attributed to the development of bandwidth efficient Advanced Range Telemetry (ARTM) waveforms. This communication takes place over a multipath channel consisting of two components a line of sight and one or more ground reflected paths which result in frequ...

Final Report "Center for Quantum Algorithms and Complexity" Report Title How efficiently can the ground state of a local Hamiltonian be computed? This is a question that lies at the heart of an emerging area called "quantum Hamiltonian complexity", that addresses fundamental issues in both quantum complexity theory and condensed matter physics. Of particular importance are 1D Hamiltonians. We g...

The Local Hamiltonian problem – estimating the ground state energy of a local Hamiltonian – is a natural problem in physics, and belongs to the complexity class QMA. QMA is the quantum analogue of NP. Languages in QMA have a quantum verifier: a polynomial-time quantum algorithm that takes (poly-sized) quantum states as witnesses. In quantum mechanics, the Hamiltonian of a system is the Hermitia...

Design complexity is increasing day by day in modern digital systems. Due to reconfigurable architecture, low non recurring engineering (NRE) and ease of design field programmable gate arrays (FPGA) become a better solution for managing increasing design complexity. Due to scaling trends FPGA uses more transistors which increase the leakage current. FPGAs are well suited for wireless applicatio...