Search

We propose a scheme of using two fixed frequency resonator couplers to tune the coupling strength between two Xmon qubits. The induced indirect qubit-qubit interactions by two resonators could offset with each other, and the direct coupling between two qubits are not necessarily for switching off. The small direct qubit-quibt coupling could effectively suppress the frequency interval between switching off and switching on, and globally suppress the second and third-order static ZZ couplings. The frequencies differences between resonator couplers and qubits readout resonators are very large, this might be helpful for suppressing the qubits readout errors. The cross-kerr resonant processes between a qubit and two resonators might induce pole and affect the crosstalks between qubits. The double resonator couplers could unfreeze the restrictions on capacitances and coupling strengths in the superconducting circuit, and it can also reduce the flux noises and globally suppress the crosstalks., Comment: 19 page, 8 figures Accepted by Physical Review A

An edge colouring of $K_n$ with $k$ colours is a Gallai $k$-colouring if it does not contain any rainbow triangle. Gy\'arf\'as, P\'alv\"olgyi, Patk\'os and Wales proved that there exists a number $g(k)$ such that $n\geq g(k)$ if and only if for any colour distribution sequence $(e_1,\cdots,e_k)$ with $\sum_{i=1}^ke_i=\binom{n}{2}$, there exist a Gallai $k$-colouring of $K_n$ with $e_i$ edges having colour $i$. They also showed that $\Omega(k)=g(k)=O(k^2)$ and posed the problem of determining the exact order of magnitude of $g(k)$. Feffer, Fu and Yan improved both bounds significantly by proving $\Omega(k^{1.5}/\log k)=g(k)=O(k^{1.5})$. We resolve this problem by showing $g(k)=\Theta(k^{1.5}/(\log k)^{0.5})$., Comment: This result is absorbed into my new paper arXiv:2309.05606 (coauthored with Zhuo Wu), which also studies the generalised version of this problem

Compared with random sampling, low-discrepancy sampling is more effective in covering the search space. However, the existing research cannot definitely state whether the impact of a low-discrepancy sample on particle swarm optimization (PSO) is positive or negative. Using Niderreiter's theorem, this study completes an error analysis of PSO, which reveals that the error bound of PSO at each iteration depends on the dispersion of the sample set in an expanded dimensional space. Based on this error analysis, an acceleration technique for PSO-type algorithms is proposed with low-discrepancy sampling in the expanded dimensional space. The acceleration technique can generate a low-discrepancy sample set with a smaller dispersion, compared with a random sampling, in the expanded dimensional space; it also reduces the error at each iteration, and hence improves the convergence speed. The acceleration technique is combined with the standard PSO and the comprehensive learning particle swarm optimization, and the performance of the improved algorithm is compared with the original algorithm. The experimental results show that the two improved algorithms have significantly faster convergence speed under the same accuracy requirement., Comment: 29 pages, 0 figures

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of \textit{Insight}-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first $\sim$1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from $\sim$ 10 keV to $\sim$ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy ($E_{\rm iso}$) of $\bf \sim 1.5 \times 10^{55}$ erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at $\sim950$ s from the afterglow starting time $T_{AG}$, which corresponds to a jet opening angle of $\sim {0.7^\circ} \ (\eta_\gamma n)^{1/8}$, where $n$ is the ambient medium density in units of $\rm cm^{-3}$ and $\eta_\gamma$ is the ratio between $\gamma$-ray energy and afterglow kinetic energy. The beaming-corrected total $\gamma$-ray energy $E_{\gamma}$ is $\sim 1.15 \times10^{51} \ (\eta_\gamma n)^{1/4}$ erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement., Comment: Submitted to National Science Review. This paper is under press embargo, contact the corresponding author for details

The oscillation phenomena associated with the control of voltage source converters (VSCs) are widely concerning, and locating the source of these oscillations is crucial to suppressing them; therefore, this paper presents a locating scheme, based on the energy structure and nonlinearity detection. On the one hand, the energy structure, which conforms with the principle of the energy-based method and dissipativity theory, is constructed to describe the transient energy flow for VSCs, and on this basis, a defined characteristic quantity is implemented to narrow the scope of oscillation source location; on the other hand, according to the self-sustained oscillation characteristics of VSCs, an index for nonlinearity detection is applied to locate the VSCs which produce the oscillation energy. The combination of the energy structure and nonlinearity detection could distinguish the contributions of different VSCs to the oscillation. The results of a case study implemented by the PSCAD/EMTDC simulation validate the proposed scheme.

Preferential attachment (PA) network models have a wide range of applications in various scientific disciplines. Efficient generation of large-scale PA networks helps uncover their structural properties and facilitate the development of associated analytical methodologies. Existing software packages only provide limited functions for this purpose with restricted configurations and efficiency. We present a generic, user-friendly implementation of weighted, directed PA network generation with R package wdnet. The core algorithm is based on an efficient binary tree approach. The package further allows adding multiple edges at a time, heterogeneous reciprocal edges, and user-specified preference functions. The engine under the hood is implemented in C++. Usages of the package are illustrated with detailed explanation. A benchmark study shows that wdnet is efficient for generating general PA networks not available in other packages. In restricted settings that can be handled by existing packages, wdnet provides comparable efficiency., Comment: 19 pages, 4 figures

LAMOST-MRS-B is one of the sub-surveys of LAMOST medium-resolution (R~7500) spectroscopic survey. It aims at studying the statistical properties (e.g., binary fraction, orbital period distribution, mass ratio distribution) of binary stars and exotic stars. We intend to observe about 30000 stars (10 mag <= G <= 14.5 mag) with at least 10 visits in five years. We first planned to observe 25 plates around the galactic plane in 2018. Then the plates were reduced to 12 in 2019 because of the limitation of observation. At the same time, two new plates located at the high galactic latitude were added to explore binary properties influenced by the different environments. In this survey project, we set the identified exotic and low-metallicity stars with the highest observation priorities. For the rest of the selected stars, we gave higher priority to the relatively brighter stars in order to obtain high-quality spectra as many as possible. Spectra of 49129 stars have been obtained in LAMOST-MRS-B field and released in DR8, of which 28828 and 3375 stars have been visited more than twice and ten times with SNR >= 10, respectively. Most of the sources are B-, A-, and F-type stars with 0.6 < [Fe/H] < 0.4 dex. We also obtain 347 identified variable and exotic stars and about 250 stars with [Fe/H] < 1 dex. We measure radial velocities (RVs) by using 892233 spectra of the stars. The uncertainties of RV achieve about 1 km/s and 10 km/s1 for 95% of late- and early-type stars, respectively. The datasets presented in this paper are available at http://www.doi.org/10.57760/sciencedb.j00113.00035.

A third order self-adjoint differential operator with periodic boundary conditions and an one-dimensional perturbation has been considered. For this operator, we first show that the spectrum consists of simple eigenvalues and finitely many eigenvalues of multiplicity two. Then the expressions of eigenfunctions and resolvent are described. Finally, the inverse problems for recovering all the components of the one-dimensional perturbation are solved. In particular, we prove the Ambarzumyan-type theorem and show that the even or odd potential can be reconstructed by three spectra.

Coherently driven semiconductor quantum dots are one of the most promising platforms for non-classical light sources and quantum logic gates which form the foundation of photonic quantum technologies. However, to date, coherent manipulation of single charge carriers in quantum dots is limited mainly to their lowest orbital states. Ultrafast coherent control of high-orbital states is obstructed by the demand for tunable terahertz pulses. To break this constraint, we demonstrate an all-optical method to control high-orbital states of a hole via stimulated Auger process. The coherent nature of the Auger process is proved by Rabi oscillation and Ramsey interference. Harnessing this coherence further enables the investigation of single-hole relaxation mechanism. A hole relaxation time of 161 ps is observed and attributed to the phonon bottleneck effect. Our work opens new possibilities for understanding the fundamental properties of high-orbital states in quantum emitters and developing new types of orbital-based quantum photonic devices., Comment: Manuscript with 14 pages and 6 figures plus supplementary Information comprising 15 pages and 14 figures. Nature Nanotechnology (24 July 2023)

Quantile regression is increasingly encountered in modern big data applications due to its robustness and flexibility. We consider the scenario of learning the conditional quantiles of a specific target population when the available data may go beyond the target and be supplemented from other sources that possibly share similarities with the target. A crucial question is how to properly distinguish and utilize useful information from other sources to improve the quantile estimation and inference at the target. We develop transfer learning methods for high-dimensional quantile regression by detecting informative sources whose models are similar to the target and utilizing them to improve the target model. We show that under reasonable conditions, the detection of the informative sources based on sample splitting is consistent. Compared to the naive estimator with only the target data, the transfer learning estimator achieves a much lower error rate as a function of the sample sizes, the signal-to-noise ratios, and the similarity measures among the target and the source models. Extensive simulation studies demonstrate the superiority of our proposed approach. We apply our methods to tackle the problem of detecting hard-landing risk for flight safety and show the benefits and insights gained from transfer learning of three different types of airplanes: Boeing 737, Airbus A320, and Airbus A380.

DCOP algorithms usually rely on interaction graphs to operate. In open and dynamic environments, such methods need to address how this interaction graph is generated and maintained among agents. Existing methods require reconstructing the entire graph upon detecting changes in the environment or assuming that new agents know potential neighbors to facilitate connection. We propose a novel distributed interaction graph construction algorithm to address this problem. The proposed method does not assume a predefined constraint graph and stabilizes after disruptive changes in the environment. We evaluate our approach by pairing it with existing DCOP algorithms to solve several generated dynamic problems. The experiment results show that the proposed algorithm effectively constructs and maintains a stable multi-agent interaction graph for open and dynamic environments., Comment: Presented at PKAW 2022 (arXiv:2211.03888) Report-no: PKAW/2022/05

Loan seasoning and inefficient consumer interest rate refinance behavior are well-known for mortgages. Consumer automobile loans, which are collateralized loans on a rapidly depreciating asset, have attracted less attention, however. We derive a novel large-sample statistical hypothesis test suitable for loans sampled from asset-backed securities to populate a transition matrix between risk bands. We find all current risk bands eventually converge to a super-prime credit, despite remaining underwater. Economically, our results imply borrowers forwent \$1,153-\$2,327 in potential credit-based savings through delayed prepayment. We present an expected present value analysis to derive lender risk-adjusted profitability. Our results appear robust to COVID-19.

The information bottleneck (IB) method is a feasible defense solution against adversarial attacks in deep learning. However, this method suffers from the spurious correlation, which leads to the limitation of its further improvement of adversarial robustness. In this paper, we incorporate the causal inference into the IB framework to alleviate such a problem. Specifically, we divide the features obtained by the IB method into robust features (content information) and non-robust features (style information) via the instrumental variables to estimate the causal effects. With the utilization of such a framework, the influence of non-robust features could be mitigated to strengthen the adversarial robustness. We make an analysis of the effectiveness of our proposed method. The extensive experiments in MNIST, FashionMNIST, and CIFAR-10 show that our method exhibits the considerable robustness against multiple adversarial attacks. Our code would be released.

The nonleptonic decays $B_{d,s} \to K^{*0} {\overline K^{*0}}$ are reanalyzed in perturbative QCD approach, which is based on the $k_{\rm T}$ factorization. In the standard model, the calculated branching fraction and longitudinal polarization fraction of $B_{d} \to K^{*0} {\overline K^{*0}}$ are in agreement with experimental measurements, while the predictions of $B_{s} \to K^{*0} {\overline K^{*0}}$ cannot agree with data simultaneously. The parameter that combines of longitudinal polarization fractions and branching fractions evaluated to be $L_{K^*\overline{K}^{*0}}^{\rm PQCD}= 12.7^{+5.6} _{-3.2}$, which is also larger than that abstracted from experimental measurements. We then study all observables by introducing a family non-universal $Z^{\prime}$ boson in $b\to s q\bar q$ transitions. In order to reduce the number of new parameters, we simplify the model as possible. It is found that with the fixed value $\omega_{B_s}=0.55$, these exists parameter space where all measurements, including the branching fraction, longitudinal polarization fraction and $L_{K^*\overline{K}^{*0}}$-parameter, could be accommodated simultaneously. All our results and the small parameter space could be further tested in the running LHC experiments, Belle-II and future high-energy colliders., Comment: 21 pages, 6 figures

The extraction of contrast-filled vessels from X-ray coronary angiography (XCA) image sequence has important clinical significance for intuitively diagnosis and therapy. In this study, the XCA image sequence is regarded as a 3D tensor input, the vessel layer is regarded as a sparse tensor, and the background layer is regarded as a low-rank tensor. Using tensor nuclear norm (TNN) minimization, a novel method for vessel layer extraction based on tensor robust principal component analysis (TRPCA) is proposed. Furthermore, considering the irregular movement of vessels and the low-frequency dynamic disturbance of surrounding irrelevant tissues, the total variation (TV) regularized spatial-temporal constraint is introduced to smooth the foreground layer. Subsequently, for vessel layer images with uneven contrast distribution, a two-stage region growing (TSRG) method is utilized for vessel enhancement and segmentation. A global threshold method is used as the preprocessing to obtain main branches, and the Radon-Like features (RLF) filter is used to enhance and connect broken minor segments, the final binary vessel mask is constructed by combining the two intermediate results. The visibility of TV-TRPCA algorithm for foreground extraction is evaluated on clinical XCA image sequences and third-party dataset, which can effectively improve the performance of commonly used vessel segmentation algorithms. Based on TV-TRPCA, the accuracy of TSRG algorithm for vessel segmentation is further evaluated. Both qualitative and quantitative results validate the superiority of the proposed method over existing state-of-the-art approaches., Comment: 34pages, 14figures, 5tables

Motivated by the problem of global stability of thermodynamical equilibria in non-equilibrium thermodynamics formulated in a recent paper [12], we introduce some mechanisms for constructing semi-infinite orbits of contact Hamiltonian systems connecting two Legendrian graphs from the viewpoint of Aubry-Mather theory and weak KAM theory., Comment: 25 pages, 1 figure, communications and comments are welcome!

Code review is one of the best practices as a powerful safeguard for software quality. In practice, senior or highly skilled reviewers inspect source code and provide constructive comments, considering what authors may ignore, for example, some special cases. The collaborative validation between contributors results in code being highly qualified and less chance of bugs. However, since personal knowledge is limited and varies, the efficiency and effectiveness of code review practice are worthy of further improvement. In fact, it still takes a colossal and time-consuming effort to deliver useful review comments. This paper explores a synergy of multiple practical review comments to enhance code review and proposes AUGER (AUtomatically GEnerating Review comments): a review comments generator with pre-training models. We first collect empirical review data from 11 notable Java projects and construct a dataset of 10,882 code changes. By leveraging Text-to-Text Transfer Transformer (T5) models, the framework synthesizes valuable knowledge in the training stage and effectively outperforms baselines by 37.38% in ROUGE-L. 29% of our automatic review comments are considered useful according to prior studies. The inference generates just in 20 seconds and is also open to training further. Moreover, the performance also gets improved when thoroughly analyzed in case study., Comment: Accepted by ESEC/FSE-2022

Accurate modeling of spatial dependence is pivotal in analyzing spatial data, influencing parameter estimation and out-of-sample predictions. The spatial structure and geometry of the data significantly impact valid statistical inference. Existing models for areal data often rely on adjacency matrices, struggling to differentiate between polygons of varying sizes and shapes. Conversely, data fusion models, while effective, rely on computationally intensive numerical integrals, presenting challenges for moderately large datasets. In response to these issues, we propose the Hausdorff-Gaussian process (HGP), a versatile model class utilizing the Hausdorff distance to capture spatial dependence in both point and areal data. We introduce a valid correlation function within the HGP framework, accommodating diverse modeling techniques, including geostatistical and areal models. Integration into generalized linear mixed-effects models enhances its applicability, particularly in addressing change of support and data fusion challenges. We validate our approach through a comprehensive simulation study and application to two real-world scenarios: one involving areal data and another demonstrating its effectiveness in data fusion. The results suggest that the HGP is competitive with specialized models regarding goodness-of-fit and prediction performances. In summary, the HGP offers a flexible and robust solution for modeling spatial data of various types and shapes, with potential applications spanning fields such as public health and climate science.

Modern Python projects execute computational functions using native libraries and give Python interfaces to boost execution speed; hence, testing these libraries becomes critical to the project's robustness. One challenge is that existing approaches use coverage to guide generation, but native libraries run as black boxes to Python code with no execution information. Another is that dynamic binary instrumentation reduces testing performance as it needs to monitor both native libraries and the Python virtual machine. To address these challenges, in this paper, we propose an automated test case generation approach that works at the Python code layer. Our insight is that many path conditions in native libraries are for processing input data structures through interacting with the VM. In our approach, we instrument the Python Interpreter to monitor the interactions between native libraries and VM, derive constraints on the structures, and then use the constraints to guide test case generation. We implement our approach in a tool named PyCing and apply it to six widely-used Python projects. The experimental results reveal that with the structure constraint guidance, PyCing can cover more execution paths than existing test cases and state-of-the-art tools. Also, with the checkers in the testing framework Pytest, PyCing can identify segmentation faults in 10 Python interfaces and memory leaks in 9. Our instrumentation strategy also has an acceptable influence on testing efficiency., Comment: 11 panges

In this work, we propose FedSSO, a server-side second-order optimization method for federated learning (FL). In contrast to previous works in this direction, we employ a server-side approximation for the Quasi-Newton method without requiring any training data from the clients. In this way, we not only shift the computation burden from clients to server, but also eliminate the additional communication for second-order updates between clients and server entirely. We provide theoretical guarantee for convergence of our novel method, and empirically demonstrate our fast convergence and communication savings in both convex and non-convex settings.

Adversarial training methods are state-of-the-art (SOTA) empirical defense methods against adversarial examples. Many regularization methods have been proven to be effective with the combination of adversarial training. Nevertheless, such regularization methods are implemented in the time domain. Since adversarial vulnerability can be regarded as a high-frequency phenomenon, it is essential to regulate the adversarially-trained neural network models in the frequency domain. Faced with these challenges, we make a theoretical analysis on the regularization property of wavelets which can enhance adversarial training. We propose a wavelet regularization method based on the Haar wavelet decomposition which is named Wavelet Average Pooling. This wavelet regularization module is integrated into the wide residual neural network so that a new WideWaveletResNet model is formed. On the datasets of CIFAR-10 and CIFAR-100, our proposed Adversarial Wavelet Training method realizes considerable robustness under different types of attacks. It verifies the assumption that our wavelet regularization method can enhance adversarial robustness especially in the deep wide neural networks. The visualization experiments of the Frequency Principle (F-Principle) and interpretability are implemented to show the effectiveness of our method. A detailed comparison based on different wavelet base functions is presented. The code is available at the repository: \url{https://github.com/momo1986/AdversarialWaveletTraining}., Comment: Preprint version

Backdoor attacks have become an emerging threat to NLP systems. By providing poisoned training data, the adversary can embed a "backdoor" into the victim model, which allows input instances satisfying certain textual patterns (e.g., containing a keyword) to be predicted as a target label of the adversary's choice. In this paper, we demonstrate that it is possible to design a backdoor attack that is both stealthy (i.e., hard to notice) and effective (i.e., has a high attack success rate). We propose BITE, a backdoor attack that poisons the training data to establish strong correlations between the target label and a set of "trigger words". These trigger words are iteratively identified and injected into the target-label instances through natural word-level perturbations. The poisoned training data instruct the victim model to predict the target label on inputs containing trigger words, forming the backdoor. Experiments on four text classification datasets show that our proposed attack is significantly more effective than baseline methods while maintaining decent stealthiness, raising alarm on the usage of untrusted training data. We further propose a defense method named DeBITE based on potential trigger word removal, which outperforms existing methods in defending against BITE and generalizes well to handling other backdoor attacks., Comment: Accepted to ACL 2023

In this paper, we investigate the medium modifications of $p_{T}$ dispersion($p_{T}D$) of inclusive jets with small radius ($R=0.2$) in Pb+Pb collisions at $\sqrt{s}=2.76$~TeV. The partonic spectrum in the initial hard scattering of elementary collisions are obtained by an event generator POWHEG+PYTHIA, which matches the next-to-leading (NLO) matrix elements with parton showering, and energy loss of fast parton traversing in hot/dense QCD medium is calculated by Monte Carlo simulation within Higher-Twist formalism of jet quenching in heavy-ion collisions. We present the model calculations of normalized $p_{T}D$ distributions for inclusive jets in p+p and Pb+Pb collisions at $\sqrt{s}=2.76$~TeV, which give nice descriptions of ALICE measurements. It is shown that the $p_{T}D$ distributions of inclusive jets in Pb+Pb are shifted to higher $p_{T}D$ region relative to that in p+p. Thus the nuclear modification factor of $p_{T}D$ distributions for inclusive jets is smaller than unity at small $p_{T}D$ region, while larger than one at large $p_{T}D$ region. This behaviour results from more uneven $p_T$ of jet constituents as well as the fraction alteration of gluon/quark initiated jets in heavy-ion collisions. The difference of $p_{T}D$ distributions between groomed and ungroomed jets in Pb+Pb collisions are also discussed.

Non-fullerene acceptors (NFAs) are excellent light harvesters, yet the origin of such high optical extinction is not well understood. In this work, we investigate the absorption strength of NFAs by building a database of time-dependent density functional theory (TDDFT) calculations of ~500 pi-conjugated molecules. The calculations are first validated by comparison with experimental measurements on liquid and solid state using common fullerene and non-fullerene acceptors. We find that the molar extinction coefficient ({\epsilon}_(d,max)) shows reasonable agreement between calculation in vacuum and experiment for molecules in solution, highlighting the effectiveness of TDDFT for predicting optical properties of organic pi-conjugated molecules. We then perform a statistical analysis based on molecular descriptors to identify which features are important in defining the absorption strength. This allows us to identify structural features that are correlated with high absorption strength in NFAs and could be used to guide molecular design: highly absorbing NFAs should possess a planar, linear, and fully conjugated molecular backbone with highly polarisable heteroatoms. We then exploit a random decision forest to draw predictions for {\epsilon}_(d,max) using a computational framework based on extended tight-binding Hamiltonians, which shows reasonable predicting accuracy with lower computational cost than TDDFT. This work provides a general understanding of the relationship between molecular structure and absorption strength in pi-conjugated organic molecules, including NFAs, while introducing predictive machine-learning models of low computational cost., Comment: 40 pages and 5 figures (main text)

We propose a scheme of tunable coupler based on quarter-wave resonator for scalable quantum integrated circuits. The open end of the T-type resonator is capacitively coupled to two Xmon qubits, while another end is an asymmetric dc-SQUID which dominates the inductive energy of coupler resonator. The dc-Current applied through the flux bias line could change the magnetic flux inside the dc-SQUID, so the frequency of coupler resonator can be effectively tuned and the qubit-qubit coupling can be totally switched off. As the increase of junction asymmetry for the dc-SQUID, the coupling of SQUID's effective phase difference and cavity modes become smaller at required working frequency regime of coupler resonator, and this could reduce the descent of the resonator's quality factor. The separation between two cross-capacitor can be larger with help of transverses width of the T-shape resonator, and then the ZZ crosstalk coupling can be effectively suppressed. The asymmetric dc-SQUID is about 5 millimeters away from the Xmon qubits and only needs a small current on the flux bias line, which in principle creates less flux noises to superconducting Xmon qubits., Comment: 8 pages, 5 figures

Migration legacy systems to cloud platforms is a knowledge intensive process. There is an ever increasing body of knowledge reporting empirical scenarios of successful and problematic cloud migration. Reusing this body of knowledge, dispersed and fragmented over the academic/multi-vocal literature, has practical values to mitigate costly risks and pitfalls in further projects of legacy to-cloud and cloud-to-cloud migration. In line with this, knowledge management systems/platforms pertinent to cloud migration are a prime prerequisite and a strategic imperative for an organization. We have conducted a qualitative exploratory study to understand the benefits and challenges of developing Knowledge Management Systems (KMS) for cloud migration in real trials. Whilst our prototype system demonstration supported the importance and bene-fits of developing Cloud Migration KMS (CM-KMS), our semi-structured industry interview study with 11 participants highlighted challenging impediments against developing this class of KMS. As a result, this study proposes nine significant challenges that cause the abandon of the design and maintenance of CM-KMS, including continuous changes and updates, integration of knowledge, knowledge granularity, preservation of context, automation, deconstruction of traditional knowledge, dependency on experts, hybrid knowledge of both vendor-specific and vendor-neutral cloud platforms, and parsimony. Our results inform cloud architects to pay attention to adopt CM-KMS for the legacy-to-cloud migration in their organizations.

In this paper, we discuss the existence and multiplicity problem of viscosity solution to the Hamilton-Jacobi equation $$h(x,d_x u)+\lambda(x)u=c,\quad x\in M,$$ where $M$ is a closed manifold and $\lambda:M\rightarrow\mathbb{R}$ changes signs on $M$, via nonlinear semigroup method. It turns out that a bifurcation phenomenon occurs when parameter $c$ strides over the critical value. As an application of the main result, we analyse the structure of the set of viscosity solutions of an one-dimensional example in detail.