Structural optimisation problem in support to building retrofitting decision

Various analysis methods, either linear elastic or non-linear, static or dynamic, are available for the performance analysis of existing buildings. Despite its advantages, it must be admitted that non-linear time history analysis can frequently become overly complex and impractical for general use as a first assessment. Simplified models, as the Capacity Spectrum Method, are frequently not able to accurately assess irregular structures. Considering these limitations, it is proposed and evaluated a simplified MDOF non-linear dynamic model, accounting for non-linear storey behaviour and storey damping. Based on the MDOF non-linear dynamic model, were developed optimization algorithms for the redesign of existing non-seismically designed structures. The optimization procedure searches for the optimum storey strengthening distribution (strength, stiffness or damping) in order to meet specific performance requirements, in terms of maximum inter-storey drift for a given seismic demand level. Numerical examples are presented in order to illustrate the capability of methodology

Diagnosing numerical Cherenkov instabilities in relativistic plasma simulations based on general meshes

Numerical Cherenkov radiation (NCR) or instability is a detrimental effect frequently found in electromagnetic particle-in-cell (EM-PIC) simulations involving relativistic plasma beams. NCR is caused by spurious coupling between electromagnetic-field modes and multiple beam resonances. This coupling may result from the slow down of poorly-resolved waves due to numerical (grid) dispersion and from aliasing mechanisms. NCR has been studied in the past for finite-difference-based EM-PIC algorithms on regular (structured) meshes with rectangular elements. In this work, we extend the analysis of NCR to finite-element-based EM-PIC algorithms implemented on unstructured meshes. The influence of different mesh element shapes and mesh layouts on NCR is studied. Analytic predictions are compared against results from finite-element-based EM-PIC simulations of relativistic plasma beams on various mesh types.Comment: 31 pages, 20 figure

Geographic Gossip: Efficient Averaging for Sensor Networks

Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\sqrt{n}$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $\epsilon$ using $O(\frac{n^{1.5}}{\sqrt{\log n}} \log \epsilon^{-1})$ radio transmissions, which yields a $\sqrt{\frac{n}{\log n}}$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.Comment: To appear, IEEE Transactions on Signal Processin

Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs

Future nano-scale electronics built up from an Avogadro number of components needs efficient, highly scalable, and robust means of communication in order to be competitive with traditional silicon approaches. In recent years, the Networks-on-Chip (NoC) paradigm emerged as a promising solution to interconnect challenges in silicon-based electronics. Current NoC architectures are either highly regular or fully customized, both of which represent implausible assumptions for emerging bottom-up self-assembled molecular electronics that are generally assumed to have a high degree of irregularity and imperfection. Here, we pragmatically and experimentally investigate important design trade-offs and properties of an irregular, abstract, yet physically plausible 3D small-world interconnect fabric that is inspired by modern network-on-chip paradigms. We vary the framework's key parameters, such as the connectivity, the number of switch nodes, the distribution of long- versus short-range connections, and measure the network's relevant communication characteristics. We further explore the robustness against link failures and the ability and efficiency to solve a simple toy problem, the synchronization task. The results confirm that (1) computation in irregular assemblies is a promising and disruptive computing paradigm for self-assembled nano-scale electronics and (2) that 3D small-world interconnect fabrics with a power-law decaying distribution of shortcut lengths are physically plausible and have major advantages over local 2D and 3D regular topologies