This paper presents a comparison of optimization algorithms for constrained damping (CLD) patches’ layout to minimize the maximum vibration response of the odd modes, which constitutes the dominant acoustic radiation, of a simply-supported beam excited by a harmonic transverse force. An analytical model based on Euler-Bernoulli beam assumptions is derived first to relate the displacement response of the beam with bonded CLD patches and their layout. Four different nonlinear optimization methods/algorithms are then respectively used to optimize the CLD patches’ locations and lengths with aim of minimum displacement amplitude at middle of the beam. The considered methods include subproblem approximation method, the first-order method, sequential quadratic programming (SQP) and genetic algorithm (GA). The efficiency of each considered optimization method is evaluated and also compared in terms of obtained optimal beam displacement. The results show that GA is most efficient in obtaining the best optimum for this optimization problem in spite of highest computation efforts required to improve its stability. / Singapore-MIT Alliance (SMA)

This paper presents the layout optimization of passive constrained layer damping (PCLD) treatment for vibration control of cylindrical shells under a broadband force excitation. The equations governing the vibration responses are derived using the energy approach and assumed-mode method. These equations provided relationship between the integrated displacement response over the whole structural volume, i.e. the structural volume displacement (SVD), of a cylindrical shell to structural parameters of base structure and multiple PCLD patches, Genetic algorithms (GAs) based penalty function method is employed to find the optimal layout of rectangular PCLD patches with minimize the maximum displacement response of PCLD-treated cylindrical shells. Optimization solutions of PCLD patches’ locations and shape are obtained under the constraint of total amount of PCLD in terms of percentage added weight to the base structure. Examination of the optimal layouts reveals that the patches tend to increase their coverage in the axial direction and distribute over the whole surface of the cylindrical shell for optimal control of the structural volume displacement. / Singapore-MIT Alliance (SMA)

The estimation approaches examined in this dissertation focus on manipulating system dynamical models to allow the well-known form of the continuous-discrete extended Kalman filter (CDEKF) to accommodate constrained and hybrid systems. This estimation algorithm filters sequential discrete measurements for nonlinear continuous systems modeled with ordinary differential equations. The aim of the research is to broaden the class of systems for which this common tool can be easily applied. Equality constraints, holonomic or nonholonomic, or both, are commonly found in the system dynamics for vehicles, spacecraft, and robotics. These systems are frequently modeled with differential algebraic equations. In this dissertation, three tools for adapting the dynamics of constrained systems for implementation in the CDEKF are presented. These strategies address (1) constrained systems with quasivelocities, (2) kinematically constrained redundant coordinate systems, and (3) systems for which an equality constraint can be broken. The direct linearization work for constrained systems modeled with quasi-velocities is demonstrated to be particularly useful for systems subject to nonholonomic constraints. Concerning redundant coordinate systems, the "constraint force" perspective is shown to be an effective approximation for facilitating implementation of the CDEKF while providing similar performance to that of the fully developed estimation scheme. For systems subject to constraint violation, constraint monitoring methods are presented that allow the CDEKF to autonomously switch between constrained and unconstrained models. The efficacy of each of these approaches is shown through illustrative examples. Hybrid dynamical systems are those modeled with both finite- and infinite-dimensional coordinates. The associated governing equations are integro-partial differential equations. As with constrained systems, these governing equations must be transformed in order to employ the CDEKF. Here, this transformation is accomplished through two finite-dimensional representations of the infinite-dimensional coordinate. The application of these two assumed modes methods to hybrid dynamical systems is outlined, and the performance of the approaches within the CDEKF are compared. Initial simulation results indicate that a quadratic assumed modes approach is more advantageous than a linear assumed modes approach for implementation in the CDEKF. The dissertation concludes with a direct estimation methodology that constructs the Kalman filter directly from the system kinematics, potential energy, and measurement model. This derivation provides a straightforward method for building the CDEKF for discrete systems and relates these direct estimation ideas to the other work presented throughout the dissertation. Together, this collection of estimation strategies provides methods for expanding the class of systems for which a proven, well-known estimation algorithm, the extended Kalman filter, can be applied. The accompanying illustrative examples and simulation results demonstrate the utility of the methods proposed herein.

The increasing demand for high density storage devices has led to innovative data recording paradigms like optical holographic memories that record and read data in a two-dimensional page-oriented manner. In order to overcome the effects of inter-symbol-interference and noise in holographic channels, sophisticated constrained modulation codes and error correction codes are needed in these systems. This dissertation deals with the information-theoretic and signal processing aspects of holographic storage. On the information-theoretic front, the capacity of two-dimensional runlength-limited channels is analyzed. The construction of two-dimensional runlength-limited codes achieving the capacity lower bounds is discussed. This is a theoretical study on one of the open problems in symbolic dynamics and mathematical physics. The analysis of achievable storage density in holographic channels is useful for building practical systems. In this work, fundamental limits for the achievable volumetric storage density in holographic channels dominated by optical scattering are analyzed for two different recording mechanisms, namely angle multiplexed holography and localized recording. Pixel misregistration is an important signal processing problem in holographic systems. In this dissertation, algorithms for compensating two-dimensional translation and rotational misalignments are discussed and analyzed for Nyquist size apertures with low fill factors. These techniques are applicable for general optical imaging systems

Generics has recently been adopted to many mainstream object oriented languages, such as C# and Java. As a particular design choice, generics in C# and Java use a sub-typing relation to constraint type parameters. Failing to encapsulate type parameters within generic interfaces and inability to encapsulate type constraints as part of an interface definition have been identified as deficiencies in the way this design choice has been implemented in these languages. These deficiencies can lead to verbose and redundant code. In particular, they have been reported to affect the development of highly generic libraries. To address these issues, extending object oriented interfaces and sub-typing with associated types and constraint propagation has been proposed and studied in an idealized small-scale formal setting. This thesis builds on this previous work and provides a design and implementation of the extensions in full C#. We also present a proof of soundness of the Featherweight Generic Java (FGJ) formalism extended with interfaces. This property was assumed in a proof of type safety of associated types and constraint propagation, but no proof for the property was provided.

In this thesis, the multi-carrier (MC) code division multiple access (CDMA) system in Rayleigh fading channel is considered. The system performance will be degraded due to multiple access interference (MAI) or background noise. It is know that linearly constrained inverse QR-decomposition (LC-IQRD) recursive least-square algorithm can overcome the problems. The main concern of this thesis is to implement the circuit of LC-IQRD algorithm. FPGA components and sets up a high efficient programmable hardware module. In this thesis, we implemented the circuit of LC-IQRD algorithm via a chip of Field Programmable Gate Array (FPGA) with Verilog HDL. The conventional IQRD circuit design employs systolic array architecture. The advantages of systolic array architecture include modularity and hardware simplicity. These properties are extremely desirable for VLSI implementation. In fact, we expect to reduce the execution time of the conventional IQRD algorithm circuit design. Therefore, in this thesis a modified IQRD circuit design is proposed to improve the effect of circuit implementation. It also has advantage of modularity and reduces the execution time. In order to degrade complexity of LC-IQRD algorithm circuit design, the area and speed of circuit are the consideration in this thesis. The data source is produced by Matlab software. We verify the performance of the system in terms of BER (bit error rate) and SINR (signal to interference and noise ratio).Finally, LC-IQRD algorithm circuit is realized in the Altera EP20k1500EFC-33 chip and on the Quartus II of Altera. The algorithm circuit uses 51536 logic elements (LE) for 30 bits fixed point design.

The sterically expanded octamethyloctahydrodibenzofluorene moiety, C29H38 (Oct), has been incorporated into ansa-metallocenes and constrained geometry catalysts (CGC's). Utilization of this sterically expanded version of fluorene has resulted in solidstate anomalies for both systems. The ansa-metallocenes Me2C(n5-C5H4) (n5-C29H36)MCl2, M = Zr, Hf and Me2C(n5-C5H4)(n5-C29H36)ZrBn2 demonstrate crystal motifs expected for ansametallocenes while Me2C(n5-C5H4)(n5-C29H36)MMe2, M=Zr, Hf exhibit diffuse diffraction, a phenomenon that is extremely unusual for organometallic complexes. This crystalline anomaly is the result of a disorder restricted to two dimensions caused by the rare pillared motif of the system. The best solution for this system consists of parallel and anti-parallel pillars present in a 60:40 ratio. The solid state anomaly observed for the Oct-CGC's occurs on a molecular level. The parent Oct-CGC, Me2Si(1-C29H36)(1-N-tBu)ZrCl2·OEt2, demonstrates an unprecedented n1 ligation to the fluorenyl-based ring. Systematic derivatization of this system via halide substitution, alkylation, and exchange of Zr for Hf has revealed that the n1 ligation persists for systems with small substituents on the metal center capable of retaining a coordinated ether. It is hypothesized that the unusual structure of this new Oct-CGC results in Me2Si(1-C29H36)(1-N-tBu)ZrCl2·OEt2/MAO (MAO = methylaluminoxane) being six times more active in the homopolymerization of 1-octene than ethylene. When compared to the prototypical Ti-CGC Me2Si(n5-C5Me4)(n1-N-tBu)TiCl2/MAO, the Oct-CGC is 85 times more reactive in the homopolymerization of 1-octene and 52 times more active in the copolymerization of 1-octene and 4-methyl-1-pentene. The high reactivity of the Oct-CGC towards alpha-olefins results in the observation of an unyielding comonomer effect in the copolymerization of these olefins with ethylene. In addition, the Oct-CGC is perhaps the most syndioselective catalyst known. With an enantiofacial selectivity of 99.7% and a remarkably high activity towards alpha-olefins, the Oct-CGC is capable of producing the highest melting syndiotactic polypropylene (Tm = 165oC, annealed = 174oC) reported thus far. The high activity and syndioselectivity of the Oct-CGC can be extended to the production of syndiotactic poly(4-methyl-1-pentene) with the highest melting point thus far reported (Tm = 215oC).

This dissertation discusses two independent topics: a resource-constrained shortest-path problem (RCSP) and a literature review on scheduling problems involving sequence-dependent setup (SDS) times (costs). RCSP is often used as a subproblem in column generation because it can be used to solve many practical problems. This dissertation studies RCSP with multiple resource constraints on an acyclic graph, because many applications involve this configuration, especially in column genetation formulations. In particular, this research focuses on a dynamic RCSP since, as a subproblem in column generation, objective function coefficients are updated using new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic graph with the goal of effectively reoptimizing RCSP in the context of column generation. This method uses a one-time “preliminary” phase to transform RCSP into an unconstrained shortest path problem (SPP) and then solves the resulting SPP after new values of dual variables are used to update objective function coefficients (i.e., reduced costs) at each iteration. Network reduction techniques are considered to remove some nodes and/or arcs permanently in the preliminary phase. Specified techniques are explored to reoptimize when only several coefficients change and for dealing with forbidden and prescribed arcs in the context of a column generation/branch-and-bound approach. As a benchmark method, a label-setting algorithm is also proposed. Computational tests are designed to show the effectiveness of the proposed algorithms and procedures. This dissertation also gives a literature review related to the class of scheduling problems that involve SDS times (costs), an important consideration in many practical applications. It focuses on papers published within the last decade, addressing a variety of machine configurations - single machine, parallel machine, flow shop, and job shop - reviewing both optimizing and heuristic solution methods in each category. Since lot-sizing is so intimately related to scheduling, this dissertation reviews work that integrates these issues in relationship to each configuration. This dissertation provides a perspective of this line of research, gives conclusions, and discusses fertile research opportunities posed by this class of scheduling problems. since, as a subproblem in column generation, objective function coefficients are updated using new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic graph with the goal of effectively reoptimizing RCSP in the context of column generation. This method uses a one-time

No description available.

In this dissertation, we explore the issues related to opportunistic and cooperative communications in a multiuser environment. In the first part of the dissertation, we consider opportunistic scheduling for delay limited systems. Multiuser communication over fading channels is a challenging problem due to fast varying channel conditions. On the other hand, it provides opportunities to exploit the varying nature of the channel and maximize the throughput by scheduling the user (or users) with good channel. This gain is termed as multiuser diversity. The larger the number of users, the greater is the multiuser diversity gain. However, there is an inherent scheduling delay in exploiting multiuser diversity. The objective of this work is to design the scheduling schemes which use multiuser diversity to minimize the system transmit energy. We analyze the schemes in large system limit and characterize the energy--delay tradeoff. We show that delay tolerance in data transmission helps us to exploit multiuser diversity and results in an energy efficient use of the system resources. We assume a general multiuser environment but the proposed scheduling schemes are specifically suitable for the wireless sensor network applications where saving of transmit energyat the cost of delay in transmission is extremely useful to increase the life of battery for the sensor node. In the first part of the thesis, we propose scheduling schemes withthe objective of minimizing transmit energy for a given fixed tolerable transmission delay. The fixed delay is termed as hard deadline. A group of users with channels better than a transmission threshold are scheduled for transmission simultaneously using superposition coding. The transmission thresholds depend onthe fading statistics of the underlying channel and hard deadline of the data to be scheduled. As deadline is approached, the thresholds decrease monotonically to reflect the scheduling priority for theuser. We analyze the proposed schedulers in the large system limit. We compute the optimized transmission thresholds for the proposed scheduling schemes. We analyze the proposed schemes for practically relevant scenarios when the randomly arriving packets have individual, non--identical deadlines. We analyze the case when loss tolerance of the application is exploited to further decrease the system energy. The transmitted energy is not a convex function oftransmission thresholds. Therefore, we propose heuristic optimization procedures to compute the transmission thresholds and evaluate the performance of the schemes. Finally, we study the effect of outer cell interference on the proposed scheduling schemes. The second part of the thesis investigates the problem of cooperative communication between the nodes which relay the data of other sources multiplex with their own data towards a common destination, i.e. a relay node performs as a relay and data source at the same time. This problem setting is very useful in case of some wireless sensor network (WSN) applications where all the nodes relay sensed data towards a common destination sink node. The capacity region of a relay region is still an open problem. We use deterministic network model to study the problem. We characterizethe capacity region for a cooperative deterministic network with single source, multiple relays and single destination. We also characterize the capacity region when communicating nodes have correlated information to be sent to the destination. / Cross Layer Optimization of Wireless Sensor Networks