Searcharxiv⌕ Search

arXiv subjects

Long Wang

Publications and source records attributed to Long Wang.

At least 199 records · Page 11Linked to original sources

Underactuation Design for Tendon-driven Hands via Optimization of Mechanically Realizable Manifolds in Posture and Torque Spaces

Grasp synergies represent a useful idea to reduce grasping complexity without compromising versatility. Synergies describe coordination patterns between joints, either in terms of position (joint angles) or effort (joint torques). In both of these cases, a grasp synergy can be represented as a low-dimensional manifold lying in the high-dimensional joint posture or torque space. In this paper, we use the term \textit{Mechanically Realizable Manifolds} to refer to the subset of such manifolds (in either posture or torque space) that can be achieved via mechanical coupling of the joints in underactuated hands. We present a method to optimize the design parameters of an underactuated hand in order to shape the Mechanically Realizable Manifolds to fit a pre-defined set of desired grasps. Our method guarantees that the resulting synergies can be physically implemented in an underactuated hand, and will enable the resulting hand to both reach the desired grasp postures and achieve quasistatic equilibrium while loading the grasps. We demonstrate this method on three concrete design examples motivated by a real use case, and evaluate and compare their performance in practice.

cs.RO↗

New results on EP elements in rings with involution

In this paper, we mainly give characterizations of EP elements in terms of equations. In addition, a related notion named a central EP element is defined and investigated. Finally, we focus on characterizations of a generalized EP element, i.e. *-DMP element.

math.RA↗

BSE versus StarTrack: implementations of new wind, remnant-formation, and natal-kick schemes in NBODY7 and their astrophysical consequences

The masses of stellar-remnant black holes (BH), as a result of their formation via massive single- and binary-stellar evolution, is of high interest in this era of gravitational-wave detection from binary black hole (BBH) and binary neutron star (BNS) mergers. Here we present new developments in the N-body evolution program NBODY7 in regards to its stellar-remnant formation and related schemes. We demonstrate that the newly-implemented stellar-wind and remnant-formation schemes in the NBODY7 code's BSE sector, such as the 'rapid' and the 'delayed' supernova (SN) schemes along with an implementation of pulsational-pair-instability and pair-instability supernova (PPSN/PSN), now produces neutron star (NS) and BH masses that agree nearly perfectly, over large ranges of zero-age-main sequence (ZAMS) mass and metallicity, with those from the StarTrack population-synthesis program. We also demonstrate the new implementations of various natal-kick mechanisms on NSs and BHs such as the 'convection-asymmetry-driven', 'collapse-asymmetry-driven', and 'neutrino-emission-driven' kicks, in addition to a fully consistent implementation of the standard, fallback-dependent, momentum-conserving natal kick. We find that the SN material fallback causes the convection-asymmetry kick to effectively retain similar number and mass of BHs in clusters as for the standard, momentum-conserving kick. The collapse-asymmetry kick would cause nearly all BHs to retain in clusters irrespective of remnant formation model and metallicity, whereas the inference of a large number of BHs in GCs would potentially rule out the neutrino-driven kick mechanism. Pre-SN mergers of massive primordial binaries would cause BH masses to deviate from the single-star ZAMS mass-remnant mass relation. Such mergers, at low metallicities, can produce low-spinning BHs within the PSN mass gap that can be retained in a stellar cluster.

astro-ph.SR↗

Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments

In this paper, we study the distributed generalized Nash equilibrium seeking problem of non-cooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action set. The action sets of all players are coupled through a shared convex inequality constraint. Each player can only have access to its own cost function, its own set constraint and a local block of the inequality constraint, and can only communicate with its neighbours via a connected graph. Moreover, players do not have prior knowledge of their future cost functions. To address this problem, an online distributed algorithm is proposed based on consensus algorithms and a primal-dual strategy. Performance of the algorithm is measured by using dynamic regrets. Under mild assumptions on graphs and cost functions, we prove that if the deviation of variational generalized Nash equilibrium sequence increases within a certain rate, then the regrets, as well as the violation of inequality constraint, grow sublinearly. A simulation is presented to demonstrate the effectiveness of our theoretical results.

math.OC↗

Dual Temporal Memory Network for Efficient Video Object Segmentation

Video Object Segmentation (VOS) is typically formulated in a semi-supervised setting. Given the ground-truth segmentation mask on the first frame, the task of VOS is to track and segment the single or multiple objects of interests in the rest frames of the video at the pixel level. One of the fundamental challenges in VOS is how to make the most use of the temporal information to boost the performance. We present an end-to-end network which stores short- and long-term video sequence information preceding the current frame as the temporal memories to address the temporal modeling in VOS. Our network consists of two temporal sub-networks including a short-term memory sub-network and a long-term memory sub-network. The short-term memory sub-network models the fine-grained spatial-temporal interactions between local regions across neighboring frames in video via a graph-based learning framework, which can well preserve the visual consistency of local regions over time. The long-term memory sub-network models the long-range evolution of object via a Simplified-Gated Recurrent Unit (S-GRU), making the segmentation be robust against occlusions and drift errors. In our experiments, we show that our proposed method achieves a favorable and competitive performance on three frequently-used VOS datasets, including DAVIS 2016, DAVIS 2017 and Youtube-VOS in terms of both speed and accuracy.

cs.CV↗

A slow-down time-transformed symplectic integrator for solving the few-body problem

An accurate and efficient method dealing with the few-body dynamics is important for simulating collisional N-body systems like star clusters and to follow the formation and evolution of compact binaries. We describe such a method which combines the time-transformed explicit symplectic integrator (Preto & Tremaine 1999; Mikkola & Tanikawa 1999) and the slow-down method (Mikkola & Aarseth 1996). The former conserves the Hamiltonian and the angular momentum for a long-term evolution, while the latter significantly reduces the computational cost for a weakly perturbed binary. In this work, the Hamilton equations of this algorithm are analyzed in detail. We mathematically and numerically show that it can correctly reproduce the secular evolution like the orbit averaged method and also well conserve the angular momentum. For a weakly perturbed binary, the method is possible to provide a few order of magnitude faster performance than the classical algorithm. A publicly available code written in the c++ language, SDAR, is available on GitHub (https://github.com/lwang-astro/SDAR). It can be used either as a stand alone tool or a library to be plugged in other $N$-body codes. The high precision of the floating point to 62 digits is also supported.

astro-ph.EP↗

Adaptive Output Consensus of Heterogeneous Nonlinear Multi-agent Systems: A Distributed Dynamic Compensator Approach

Distributed dynamic compensators, also known as distributed observer, play a key role in the output consensus problem of heterogeneous nonlinear multi-agent systems. However, most existing distributed dynamic compensators require either the compensators' information to be exchanged through communication networks, or that the controller for each subsystem satisfies a class of small gain conditions. In this note, we develop a novel distributed dynamic compensator to address the adaptive output consensus problem of heterogeneous nonlinear multi-agent systems with unknown parameters. The distributed dynamic compensator only requires the output information to be exchanged through communication networks. Thus, it reduces the communication burden and facilitates the implementation of the dynamic compensator. In addition, the distributed dynamic compensator converts the original adaptive output consensus problem into the global asymptotic tracking problem for a class of nonlinear systems with unknown parameters. Then, by using the adaptive backstepping approach, we develop an adaptive tracking controller for each subsystem, which does not requre the small gain conditions as in previous studies. It is further proved that all signals in the closed-loop system are globally uniformly bounded, and the proposed scheme enables the outputs of all the subsystems to track the output of leader asymptotically. A simulation is presented to illustrate the effectiveness of the design methodology.

math.OC↗

Evolutionary dynamics with game transitions

The environment has a strong influence on a population's evolutionary dynamics. Driven by both intrinsic and external factors, the environment is subject to continual change in nature. To capture an ever-changing environment, we consider a model of evolutionary dynamics with game transitions, where individuals' behaviors together with the games they play in one time step influence the games to be played next time step. Within this model, we study the evolution of cooperation in structured populations and find a simple rule: weak selection favors cooperation over defection if the ratio of the benefit provided by an altruistic behavior, $b$, to the corresponding cost, $c$, exceeds $k-k'$, where $k$ is the average number of neighbors of an individual and $k'$ captures the effects of the game transitions. Even if cooperation cannot be favored in each individual game, allowing for a transition to a relatively valuable game after mutual cooperation and to a less valuable game after defection can result in a favorable outcome for cooperation. In particular, small variations in different games being played can promote cooperation markedly. Our results suggest that simple game transitions can serve as a mechanism for supporting prosocial behaviors in highly-connected populations.

q-bio.PE↗

The survival of star clusters with black hole subsystems

Recent observations have detected top-heavy IMFs in dense star forming regions like the Arches cluster. Whether such IMFs also exist in old dense stellar systems like globular clusters is difficult to constrain, because massive stars already became black holes (BHs) and neutron stars (NSs). However, studies of stellar dynamics find that BHs/NSs influence the long-term evolution of star clusters. Following Breen & Heggie (2013) and by carrying out two-component $N$-body simulations, we demonstrate how this dynamical impact connects with the shape of IMFs. By investigating the energy balance between the BH subsystem and the global, we find that to properly describe the evolution of clusters, a corrected two-body relaxation time, $T_{rh,p} = T_{rh}/ψ$, is necessary. Because $ψ$ depends on the total mass fraction of BHs, $M_2 / M$, and the mass ratio, $m_2 / m_1$, the cluster dissolution time is sensitive to the property of BHs or IMFs. Especially, the escape rate of BHs via ejections from few-body encounters is linked to mass segregation. In strong tidal fields, top-heavy IMFs easily lead to the fast dissolution of star clusters and the formation of BH-dominant dark clusters, which suggests that the observed massive GCs with dense cores are unlikely to have extreme top-heavy IMFs. With the future observations of gravitational waves providing unique information of BHs/NSs, it is possible to combine the multi-message observations to have better constrains on the IMFs of old star clusters.

astro-ph.GA↗

The possible role of stellar mergers for the formation of multiple stellar populations in globular clusters

Many possible scenarios for the formation of multiple stellar populations (MSP) in globular clusters (GCs) have been discussed so far, including the involvement of asymptotic giant branch stars, fast rotating main sequence stars, very massive main sequence stars and mass-transferring massive binaries based on stellar evolution modelling. But self-consistent, dynamical simulations of very young GCs are usually not considered. In this work, we perform direct $N$-body modelling such systems with total masses up to $3.2\times10^5$ M$_\odot$, taking into account the observationally constrained primordial binary properties, and discuss the stellar-mergers driven both by binary stellar evolution and dynamical evolution of GCs. The occurrence of stellar mergers is enhanced significantly in binary-rich clusters such that stars forming from the gas polluted by mergers-driven ejection/winds would appears as MSPs. We thus emphasize that stellar mergers can be an important process that connects MSP formation with star cluster dynamics, and that multiple MSP formation channels can naturally work together. The scenario studied here, also in view of a possible top-heavy IMF, may be particularly relevant for explaining the high mass fraction of MSPs (the mass budget problem) and the absence of MSPs in young and low-mass star clusters.

astro-ph.SR↗

Efficient Implementation of Second-Order Stochastic Approximation Algorithms in High-Dimensional Problems

Stochastic approximation (SA) algorithms have been widely applied in minimization problems when the loss functions and/or the gradient information are only accessible through noisy evaluations. Stochastic gradient (SG) descent---a first-order algorithm and a workhorse of much machine learning---is perhaps the most famous form of SA. Among all SA algorithms, the second-order simultaneous perturbation stochastic approximation (2SPSA) and the second-order stochastic gradient (2SG) are particularly efficient in handling high-dimensional problems, covering both gradient-free and gradient-based scenarios. However, due to the necessary matrix operations, the per-iteration floating-point-operations (FLOPs) cost of the standard 2SPSA/2SG is $O(p^3)$, where $p$ is the dimension of the underlying parameter. Note that the $O(p^3)$ FLOPs cost is distinct from the classical SPSA-based per-iteration $O(1)$ cost in terms of the number of noisy function evaluations. In this work, we propose a technique to efficiently implement the 2SPSA/2SG algorithms via the symmetric indefinite matrix factorization and show that the FLOPs cost is reduced from $O(p^3)$ to $O(p^2)$. The formal almost sure convergence and rate of convergence for the newly proposed approach are directly inherited from the standard 2SPSA/2SG. The improvement in efficiency and numerical stability is demonstrated in two numerical studies.

math.OC↗

MOCCA Survey Database I: Dissolution of tidally filling star clusters harbouring BH subsystems

We investigate the dissolution process for dynamically evolving star clusters embedded in an external tidal field by exploring the MOCCA Survey Database I, with focus on the presence and evolution of a stellar-mass black hole subsystem. We argue that the presence of a black hole subsystem can lead to the dissolution of tidally filling star clusters and this can be regarded as a third type of cluster dissolution mechanism (in addition to well-known mechanisms connected with strong mass loss due to stellar evolution and mass loss connected with the relaxation process). This third process is characterized by abrupt cluster dissolution connected with the loss of dynamical equilibrium. The abrupt dissolution is powered by strong energy generation from a stellar-mass black hole subsystem accompanied by tidal stripping. Additionally, we argue that such a mechanism should also work for even tidally under-filling clusters with top-heavy initial mass function. Observationally, star clusters which undergo dissolution powered by the third mechanism would look as a 'dark cluster' i.e. composed of stellar mass black holes surrounded by an expanding halo of luminous stars (Banerjee & Kroupa 2011), and they should be different from 'dark clusters' harbouring intermediate mass black holes as discussed by Askar et al. (2017a). An additional observational consequence of an operation of the third dissolution mechanism should be a larger than expected abundance of free floating black holes in the Galactic halo.

astro-ph.GA↗

MOCCA-SURVEY Database I: Dissolution of tidally filling star clusters harboring black hole subsystem

We investigate the dissolution process of star clusters embedded in an external tidal field and harboring a subsystem of stellar-mass black hole. For this purpose we analyzed the MOCCA models of real star clusters contained in the Mocca Survey Database I. We showed that the presence of a stellar-mass black hole subsystem in tidally filling star cluster can lead to abrupt cluster dissolution connected with the loss of cluster dynamical equilibrium. Such cluster dissolution can be regarded as a third type of cluster dissolution mechanism. We additionally argue that such a mechanism should also work for tidally under-filling clusters with a top-heavy initial mass function.

astro-ph.GA↗

Energy cost for target control of complex networks

To promote the implementation of realistic control over various complex networks, recent work has been focusing on analyzing energy cost. Indeed, the energy cost quantifies how much effort is required to drive the system from one state to another when it is fully controllable. A fully controllable system means that the system can be driven by external inputs from any initial state to any final state in finite time. However, it is prohibitively expensive and unnecessary to confine that the system is fully controllable when we merely need to accomplish the so-called target control---controlling a subnet of nodes chosen from the entire network. Yet, when the system is partially controllable, the associated energy cost remains elusive. Here we present the minimum energy cost for controlling an arbitrary subset of nodes of a network. Moreover, we systematically show the scaling behavior of the precise upper and lower bounds of the minimum energy in term of the time given to accomplish control. For controlling a given number of target nodes, we further demonstrate that the associated energy over different configurations can differ by several orders of magnitude. When the adjacency matrix of the network is nonsingular, we can simplify the framework by just considering the induced subgraph spanned by target nodes instead of the entire network. Importantly, we find that, energy cost could be saved by orders of magnitude as we only need the partial controllability of the entire network. Our theoretical results are all corroborated by numerical calculations, and pave the way for estimating the energy cost to implement realistic target control in various applications.

math.OC↗

Implementation and Performance of Barnes-Hut N-body algorithm on Extreme-scale Heterogeneous Many-core Architectures

In this paper, we report the implementation and measured performance of our extreme-scale global simulation code on Sunway TaihuLight and two PEZY-SC2 systems: Shoubu System B and Gyoukou. The numerical algorithm is the parallel Barnes-Hut tree algorithm, which has been used in many large-scale astrophysical particle-based simulations. Our implementation is based on our FDPS framework. However, the extremely large numbers of cores of the systems used (10M on TaihuLight and 16M on Gyoukou) and their relatively poor memory and network bandwidth pose new challenges. We describe the new algorithms introduced to achieve high efficiency on machines with low memory bandwidth. The measured performance is 47.9, 10.6 PF, and 1.01PF on TaihuLight, Gyoukou and Shoubu System B (efficiency 40\%, 23.5\% and 35.5\%). The current code is developed for the simulation of planetary rings, but most of the new algorithms are useful for other simulations, and are now available in the FDPS framework.

astro-ph.IM↗

Accelerated FDPS --- Algorithms to Use Accelerators with FDPS

In this paper, we describe the algorithms we implemented in FDPS to make efficient use of accelerator hardware such as GPGPUs. We have developed FDPS to make it possible for many researchers to develop their own high-performance parallel particle-based simulation programs without spending large amount of time for parallelization and performance tuning. The basic idea of FDPS is to provide a high-performance implementation of parallel algorithms for particle-based simulations in a "generic" form, so that researchers can define their own particle data structure and interparticle interaction functions and supply them to FDPS. FDPS compiled with user-supplied data type and interaction function provides all necessary functions for parallelization, and using those functions researchers can write their programs as though they are writing simple non-parallel program. It has been possible to use accelerators with FDPS, by writing the interaction function that uses the accelerator. However, the efficiency was limited by the latency and bandwidth of communication between the CPU and the accelerator and also by the mismatch between the available degree of parallelism of the interaction function and that of the hardware parallelism. We have modified the interface of user-provided interaction function so that accelerators are more efficiently used. We also implemented new techniques which reduce the amount of work on the side of CPU and amount of communication between CPU and accelerators. We have measured the performance of N-body simulations on a systems with NVIDIA Volta GPGPU using FDPS and the achieved performance is around 27 \% of the theoretical peak limit. We have constructed a detailed performance model, and found that the current implementation can achieve good performance on systems with much smaller memory and communication bandwidth.

astro-ph.IM↗

Modal-based Kinematics and Contact Detection of Soft Robots

Soft robots offer an alternative approach to manipulate inside the constrained space while maintaining the safe interaction with the external environment. Due to its adaptable compliance characteristic, external contact force can easily deform the robot shapes and lead to undesired robot kinematic and dynamic properties. Accurate contact detection and contact position estimation are of critical importance for soft robot modeling, control, trajectory planning, and eventually affect the success of task completion. In this paper, we focus on the study of 1-DoF soft pneumatic bellow bending actuator, which is one of the fundamental components to construct complex, multi-DoF soft robots. This 1-DoF soft robot is modeled through the integral representation of the spacial curve. The direct and instantaneous kinematics are calculated explicitly through a modal method. The fixed centrode deviation (FCD) method is used to to detect the external contact and estimate contact location. Simulation results indicate that the contact location can be accurately estimated by solving a nonlinear least square optimization problem.

cs.RO↗

Simplified Kinematics of Continuum Robot Equilibrium Modulation via Moment Coupling Effects and Model Calibration

Recently, a new concept for continuum robots capable of producing macro-scale and micro-scale motion has been presented. These robots achieve their multi-scale motion capabilities by coupling direct-actuation of push-pull back-bones for macro motion with indirect actuation whereby the equilibrium pose is altered to achieve micro-scale motion. This paper presents a first attempt at explaining the micro-motion capabilities of these robots from a modeling perspective. This paper presents the macro and micro motion kinematics of a single segment continuum robot by using statics coupling effects among its sub-segments. Experimental observations of the micro-scale motion demonstrate a turning point behavior which could not be explained well using the current modeling methods. We present a simplistic modeling approach that introduces two calibration parameters to calibrate the moment coupling effects among the sub segments of the robot. It is shown that these two parameters can reproduce the turning point behavior at the micro-scale. The instantaneous macro and micro scale kinematics Jacobians and the calibration parameters identification Jacobian are derived. The modeling approach is verified against experimental data showing that our simplistic modeling approach can capture the experimental motion data with RMS position error of 5.82 micrometers if one wishes to fit the entire motion profile with the turning point. If one chooses to exclude motions past the turning point, our model can fit the experimental data with an accuracy of 4.76 micrometers.

cs.RO↗