Searcharxiv⌕ Search

arXiv subjects

Bo Jin

Publications and source records attributed to Bo Jin.

At least 73 records · Page 4Linked to original sources
arXiv2021

Resolvent-based approach for H2-optimal estimation and control: an application to the cylinder flow

We consider estimation and control of the cylinder wake at low Reynolds numbers. A particular focus is on the development of efficient numerical algorithms to design optimal linear feedback controllers when there are many inputs (disturbances applied everywhere) and many outputs (perturbations measured everywhere). We propose a resolvent-based iterative algorithm to perform i) optimal estimation of the flow using a limited number of sensors; and ii) optimal control of the flow when the entire flow is known but only a limited number of actuators are available for control. The method uses resolvent analysis to take advantage of the low-rank characteristics of the cylinder wake and solutions are obtained without any model-order reduction. Optimal feedback controllers are also obtained by combining the solutions of the estimation and control problems. We show that the performance of the estimators and controllers converges to the true global optima, indicating that the important physical mechanisms for estimation and control are of low rank.

math.OC↗
arXiv2021

MeSIN: Multilevel Selective and Interactive Network for Medication Recommendation

Recommending medications for patients using electronic health records (EHRs) is a crucial data mining task for an intelligent healthcare system. It can assist doctors in making clinical decisions more efficiently. However, the inherent complexity of the EHR data renders it as a challenging task: (1) Multilevel structures: the EHR data typically contains multilevel structures which are closely related with the decision-making pathways, e.g., laboratory results lead to disease diagnoses, and then contribute to the prescribed medications; (2) Multiple sequences interactions: multiple sequences in EHR data are usually closely correlated with each other; (3) Abundant noise: lots of task-unrelated features or noise information within EHR data generally result in suboptimal performance. To tackle the above challenges, we propose a multilevel selective and interactive network (MeSIN) for medication recommendation. Specifically, MeSIN is designed with three components. First, an attentional selective module (ASM) is applied to assign flexible attention scores to different medical codes embeddings by their relevance to the recommended medications in every admission. Second, we incorporate a novel interactive long-short term memory network (InLSTM) to reinforce the interactions of multilevel medical sequences in EHR data with the help of the calibrated memory-augmented cell and an enhanced input gate. Finally, we employ a global selective fusion module (GSFM) to infuse the multi-sourced information embeddings into final patient representations for medications recommendation. To validate our method, extensive experiments have been conducted on a real-world clinical dataset. The results demonstrate a consistent superiority of our framework over several baselines and testify the effectiveness of our proposed approach.

cs.AI↗
arXiv2021

Optimal sensor and actuator placement for feedback control of vortex shedding

We consider linear feedback control of the two-dimensional flow past a cylinder at low Reynolds numbers, with a particular focus on the optimal placement of a single sensor and a single actuator. To accommodate the high dimensionality of the flow we compute its leading resolvent forcing and response modes to enable the design of H2-optimal estimators and controllers. We then investigate three control problems: i) optimal estimation (OE) in which we measure the flow at a single location and estimate the entire flow; ii) full-state information control (FIC) in which we measure the entire flow but actuate at only one location; and iii) the overall feedback control problem in which a single sensor is available for measurement and a single actuator is available for control. We characterize the performance of these control arrangements over a range of sensor and actuator placements and discuss implications for effective feedback control when using a single sensor and a single actuator. The optimal sensor and actuator placements found for the OE and FIC problems are also compared to those found for the overall feedback control problem over a range of Reynolds numbers. This comparison reveals the key factors and conflicting trade-offs that limit feedback control performance.

physics.flu-dyn↗
arXiv2021

Energy transfer mechanisms and resolvent analysis in the cylinder wake

Energy transfer mechanisms for vortex shedding behind a 2D cylinder at a Reynolds number of Re=100 are investigated. We first characterize the energy balances achieved by the true cylinder flow -- both for the flow as a whole and for each of its most energetic harmonic frequencies. It is found that viscous dissipation balances production when each is considered over the entire flow field and therefore that linear mechanisms achieve an energy balance on their own, thus respecting the Reynolds--Orr equation. Suitable energy conservation laws reveal that while nonlinear mechanisms neither produce nor consume energy overall, they nevertheless account for an important transfer of energy to higher frequencies. The energy balance for DNS is compared to that predicted by resolvent analysis. Although a suitable energy balance is achieved for each harmonic, resolvent analysis does not correctly model energy transfer between temporal frequencies. We further investigate the detailed roles of energy transfer from the viewpoint of nonlinear triadic interactions by considering a finite number of harmonic frequencies. It is shown that the nonlinearity plays a critical role in the redistribution of energy to higher harmonic frequencies. We observe not only an energy cascade from low frequencies to high frequencies, but also a considerable inverse cascade from high frequencies to low frequencies. The true nonlinear energy transfer mechanisms provide insight into closure models for improved resolvent-based predictions of harmonic modes in shear flows.

physics.flu-dyn↗
arXiv2021

Structured Diversification Emergence via Reinforced Organization Control and Hierarchical Consensus Learning

When solving a complex task, humans will spontaneously form teams and to complete different parts of the whole task, respectively. Meanwhile, the cooperation between teammates will improve efficiency. However, for current cooperative MARL methods, the cooperation team is constructed through either heuristics or end-to-end blackbox optimization. In order to improve the efficiency of cooperation and exploration, we propose a structured diversification emergence MARL framework named {\sc{Rochico}} based on reinforced organization control and hierarchical consensus learning. {\sc{Rochico}} first learns an adaptive grouping policy through the organization control module, which is established by independent multi-agent reinforcement learning. Further, the hierarchical consensus module based on the hierarchical intentions with consensus constraint is introduced after team formation. Simultaneously, utilizing the hierarchical consensus module and a self-supervised intrinsic reward enhanced decision module, the proposed cooperative MARL algorithm {\sc{Rochico}} can output the final diversified multi-agent cooperative policy. All three modules are organically combined to promote the structured diversification emergence. Comparative experiments on four large-scale cooperation tasks show that {\sc{Rochico}} is significantly better than the current SOTA algorithms in terms of exploration efficiency and cooperation strength.

cs.LG↗
arXiv2020

Learning Structured Communication for Multi-agent Reinforcement Learning

This work explores the large-scale multi-agent communication mechanism under a multi-agent reinforcement learning (MARL) setting. We summarize the general categories of topology for communication structures in MARL literature, which are often manually specified. Then we propose a novel framework termed as Learning Structured Communication (LSC) by using a more flexible and efficient communication topology. Our framework allows for adaptive agent grouping to form different hierarchical formations over episodes, which is generated by an auxiliary task combined with a hierarchical routing protocol. Given each formed topology, a hierarchical graph neural network is learned to enable effective message information generation and propagation among inter- and intra-group communications. In contrast to existing communication mechanisms, our method has an explicit while learnable design for hierarchical communication. Experiments on challenging tasks show the proposed LSC enjoys high communication efficiency, scalability, and global cooperation capability.

cs.LG↗
arXiv2020

A3: An Automatic Topology-Aware Malfunction Detection and Fixation System in Data Center Networks

Link failures and cable miswirings are not uncommon in building data center networks, which prevents the existing automatic address configuration methods from functioning correctly. However, accurately detecting such malfunctions is not an easy task because there could be no observable node degree changes. Fixing or correcting such malfunctions is even harder as almost no work can provide accurate fixation suggestions now. To solve the problems, we design and implement A3, an automatic topology-aware malfunction detection and fixation system. A3 innovatively formulates the problem of finding minimal fixation to the problem of computing minimum graph difference (NP-hard) and solves it in O(k^6) and O(k^3) for any less than k/2 and k/4 undirected link malfunctions for FatTree, respectively. Our evaluation demonstrates that for less than k/2 undirected link malfunctions, A3 is 100% accurate for malfunction detection and provides the minimum fixation result. For greater or equal to k/2 undirected link malfunctions, A3 still has accuracy of about 100% and provides the near optimal fixation result.

cs.NI↗
arXiv2019

Iteratively-Refined Interactive 3D Medical Image Segmentation with Multi-Agent Reinforcement Learning

Existing automatic 3D image segmentation methods usually fail to meet the clinic use. Many studies have explored an interactive strategy to improve the image segmentation performance by iteratively incorporating user hints. However, the dynamic process for successive interactions is largely ignored. We here propose to model the dynamic process of iterative interactive image segmentation as a Markov decision process (MDP) and solve it with reinforcement learning (RL). Unfortunately, it is intractable to use single-agent RL for voxel-wise prediction due to the large exploration space. To reduce the exploration space to a tractable size, we treat each voxel as an agent with a shared voxel-level behavior strategy so that it can be solved with multi-agent reinforcement learning. An additional advantage of this multi-agent model is to capture the dependency among voxels for segmentation task. Meanwhile, to enrich the information of previous segmentations, we reserve the prediction uncertainty in the state space of MDP and derive an adjustment action space leading to a more precise and finer segmentation. In addition, to improve the efficiency of exploration, we design a relative cross-entropy gain-based reward to update the policy in a constrained direction. Experimental results on various medical datasets have shown that our method significantly outperforms existing state-of-the-art methods, with the advantage of fewer interactions and a faster convergence.

cs.CV↗
arXiv2019

Heterogeneous Graph-based Knowledge Transfer for Generalized Zero-shot Learning

Generalized zero-shot learning (GZSL) tackles the problem of learning to classify instances involving both seen classes and unseen ones. The key issue is how to effectively transfer the model learned from seen classes to unseen classes. Existing works in GZSL usually assume that some prior information about unseen classes are available. However, such an assumption is unrealistic when new unseen classes appear dynamically. To this end, we propose a novel heterogeneous graph-based knowledge transfer method (HGKT) for GZSL, agnostic to unseen classes and instances, by leveraging graph neural network. Specifically, a structured heterogeneous graph is constructed with high-level representative nodes for seen classes, which are chosen through Wasserstein barycenter in order to simultaneously capture inter-class and intra-class relationship. The aggregation and embedding functions can be learned through graph neural network, which can be used to compute the embeddings of unseen classes by transferring the knowledge from their neighbors. Extensive experiments on public benchmark datasets show that our method achieves state-of-the-art results.

cs.LG↗
arXiv2019

Scalable Traffic Engineering for Higher Throughput in Heavily-loaded Software Defined Networks

Existing traffic engineering (TE) solutions performs well for software defined network (SDN) in average cases. However, during peak hours, bursty traffic spikes are challenging to handle, because it is difficult to react in time and guarantee high performance even after failures with limited flow entries. Instead of leaving some capacity empty to guarantee no congestion happens due to traffic rerouting after failures or path updating after demand or topology changes, we decide to make full use of the network capacity to satisfy the demands for heavily-loaded peak hours. The TE system also needs to react to failures quickly and utilize the priority queue to guarantee the transmission of loss and delay sensitive traffic. We propose TED, a scalable TE system that can guarantee high throughput in peak hours. TED can quickly compute a group of maximum number of edge-disjoint paths for each ingress-egress switch pair. We design two methods to select paths under the flow entry limit. We then input the selected paths to our TE to minimize the maximum link utilization. In case of large traffic matrix making the maximum link utilization larger than 1, we input the utilization and the traffic matrix to the optimization of maximizing overall throughput under a new constrain. Thus we obtain a realistic traffic matrix, which has the maximum overall throughput and guarantees no traffic starvation for each switch pair. Experiments show that TED has much better performance for heavily-loaded SDN and has 10% higher probability to satisfy all (> 99.99%) the traffic after a single link failure for G-Scale topology than Smore under the same flow entry limit.

cs.NI↗
arXiv2019

Feedback control of vortex shedding using a resolvent-based modelling approach

An investigation of optimal feedback controllers' performance and robustness is carried out for vortex shedding behind a 2D cylinder at low Reynolds numbers. To facilitate controller design, we present an efficient modelling approach in which we utilise the resolvent operator to recast the linearised Navier-Stokes equations into an input-output form from which frequency responses can be computed. The difficulty of applying modern control design techniques to complex, high-dimensional flow systems is thus overcome by using low-order models identified from these frequency responses. The low-order models are used to design optimal control laws using $\mathcal{H}_{\infty}$ loop shaping. Two distinct control arrangements are considered, both of which employ a single-input and a single-output. In the first control arrangement, a velocity sensor located in the wake drives a pair of body forces near the cylinder. Complete suppression of shedding is observed up to a Reynolds number of $Re=110$. Due to the convective nature of vortex shedding and the corresponding time delays, we observe a fundamental trade-off: the sensor should be close enough to the cylinder to avoid any excessive time lag, but it should be kept sufficiently far from the cylinder to measure any unstable modes developing downstream. It is found that these two conflicting requirements become more difficult to satisfy for larger Reynolds numbers. In the second control arrangement, we consider a practical setup with a body-mounted force sensor and an actuator that oscillates the cylinder according to the lift measurement. It is shown that the system is stabilised only up to $Re=100$, and we demonstrate why the performance of the resulting feedback controllers deteriorates much more rapidly with increasing Reynolds number. The challenges of designing robust controllers for each control setup are also analysed and discussed.

physics.flu-dyn↗
arXiv2019

1D-Convolutional Capsule Network for Hyperspectral Image Classification

Recently, convolutional neural networks (CNNs) have achieved excellent performances in many computer vision tasks. Specifically, for hyperspectral images (HSIs) classification, CNNs often require very complex structure due to the high dimension of HSIs. The complex structure of CNNs results in prohibitive training efforts. Moreover, the common situation in HSIs classification task is the lack of labeled samples, which results in accuracy deterioration of CNNs. In this work, we develop an easy-to-implement capsule network to alleviate the aforementioned problems, i.e., 1D-convolution capsule network (1D-ConvCapsNet). Firstly, 1D-ConvCapsNet separately extracts spatial and spectral information on spatial and spectral domains, which is more lightweight than 3D-convolution due to fewer parameters. Secondly, 1D-ConvCapsNet utilizes the capsule-wise constraint window method to reduce parameter amount and computational complexity of conventional capsule network. Finally, 1D-ConvCapsNet obtains accurate predictions with respect to input samples via dynamic routing. The effectiveness of the 1D-ConvCapsNet is verified by three representative HSI datasets. Experimental results demonstrate that 1D-ConvCapsNet is superior to state-of-the-art methods in both the accuracy and training effort.

cs.CV↗
arXiv2019

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several new graph reduction rules, allowing to reduce a graph G and the time needed to find a minimum weight vertex cover in G. Experiments on large graphs from real-world applications show that the reduction rules are effective and the resulting BMWVC algorithm outperforms relevant exact and heuristic MWVC algorithms.

cs.DS↗
arXiv2018

Multi-view Reconstructive Preserving Embedding for Dimension Reduction

With the development of feature extraction technique, one sample always can be represented by multiple features which locate in high-dimensional space. Multiple features can re ect various perspectives of one same sample, so there must be compatible and complementary information among the multiple views. Therefore, it's natural to integrate multiple features together to obtain better performance. However, most multi-view dimension reduction methods cannot handle multiple features from nonlinear space with high dimensions. To address this problem, we propose a novel multi-view dimension reduction method named Multi-view Reconstructive Preserving Embedding (MRPE) in this paper. MRPE reconstructs each sample by utilizing its k nearest neighbors. The similarities between each sample and its neighbors are primely mapped into lower-dimensional space in order to preserve the underlying neighborhood structure of the original manifold. MRPE fully exploits correlations between each sample and its neighbors from multiple views by linear reconstruction. Furthermore, MRPE constructs an optimization problem and derives an iterative procedure to obtain the low-dimensional embedding. Various evaluations based on the applications of document classification, face recognition and image retrieval demonstrate the effectiveness of our proposed approach on multi-view dimension reduction.

cs.CV↗
arXiv2016

Expensive control of long-time averages using sum of squares and its application to a laminar wake flow

The paper presents a nonlinear state-feedback control design approach for long-time average cost control, where the control effort is assumed to be expensive. The approach is based on sum-of-squares and semi-definite programming techniques. It is applicable to dynamical systems whose right-hand side is a polynomial function in the state variables and the controls. The key idea, first described but not implemented in (Chernyshenko et al., Phil. Trans. R. Soc. A, 372, 2014), is that the difficult problem of optimizing a cost function involving long-time averages is replaced by an optimization of the upper bound of the same average. As such, controller design requires the simultaneous optimization of both the control law and a tunable function, similar to a Lyapunov function. The present paper introduces a method resolving the well-known inherent non-convexity of this kind of optimization. The method is based on the formal assumption that the control is expensive, from which it follows that the optimal control is small. The resulting asymptotic optimization problems are convex. The derivation of all the polynomial coefficients in the controller is given in terms of the solvability conditions of state-dependent linear and bilinear inequalities. The proposed approach is applied to the problem of designing a full-information feedback controller that mitigates vortex shedding in the wake of a circular cylinder in the laminar regime via rotary oscillations. Control results on a reduced-order model of the actuated wake and in direct numerical simulation are reported.

math.OC↗
arXiv2013

From data towards knowledge: Revealing the architecture of signaling systems by unifying knowledge mining and data mining of systematic perturbation data

Genetic and pharmacological perturbation experiments, such as deleting a gene and monitoring gene expression responses, are powerful tools for studying cellular signal transduction pathways. However, it remains a challenge to automatically derive knowledge of a cellular signaling system at a conceptual level from systematic perturbation-response data. In this study, we explored a framework that unifies knowledge mining and data mining approaches towards the goal. The framework consists of the following automated processes: 1) applying an ontology-driven knowledge mining approach to identify functional modules among the genes responding to a perturbation in order to reveal potential signals affected by the perturbation; 2) applying a graph-based data mining approach to search for perturbations that affect a common signal with respect to a functional module, and 3) revealing the architecture of a signaling system organize signaling units into a hierarchy based on their relationships. Applying this framework to a compendium of yeast perturbation-response data, we have successfully recovered many well-known signal transduction pathways; in addition, our analysis have led to many hypotheses regarding the yeast signal transduction system; finally, our analysis automatically organized perturbed genes as a graph reflecting the architect of the yeast signaling system. Importantly, this framework transformed molecular findings from a gene level to a conceptual level, which readily can be translated into computable knowledge in the form of rules regarding the yeast signaling system, such as "if genes involved in MAPK signaling are perturbed, genes involved in pheromone responses will be differentially expressed".

q-bio.MN↗
arXiv2009

A Generalized Dressing Approach for Solving the Extended KP and the Extended mKP Hierarchy

A combination of dressing method and variation of constants as well as a formula for constructing the eigenfunction is used to solve the extended KP hierarchy, which is a hierarchy with one more series of time-flow and based on the symmetry constaint of KP hierarchy. Similarly, extended mKP hierarchy is formulated and its zero curvature form, Lax representation and reductions are presented. Via gauge transformation, it is easy to transform dressing solutions of extended KP hierarchy to the solutions of extended mKP hierarchy. Wronskian solutions of extended KP and extended mKP hierarchies are constructed explicitly.

nlin.SI↗