Shading Silhouettes of Smaller Ones

I am truly honored to have been given the amazing opportunity to create this original piece, this powerful journey through memory and emotive exploration of the loss of childhood. How do we feel about the loss of our child-self? Could we ever get them back? How long, how deep would one have to dig in the graveyards, the playgrounds of memory, to uncover what was buried there... to un-erase what waserased? shading silhouettes of smaller ones will ultimately encourage a reconnection with the Inner Child hidden inside all of us, as well as an intimate awareness of the adult version of the self by looking back to the smaller ones. The main inspiration for this piece is then of course, Inner Child Work. Most people may not be familiar with this therapeutic exploration of childhood... It wasimportant to me then, to present this concept in an imaginative, theatrical way, as a gift to you - a comprehensive and intensely moving gift. Speaking from experience, working on my Inner Child - my little Bianca - has been the most painful, frightening, yetrewarding and powerful experience within my personal life. Some people spend their entire lives trying to love themselves, to prove themselves, or be accepted. Some are too afraid to look back to where it all began. The characters within this piece will face thatfear... in a regression from the complexities of adulthood to the confusion of adolescence, all the way back to the wonder and bliss of childhood. They will reveal memories, of both joy and pain, love and abandonment, journeying backwards through time - through memory - through a playground - back to the beginning... We will enter a world where a push of a merry-go-round spins us to games of Truth or Dare after a high school dance at 16 - or the slam of a metal fence reminds us of the door Dad slammed in our face at 9 - where the sound of chain links swings us back to scrapping our knee by the sandbox at 5 This piece will attempt to connect everyone, both cast and audience, through a universal understanding and discussion of what it means to grow up, as well as a discovery of WHY we are the way we are - how experiences or relationships from our childhood have shaped our adult lives. We will attempt to challenge your honesty and nerve by inviting you to ask questions of yourselves, your past - to remember what it's like to have the innocence and hope of a child, to engage with and discover your Inner Child, to realize when or why you left them behind, and if you want to this magical part of yourself. It is my hope that you will join us in a collective journey - gather the courage to dig up the little kid you buried so long ago...* The creation, design, choreography, and direction for shading silhouettes of smaller ones mark the culminating experience of a year-long independent study in Theatre.

Hierarchical Approach for Survivable Network Design

A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.