Mesh generation for confined fusion plasma simulation

XGC1 and M3D-C ¹ are two fusion plasma simulation codes being developed at Princeton Plasma Physics Laboratory. XGC1 uses the particle-in-cell method to simulate gyrokinetic neoclassical physics and turbulence (Chang et al. Phys Plasmas 16(5):056108, 2009; Ku et al. Nucl Fusion 49:115021, 2009; Admas et al. J Phys 180(1):012036, 2009). M3D-\(C^1\) solves the two-fluid resistive magnetohydrodynamic equations with the \(C^1\) finite elements (Jardin J comput phys 200(1):133–152, 2004; Jardin et al. J comput Phys 226(2):2146–2174, 2007; Ferraro and Jardin J comput Phys 228(20):7742–7770, 2009; Jardin J comput Phys 231(3):832–838, 2012; Jardin et al. Comput Sci Discov 5(1):014002, 2012; Ferraro et al. Sci Discov Adv Comput, 2012; Ferraro et al. International sherwood fusion theory conference, 2014). This paper presents the software tools and libraries that were combined to form the geometry and automatic meshing procedures for these codes. Specific consideration has been given to satisfy the mesh configuration and element shape quality constraints of XGC1 and M3D-\(C^1\).     

Online adaptive multiple pedestrian tracking in monocular surveillance video

Automatic online multiple pedestrian tracking is a rather important and challenging task in the field of machine vision. A new multiple pedestrian tracking system is proposed in this paper, which combines pedestrian detection, motion prediction, target matching and adaptive location adjustment methods. The clip-split strategy was adopted for optimization of the detected pedestrian candidates, which resulted in great improvement of the tracking accuracies, especially when the marginal areas of the detected target candidates contained background scenes. For each frame, the proposed adaptive location adjustment method was used to adjust the location and scale of the targets to deal with drifting problems where necessary, especially after severe occlusions. Experimental results on three challenging real-world datasets demonstrated that the proposed tracker has excellent performance over other state-of-the-art trackers based on MOT metrics.

     

Encouraging second-order consistency for multiple graph matching

The problems in computer vision of finding the global correspondences across a set of images can be formulated as a multiple graph matching problem consisting of pairwise matching problems. In the multiple graph matching problem, matching consistency is as important as matching accuracy for preventing the contrariety among matched results. Unfortunately, since the majority of conventional pairwise matching methods only approximate the original graph matching problem owing to its computational complexity, a framework that separately matches each graph pair could generate inconsistent results in practical environments. In this paper, we propose a novel multiple graph matching method based on the second-order consistency concept, which simultaneously considers the matching information of all possible graph pairs. We reformulate the multiple graph matching problem to encourage second-order consistency and design an iterative optimization framework. In our experiments, the proposed method outperforms the state-of-the-art methods in terms of both consistency and accuracy.     

A frame‐based EM‐simulation for design of LC oscillator with MoM capacitor banks

This article presents a simulation method for the design of a digitally controlled oscillator (DCO). Electromagnetic (EM) simulations are essential and inevitable for modern LC oscillator design. Although EM‐simulators provide high accuracy, the EM‐simulation time is very long when metal‐oxide‐metal (MoM) capacitors are present. The proposed frame‐based EM‐simulation can significantly reduce the EM‐simulation time even in the presence of MoM capacitors without influencing the accuracy. To verify the proposed method, a DCO was fabricated using a 55‐nm CMOS process. Measurements of the DCO are in good agreement with the frame‐based post‐layout simulation results. In addition, the DCO has good performances with a low power consumption of approximately 0.68 mW.     

Efficient deterministic secure quantum communication protocols using multipartite entangled states

We propose two deterministic secure quantum communication protocols employing three-qubit GHZ-like states and five-qubit Brown states as quantum channels for secure transmission of information in units of two bits and three bits using multipartite teleportation schemes developed here. In these schemes, the sender’s capability in selecting quantum channels and the measuring bases leads to improved qubit efficiency of the protocols.     

Development of panel generation system for seakeeping analysis

In this paper, a panel generation system for analyzing seakeeping performance of a ship is developed. Given a set of offset data representing the ship hull, the system first creates a surface model of the ship. From the surface model, the wetted part of the ship is obtained by computing the intersection between the water surface and the hull, which is then processed to generate quadrilateral panels for the hull and the water surface. The system is designed to handle various kinds of ships such as ships with a mono-skeg, a twin-skeg and/or a bulbous bow in either an automatic or an interactive manner. Moreover, it can generate input panels for three different seakeeping analysis methods. Examples are provided to demonstrate the capabilities of the system.     

Adaptive Output Feedback Control of Flexible-Joint Robots Using Neural Networks: Dynamic Surface Design Approach

In this paper, we propose a new robust output feedback control approach for flexible-joint electrically driven (FJED) robots via the observer dynamic surface design technique. The proposed method only requires position measurements of the FJED robots. To estimate the link and actuator velocity information of the FJED robots with model uncertainties, we develop an adaptive observer using self-recurrent wavelet neural networks (SRWNNs). The SRWNNs are used to approximate model uncertainties in both robot (link) dynamics and actuator dynamics, and all their weights are trained online. Based on the designed observer, the link position tracking controller using the estimated states is induced from the dynamic surface design procedure. Therefore, the proposed controller can be designed more simply than the observer backstepping controller. From the Lyapunov stability analysis, it is shown that all signals in a closed-loop adaptive system are uniformly ultimately bounded. Finally, the simulation results on a three-link FJED robot are presented to validate the good position tracking performance and robustness of the proposed control system against payload uncertainties and external disturbances.     

Query-driven visualization of time-varying adaptive mesh refinement data

The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids that challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.     

Using difference intervals for time-varying isosurface visualization

We present a novel approach to out-of-core time-varying isosurface visualization. We attempt to interactively visualize time-varying datasets which are too large to fit into main memory using a technique which is dramatically different from existing algorithms. Inspired by video encoding techniques, we examine the data differences between time steps to extract isosurface information. We exploit span space extraction techniques to retrieve operations necessary to update isosurface geometry from neighboring time steps. Because only the changes between time steps need to be retrieved from disk, I/O bandwidth requirements are minimized. We apply temporal compression to further reduce disk access and employ a point-based previewing technique that is refined in idle interaction cycles. Our experiments on computational simulation data indicate that this method is an extremely viable solution to large time-varying isosurface visualization. Our work advances the state-of-the-art by enabling all isosurfaces to be represented by a compact set of operations.