Placement of Small Vertical Axis Wind Turbine to Maximize Power Generation Influenced by Architectural and Geographic Interfaces in Urban Areas

Current methods for large-scale wind collection are unviable in urban areas. In order to investigate the feasibility of generating power from winds in these environments, we sought to optimize placements of small vertical-axis wind turbines in areas of artificially-generated winds. We explored both vehicular transportation and architecture as sources of artificial wind, using a combination of anemometer arrays, global positioning system (GPS), and weather report data. We determined that transportation-generated winds were not significant enough for turbine implementation. In addition, safety and administrative concerns restricted the implementation of said wind turbines along roadways for transportation-generated wind collection. Wind measurements from our architecture collection were applied in models that can help predict other similar areas with artificial wind, as well as the optimal placement of a wind turbine in those areas.

Identification and assessment of potential wind energy project sites in the State of Maryland

Gemstone Team Renewables

Wind-Induced Vibration Energy Harvesting Using Piezoelectric Transducers Coupled with Dynamic Magnification

Flexible cylindrical structures subjected to wind loading experience vibrations from periodic shedding of vortices in their wake. Vibrations become excessive when the natural frequencies of the cylinder coincide with the vortex shedding frequency. In this study, cylinder vibrations are transmitted to a beam inside the structure via dynamic magnifier system. This system amplifies the strain experienced by piezoelectric patches bonded to the beam to maximize the conversion from vibrational energy into electrical energy. Realworld applicability is tested using a wind tunnel to create vortex shedding and comparing the results to finite element modeling that shows the structural vibrational modes. A crucial part of this study is conditioning and storing the harvested energy, focusing on theoretical modeling, design parameter optimization, and experimental validation. The developed system is helpful in designing wind-induced energy harvesters to meet the necessity for novel energy resources.

Learning Binary Code Representations for Effective and Efficient Image Retrieval

The size of online image datasets is constantly increasing. Considering an image dataset with millions of images, image retrieval becomes a seemingly intractable problem for exhaustive similarity search algorithms. Hashing methods, which encodes high-dimensional descriptors into compact binary strings, have become very popular because of their high efficiency in search and storage capacity. In the first part, we propose a multimodal retrieval method based on latent feature models. The procedure consists of a nonparametric Bayesian framework for learning underlying semantically meaningful abstract features in a multimodal dataset, a probabilistic retrieval model that allows cross-modal queries and an extension model for relevance feedback. In the second part, we focus on supervised hashing with kernels. We describe a flexible hashing procedure that treats binary codes and pairwise semantic similarity as latent and observed variables, respectively, in a probabilistic model based on Gaussian processes for binary classification. We present a scalable inference algorithm with the sparse pseudo-input Gaussian process (SPGP) model and distributed computing. In the last part, we define an incremental hashing strategy for dynamic databases where new images are added to the databases frequently. The method is based on a two-stage classification framework using binary and multi-class SVMs. The proposed method also enforces balance in binary codes by an imbalance penalty to obtain higher quality binary codes. We learn hash functions by an efficient algorithm where the NP-hard problem of finding optimal binary codes is solved via cyclic coordinate descent and SVMs are trained in a parallelized incremental manner. For modifications like adding images from an unseen class, we propose an incremental procedure for effective and efficient updates to the previous hash functions. Experiments on three large-scale image datasets demonstrate that the incremental strategy is capable of efficiently updating hash functions to the same retrieval performance as hashing from scratch.