A plane symmetric 6R foldable ring

The design of a deployable structure which deploys from a compact bundle of six parallel bars to a rectangular ring is considered. The structure is a plane symmetric Bricard linkage. The internal mechanism is described in terms of its Denavit-Hartenberg parameters; the nature of its single degree of freedom is examined in detail by determining the exact structure of the system of equations governing its movement; a range of design parameters for building feasible mechanisms is determined numerically; and polynomial continuation is used to design rings with certain specified desirable properties. © 2013 Elsevier Ltd.

Continuous-time subspace flows related to the symmetric eigenproblem

The classes of continuous-time flows on Rn×p that induce the same flow on the set of p- dimensional subspaces of Rn×p are described. The power flow is briefly reviewed in this framework, and a subspace generalization of the Rayleigh quotient flow [Linear Algebra Appl. 368C, 2003, pp. 343-357] is proposed and analyzed. This new flow displays a property akin to deflation in finite time. © 2008 Yokohama Publishers.

Stabilization of symmetric formations to motion around convex loops

We provide a cooperative control algorithm to stabilize symmetric formations to motion around closed curves suitable for mobile sensor networks. This work extends previous results for stabilization of symmetric circular formations. We study a planar particle model with decentralized steering control subject to limited communication. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. We illustrate the result for a skewed superellipse, which is a type of curve that includes circles, ellipses, and rounded parallelograms. © 2007 Elsevier B.V. All rights reserved.

Optimization on the orthogonal group for independent component analysis

This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the proposed optimization method is to combine the global search of a good initial condition with a gradient-descent algorithm. This new ICA algorithm performs faster than the RADICAL algorithm (based on Jacobi rotations) while still preserving, and even enhancing, the strong robustness properties that result from its contrast. © Springer-Verlag Berlin Heidelberg 2007.

Alternating spatial patterns for coordinated group motion

Motivated by recent observations of fish schools, we study coordinated group motion for individuals with oscillatory speed. Neighbors that have speed oscillations with common frequency, amplitude and average but different phases, move together in alternating spatial patterns, taking turns being towards the front, sides and back of the group. We propose a model and control laws to investigate the connections between these spatial dynamics, communication when sensing is range or direction limited, and convergence of coordinated group motions. ©2007 IEEE.

Group coordination and cooperative control of steered particles in the plane

The paper overviews recent and ongoing efforts by the authors to develop a design methodology to stabilize isolated relative equilibria in a kinematic model of identical particles moving in the plane at unit speed. Isolated relative equilibria correspond to either parallel motion of all particles with fixed relative spacing or to circular motion of all particles about the same center with fixed relative headings. © Springer-Verlag Berlin Heidelberg 2006.

Collective motion of self-propelled particles: Stabilizing symmetric formations on closed curves

We provide feedback control laws to stabilize formations of multiple, unit speed particles on smooth, convex, and closed curves with definite curvature. As in previous work we exploit an analogy with coupled phase oscillators to provide controls which isolate symmetric particle formations that are invariant to rigid translation of all the particles. In this work, we do not require all particles to be able to communicate; rather we assume that inter-particle communication is limited and can be modeled by a fixed, connected, and undirected graph. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. The methodology is demonstrated using a superellipse, which is a type of curve that includes circles, ellipses, and rounded rectangles. These results can be used in applications involving multiple autonomous vehicles that travel at constant speed around fixed beacons. ©2006 IEEE.

Implementation of multi-group cross-section methodology in BGCore MC-depletion code

BGCore is a software package for comprehensive computer simulation of nuclear reactor systems and their fuel cycles. The BGCore interfaces Monte Carlo particles transport code MCNP4C with a SARAF module - an independently developed code for calculating in-core fuel composition and spent fuel emissions following discharge. In BGCore system, depletion coupling methodology is based on the multi-group approach that significantly reduces computation time and allows tracking of large number of nuclides during calculations. In this study, burnup calculation capabilities of BGCore system were validated against well established and verified, computer codes for thermal and fast spectrum lattices. Very good agreement in k eigenvalue and nuclide densities prediction was observed for all cases under consideration. In addition, decay heat prediction capabilities of the BGCore system were benchmarked against the most recent edition of ANS Standard methodology for UO2 fuel decay power prediction in LWRs. It was found that the difference between ANS standard data and that predicted by the BGCore does not exceed 5%.

Efficient generation of one-group cross sections for coupled Monte Carlo depletion calculations

Coupled Monte Carlo depletion systems provide a versatile and an accurate tool for analyzing advanced thermal and fast reactor designs for a variety of fuel compositions and geometries. The main drawback of Monte Carlo-based systems is a long calculation time imposing significant restrictions on the complexity and amount of design-oriented calculations. This paper presents an alternative approach to interfacing the Monte Carlo and depletion modules aimed at addressing this problem. The main idea is to calculate the one-group cross sections for all relevant isotopes required by the depletion module in a separate module external to Monte Carlo calculations. Thus, the Monte Carlo module will produce the criticality and neutron spectrum only, without tallying of the individual isotope reaction rates. The onegroup cross section for all isotopes will be generated in a separate module by collapsing a universal multigroup (MG) cross-section library using the Monte Carlo calculated flux. Here, the term "universal" means that a single MG cross-section set will be applicable for all reactor systems and is independent of reactor characteristics such as a neutron spectrum; fuel composition; and fuel cell, assembly, and core geometries. This approach was originally proposed by Haeck et al. and implemented in the ALEPH code. Implementation of the proposed approach to Monte Carlo burnup interfacing was carried out through the BGCORE system. One-group cross sections generated by the BGCORE system were compared with those tallied directly by the MCNP code. Analysis of this comparison was carried out and led to the conclusion that in order to achieve the accuracy required for a reliable core and fuel cycle analysis, accounting for the background cross section (σ0) in the unresolved resonance energy region is essential. An extension of the one-group cross-section generation model was implemented and tested by tabulating and interpolating by a simplified σ0 model. A significant improvement of the one-group cross-section accuracy was demonstrated.

Generation of SFR few-group constants using the Monte Carlo code serpent

In this study, the Serpent Monte Carlo code was used as a tool for preparation of homogenized few-group cross sections for the nodal diffusion analysis of Sodium cooled Fast Reactor (SFR) cores. Few-group constants for two reference SFR cores were generated by Serpent and then employed by nodal diffusion code DYN3D in 2D full core calculations. The DYN3D results were verified against the references full core Serpent Monte Carlo solutions. A good agreement between the reference Monte Carlo and nodal diffusion results was observed demonstrating the feasibility of using Serpent for generation of few-group constants for the deterministic SFR analysis.

Degenerate mode-group division multiplexing using MIMO digital signal processing

MIMO DSP is employed to improve the performance of degenerate mode-group division multiplexing in 8 km of conventional GI-MMF. Compensation of the mode coupling, induced by the launch and propagation, between and inside each degenerate mode-group is investigated in order to reduce the DSP complexity. © 2013 IEEE.