Physics-guided machine learning from simulated data with different physical parameters

Knowledge and Information Systems - Physics-based models are widely used to study dynamical systems in a variety of scientific and engineering problems. However, these models are necessarily...     

In Situ Electrical Network Activation and Deactivation in Short Carbon Fiber Composites via 3D Printing

Prior studies on carbon-filler based, conductive polymer composites have mainly investigated how conductive filler morphology and concentration can tailor a material's electrical conductivity and overlooks the effects of filler alignment due to the difficulty to control and quickly quantify the filler alignment. Here, direct ink write 3D printing's unique ability is utilized to control carbon fiber alignment with a single process parameter, velocity ratio, to instantaneously activate or deactivate the electrical network in composites. Maximum electrical conductivity is achieved by randomly aligning carbon fibers that enhances the chance of direct fiber-to-fiber contact and, thus, activating the electrical network. However, aligning the fibers by increasing the velocity ratio disrupts the electrical network by minimizing fiber-to-fiber contact that resulted in a drastic decrease in electrical conductivity by as much as five orders of magnitude in both short and long carbon fiber composites. With this study, this study demonstrates that electrically conductive or insulative composites can be fabricated sequentially with a single ink. This novel ability to instantaneously control the electrical conductivity of carbon fiber reinforced composites allow to directly embed conductive pathways into designs to 3D print multifunctional composites that are capable of localized heating and self-sensing.     

Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems

The paper suggests a possible cooperation between stochastic programming and optimal control for the solution of multistage stochastic optimization problems. We propose a decomposition approach for a class of multistage stochastic programming problems in arborescent form (i.e. formulated with implicit non-anticipativity constraints on a scenario tree). The objective function of the problem can be either linear or nonlinear, while we require that the constraints are linear and involve only variables from two adjacent periods (current and lag 1). The approach is built on the following steps. First, reformulate the stochastic programming problem into an optimal control one. Second, apply a discrete version of Pontryagin maximum principle to obtain optimality conditions. Third, discuss and rearrange these conditions to obtain a decomposition that acts both at a time stage level and at a nodal level. To obtain the solution of the original problem we aggregate the solutions of subproblems through an enhanced mean valued fixed point iterative scheme.     

Smoothness maximization along a predefined path accurately predicts the speed profiles of complex arm movements

The speed profiles of arm movements display a number of regularities, including bell-shaped speed profiles in straight reaching movements and an inverse relationship between speed and curvature in extemporaneous drawing movements (described as a 2/3 power law). Here we propose a new model that simultaneously accounts for both regularities by replacing the 2/3 power law with a smoothness constraint. For a given path of the hand in space, our model assumes that the speed profile will be the one that minimizes the third derivative of position (or "jerk"). Analysis of the mathematical relationship between this smoothness constraint and the 2/3 power law revealed that in both two and three dimensions, the power law is equivalent to setting the jerk along the normal to the path to zero; it generates speed predictions that are similar, but clearly distinguishable from the predictions of our model. We have assessed the accuracy of the model on a number of motor tasks in two and three dimensions, involving discrete movements along arbitrary paths, traced with different limb segments. The new model provides a very close fit to the observed speed profiles in all cases. Its performance is uniformly better compared with all existing versions of the 2/3 power law, suggesting that the correlation between speed and curvature may be a consequence of an underlying motor strategy to produce smooth movements. Our results indicate that the relationship between the path and the speed profile of a complex arm movement is stronger than previously thought, especially within a single trial. The accuracy of the model was quite uniform over movements of different shape, size, and average speed. We did not find evidence for segmentation, yet prediction error increased with movement duration, suggesting a continuous fluctuation of the "tempo" of discrete movements. The implications of these findings for motor planning and on-line control are discussed.     

Emission polarization of roughened glass and aluminum surfaces

Ellipsometer measurements of the effective complex refractive index at a wavelength of 10.6 μm are made on a series of glass and aluminum surfaces of increasing surface roughness. The measured values are then used to calculate the degree of emission polarization and are shown to be in agreement with the experimentally determined values when depolarization is small. Comparisons are also made with calculations based on the Kirchhoff scattering theory. Both the theory and the experimental results indicate that it is the local surface slope and not the roughness magnitude that is the prime factor in determining the degree of emission polarization from the samples studied.     

On the second-order sliding mode control of nonlinear systems with uncertain control direction

This note deals with the implementation of a second-order sliding mode control algorithm for a class of nonlinear systems in which the sign of the high-frequency gain, though constant, is unknown. A specific second-order sliding mode control algorithm, the “Suboptimal” algorithm, is properly modified in order to face the uncertainty in the control direction. It is shown that after a finite time the uncertain sign is identified and the standard finite time convergence takes place from that time on. Simulation results are provided.     

Accelerating Monte Carlo simulations with an NVIDIA graphics processor

Modern graphics cards, commonly used in desktop computers, have evolved beyond a simple interface between processor and display to incorporate sophisticated calculation engines that can be applied to general purpose computing. The Monte Carlo algorithm for modelling photon transport in turbid media has been implemented on an NVIDIA^® 8800gt graphics card using the CUDA toolkit. The Monte Carlo method relies on following the trajectory of millions of photons through the sample, often taking hours or days to complete. The graphics-processor implementation, processing roughly 110 million scattering events per second, was found to run more than 70 times faster than a similar, single-threaded implementation on a 2.67 GHz desktop computer.

Program summary

Program title: Phoogle-C/Phoogle-GCatalogue identifier: AEEB_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEB_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 51 264No. of bytes in distributed program, including test data, etc.: 2 238 805Distribution format: tar.gzProgramming language: C++Computer: Designed for Intel PCs. Phoogle-G requires a NVIDIA graphics card with support for CUDA 1.1Operating system: Windows XPHas the code been vectorised or parallelized?: Phoogle-G is written for SIMD architecturesRAM: 1 GBClassification: 21.1External routines: Charles Karney Random number library. Microsoft Foundation Class library. NVIDA CUDA library [1].Nature of problem: The Monte Carlo technique is an effective algorithm for exploring the propagation of light in turbid media. However, accurate results require tracing the path of many photons within the media. The independence of photons naturally lends the Monte Carlo technique to implementation on parallel architectures. Generally, parallel computing can be expensive, but recent advances in consumer grade graphics cards have opened the possibility of high-performance desktop parallel-computing.Solution method: In this pair of programmes we have implemented the Monte Carlo algorithm described by Prahl et al. [2] for photon transport in infinite scattering media to compare the performance of two readily accessible architectures: a standard desktop PC and a consumer grade graphics card from NVIDIA.Restrictions: The graphics card implementation uses single precision floating point numbers for all calculations. Only photon transport from an isotropic point-source is supported. The graphics-card version has no user interface. The simulation parameters must be set in the source code. The desktop version has a simple user interface; however some properties can only be accessed through an ActiveX client (such as Matlab).Additional comments: The random number library used has a LGPL (http://www.gnu.org/copyleft/lesser.html) licence.Running time: Runtime can range from minutes to months depending on the number of photons simulated and the optical properties of the medium.References:

[1]

http://www.nvidia.com/object/cuda_home.html.

[2]

S. Prahl, M. Keijzer, Sl. Jacques, A. Welch, SPIE Institute Series 5 (1989) 102.