1,517 research outputs found
A Smooth 1-Parameter Family of Delaunay-Type Domains for an Overdetermined Elliptic Problem in and
No full textWe prove the existence of a non-compact smooth one-parameter family of domains Ωs⊂Mn×R, where Mn denotes the Riemannian manifold Sn or Hn (for n≥2), bifurcating from the straight cylinder B1×R (where B1 is a geodesic unit ball in Mn) such that there exists a positive solution u to (Formula presented.) for some positive constant λ, where g is the standard metric in Mn×R, and ν represents the unit normal vector about ∂Ωs. The domains Ωs are not straight cylinders but are periodic in the direction of R. This improves a previous result by the second and third author
sj-docx-1-tct-10.1177_15330338221144510 - Supplemental material for Role of Plasma methylated SEPT9 for Predicting Microvascular Invasion and Tumor Proliferation in Hepatocellular Carcinoma
No full textSupplemental material, sj-docx-1-tct-10.1177_15330338221144510 for Role of Plasma methylated SEPT9 for Predicting Microvascular Invasion and Tumor Proliferation in Hepatocellular Carcinoma by Fei Huang, Guowei Yang, Huiqin Jiang, Xinning Chen, Yihui Yang, Qian Yu, Baishen Pan, Beili Wang, Wei Guo, Wenjing Yang and Chunyan Zhang in Technology in Cancer Research & Treatment</p
“The formation of modern written language. Writing categories and polysyllabic words”
No full textIn his “Wenxue gailiang chuyi” (A tentative proposal for the reform of literature), Hu Shi set forth the necessity to reform both the gist and the form of literature. Thereafter, he recognised the close connection between the reform of literature and that of the Chinese language, advancing the proposals of “Jianshe de wenxue geming lun: guoyu de wenxue, wenxue de guoyu” (The theory of a constructive literary revolution: a literature in the national language, a national literary language). Nevertheless, when looking at the history of the Xixue Dongjian (The transfer of Western knowledge to the East) from the 16th century onwards, the connections between the Chinese language and the presentation of modern knowledge, i.e. the recounting of science, are broader and more thorough than the contents touched upon by “literature”. A question of the uttermost importance was how to employ the Chinese language to narrate science; after Hu Shi, personalities such as Chen Duxiu, Liu Bannong and Fu Sinian discussed the difference between literary and non-literary writings from the perspective of language form. In this article, the author examines the possibility for the Chinese language to convey modern knowledge at the turn of the 19th and 20th century, what transformations the Chinese language required in order to achieve this purpose and the question of whether the national language dictionary Ciyuan prepared the way for it
API Change Driven Test Selection for Android Applications
No full textPeople are becoming increasingly dependent on their mobile devices day after day. As a result, mobile developers strive to introduce innovative applications (or simply apps) with new functionalities and features. To keep up with this need; Android Application Programing Interfaces (APIs) are updated frequently, which can affect the functionality of the Android apps that are built upon them. Developers therefore need to test their apps between each update to ensure high reliability. However, running the entire test suite can be costly and time-consuming. Previous research has focused on how Android API change impacts the app code, but no research has extended this finding to further analyze the API change impact on app tests to help increase the efficiency of API change driven regression testing. This paper introduces a novel approach which leverages the results from app code impact analysis and coverage information to identify the tests that are impacted by the API changes. The results of experiments on real-world android mobile apps show that this approach increases the efficiency of android app testing by reducing the number of tests selected for re-execution and thus reducing the time needed for regression testing.Computer Scienc
Block and parallel modelling of broad domain nonlinear continuous mapping based on NN
No full textThe necessity of the use of the block and parallel modeling of the nonlinear continuous mappings with NN is firstly expounded quantitatively. Then, a practical approach for the block and parallel modeling of the nonlinear continuous mappings with NN is proposed. Finally, an example indicating that the method raised in this paper can be realized by suitable existed software is given. The results of the experiment of the model discussed on the 3-D Mexican straw hat indicate that the block and parallel modeling based on NN is more precise and faster in computation than the direct ones and it is obviously a concrete example and the development of the large-scale general model established by Tu Xuyan
Recommended from our members
Compositional symbolic execution with memoized replay
No full texttextSymbolic execution is a powerful, systematic analysis that has received much visibility in the last decade. Scalability however remains a major challenge for symbolic execution. Compositional analysis is a well-known general purpose methodology for increasing scalability. This thesis introduces a new approach for compositional symbolic execution. Our key insight is that we can summarize each analyzed method as a memoization tree that captures the crucial elements of symbolic execution, and leverage these memoization trees to efficiently replay the symbolic execution of the corresponding methods with respect to their calling contexts. Memoization trees offer a natural way to compose in the presence of heap operations, which cannot be dealt with by previous work that uses logical formulas as summaries for composi- tional symbolic execution. Our approach also enables an efficient treatment of error traces by short-circuiting the execution of paths that lead to them. Our preliminary experimental evaluation based on a prototype implementation in Symbolic PathFinder shows promising results.Electrical and Computer Engineerin
Bandwidth Optimization Design of a Multi Degree of Freedom MEMS Gyroscope
No full textA new robust multi-degree of freedom (multi-DOF) MEMS gyroscope is presented in this paper. The designed gyroscope has its bandwidth and amplification factor of the sense mode adjusted more easily than the previous reported multi-DOF MEMS gyroscopes. Besides, a novel spring system with very small coupling stiffness is proposed, which helps achieve a narrow bandwidth and a high amplification factor for a 2-DOF vibration system. A multi-DOF gyroscope with the proposed weak spring system is designed, and simulations indicate that when the operating frequency is set at 12.59 kHz, the flat frequency response region of the sense mode can be designed as narrow as 80 Hz, and the amplification factor of the sense mode at the operating frequency is up to 91, which not only protects the amplification factor from instability against process and temperature variations, but also sacrifices less performance. An experiment is also carried out to demonstrate the validity of the design. The multi-DOF gyroscope with the proposed weak coupling spring system is capable of achieving a good tradeoff between robustness and the performance
A Study of Modern Chinese Disyllabic Words: An Introduction to Language Contact and Modernization of Chinese
No full textDistributed Symbolic Execution For Property Checking
No full textSymbolic execution is a powerful technique for checking properties in the form of assertions. It can systematically explore the program’s state space to find paths to assertion violations, and provide users with a counterexample for each violation by solving the corresponding path condition using the underlying constraint solver. However, conventional symbolic execution is configured either to explore all the state space to find all possible assertion violations, or to stop when it finds the first assertion violation. In the former case, one symbolic execution run could take a long time before giving any result, and users have to wait for the whole execution time before they could take any action to deal with the potential problems in their code. In the latter case, users need to run symbolic execution for multiple times to check all assertion violations.
In this thesis, we develop a novel technique to check assertions in parallel using symbolic execution. Our technique improves the efficiency of assertion checking using symbolic execution and gives users earlier results. This technique is in two stages: in the first stage, a worker is launched to find feasible paths to the checked assertions, then in the second stage, multiple workers are launched to check assertions on these paths in parallel simultaneously, each worker focusing on one of these feasible paths. We evaluate our technique using experiments with four Java subjects, and the experimental results show its effectiveness and efficiency.Computer Scienc
- …
