11,187 research outputs found

    An Application of Nash-Moser Theorem to Smooth Solutions of One-Dimensional Compressible Euler Equation with Gravity

    Full text link
    We study one-dimensional motions of polytropic gas governed by the compressible Euler equations. The problem on the half space under a constant gravity gives an equilibrium which has free boundary touching the vacuum and the linearized approximation at this equilibrium gives time periodic solutions. But it is not easy to justify the existence of long-time true solutions for which this time periodic solution is the first approximation. The situation is in contrast to the problem of free motions without gravity. The reason is that the usual iteration method for quasilinear hyperbolic problem cannot be used because of the loss of regularities which causes from the touch with the vacuum. Interestingly, the equation can be transformed to a nonlinear wave equation on a higher dimensional space, for which the space dimension, being larger than 4, is related to the adiabatic exponent of the original one-dimensional problem. We try to find a family of solutions expanded by a small parameter. Applying the Nash-Moser theory, we justify this expansion.The application of the Nash-Moser theory is necessary for the sake of conquest of the trouble with loss of regularities, and the justification of the applicability requires a very delicate analysis of the problem

    DARTS-ASR: Differentiable Architecture Search for Multilingual Speech Recognition and Adaptation

    Full text link
    In previous works, only parameter weights of ASR models are optimized under fixed-topology architecture. However, the design of successful model architecture has always relied on human experience and intuition. Besides, many hyperparameters related to model architecture need to be manually tuned. Therefore in this paper, we propose an ASR approach with efficient gradient-based architecture search, DARTS-ASR. In order to examine the generalizability of DARTS-ASR, we apply our approach not only on many languages to perform monolingual ASR, but also on a multilingual ASR setting. Following previous works, we conducted experiments on a multilingual dataset, IARPA BABEL. The experiment results show that our approach outperformed the baseline fixed-topology architecture by 10.2% and 10.0% relative reduction on character error rates under monolingual and multilingual ASR settings respectively. Furthermore, we perform some analysis on the searched architectures by DARTS-ASR.Comment: Accepted at INTERSPEECH 202

    Prioritizing disease candidate genes by a gene interconnectedness-based approach

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Genome-wide disease-gene finding approaches may sometimes provide us with a long list of candidate genes. Since using pure experimental approaches to verify all candidates could be expensive, a number of network-based methods have been developed to prioritize candidates. Such tools usually have a set of parameters pre-trained using available network data. This means that re-training network-based tools may be required when existing biological networks are updated or when networks from different sources are to be tried.</p> <p>Results</p> <p>We developed a parameter-free method, interconnectedness (ICN), to rank candidate genes by assessing the closeness of them to known disease genes in a network. ICN was tested using 1,993 known disease-gene associations and achieved a success rate of ~44% using a protein-protein interaction network under a test scenario of simulated linkage analysis. This performance is comparable with those of other well-known methods and ICN outperforms other methods when a candidate disease gene is not directly linked to known disease genes in a network. Interestingly, we show that a combined scoring strategy could enable ICN to achieve an even better performance (~50%) than other methods used alone.</p> <p>Conclusions</p> <p>ICN, a user-friendly method, can well complement other network-based methods in the context of prioritizing candidate disease genes.</p

    On the extremal number of edges in hamiltonian connected graphs

    Get PDF
    AbstractAssume that n and Ī“ are positive integers with 3ā‰¤Ī“<n. Let hc(n,Ī“) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree Ī“(G)ā‰„Ī“ to be hamiltonian connected. Any n-vertex graph G with Ī“(G)ā‰„Ī“ is hamiltonian connected if |E(G)|ā‰„hc(n,Ī“). We prove that hc(n,Ī“)=C(nāˆ’Ī“+1,2)+Ī“2āˆ’Ī“+1 if Ī“ā‰¤āŒŠn+3Ɨ(nmod2)6āŒ‹+1, hc(n,Ī“)=C(nāˆ’āŒŠn2āŒ‹+1,2)+āŒŠn2āŒ‹2āˆ’āŒŠn2āŒ‹+1 if āŒŠn+3Ɨ(nmod2)6āŒ‹+1<Ī“ā‰¤āŒŠn2āŒ‹, and hc(n,Ī“)=āŒˆnĪ“2āŒ‰ if Ī“>āŒŠn2āŒ‹

    Angelica Sinensis promotes myotube hypertrophy through the PI3K/Akt/mTOR pathway

    Get PDF
    BACKGROUND: Angelica Sinensis (AS), a folk medicine, has long been used in ergogenic aids for athletes, but there is little scientific evidence supporting its effects. We investigated whether AS induces hypertrophy in myotubes through the phosphatidylinositol 3-kinase (PI3K)/Akt (also termed PKB)/mammalian target of the rapamycin (mTOR) pathway. METHODS: An in vitro experiment investigating the induction of hypertrophy in myotubes was conducted. To investigate whether AS promoted the hypertrophy of myotubes, an established in vitro model of myotube hypertrophy with and without AS was used and examined using microscopic images. The role of the PI3K/Akt/mTOR signaling pathway in AS-induced myotube hypertrophy was evaluated. Two inhibitors, wortmannin (an inhibitor of PI3K) and rapamycin (an inhibitor of mTOR), were used. RESULT: The results revealed that the myotube diameters in the AS-treated group were significantly larger than those in the untreated control group (Pā€‰<ā€‰0.05). Wortmannin and rapamycin inhibited AS-induced hypertrophy. Furthermore, AS increased Akt and mTOR phosphorylation through the PI3K pathway and induced myotube hypertrophy. CONCLUSION: The results confirmed that AS induces hypertrophy in myotubes through the PI3K/Akt/mTOR pathway

    Travelling wave solutions for Kolmogorov-type delayed lattice reactionā€“diffusion systems

    Get PDF
    [[abstract]]This work investigates the existence and non-existence of travelling wave solutions for Kolmogorov-type delayed lattice reactionā€“diffusion systems. Employing the cross iterative technique coupled with the explicit construction of upper and lower solutions in the theory of quasimonotone dynamical systems, we can find two threshold speeds cāˆ— and cāˆ— with cāˆ—ā‰„cāˆ—>0. If the wave speed is greater than cāˆ—, then we establish the existence of travelling wave solutions connecting two different equilibria. On the other hand, if the wave speed is smaller than cāˆ—, we further prove the non-existence result of travelling wave solutions. Finally, several ecological examples including one-species, two-species and three-species models with various functional responses and time delays are presented to illustrate the analytical results.[[notice]]č£œę­£å®Œē•¢[[journaltype]]國外[[incitationindex]]SCI[[ispeerreviewed]]Y[[booktype]]ē“™ęœ¬[[countrycodes]]GB
    • ā€¦
    corecore