首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   117篇
  免费   27篇
  国内免费   12篇
化学   10篇
力学   2篇
数学   118篇
物理学   26篇
  2023年   4篇
  2022年   4篇
  2021年   6篇
  2020年   9篇
  2019年   6篇
  2018年   3篇
  2017年   1篇
  2016年   5篇
  2015年   6篇
  2014年   7篇
  2013年   8篇
  2012年   5篇
  2011年   3篇
  2010年   3篇
  2009年   18篇
  2008年   7篇
  2007年   6篇
  2006年   9篇
  2005年   2篇
  2004年   6篇
  2003年   7篇
  2002年   5篇
  2001年   6篇
  2000年   2篇
  1999年   2篇
  1998年   3篇
  1997年   4篇
  1996年   2篇
  1995年   1篇
  1994年   2篇
  1992年   1篇
  1985年   2篇
  1977年   1篇
排序方式: 共有156条查询结果,搜索用时 347 毫秒
11.
We have studied the effect of advection on reaction–diffusion equations by using toroidal velocity fields. Turing patterns formation in diffusion–advection–reaction problems was studied specifically, considering the Schnackenberg and glycolysis reaction kinetics models. Four cases were analyzed and solved numerically using finite elements. For glycolysis models, the advective effect modified the form of Turing patterns obtained with diffusion–reaction; whereas for Schnackenberg problems, the original patterns distorted themselves slightly, making them rotate in direction of the velocity field. We have also determined that the advective effect surpassed the diffusive one for high values of velocity and instability driven by diffusion was eliminated. On the other hand the advective effect is not considerable for very low values in the velocity field, and there was no modification in the original Turing pattern.  相似文献   
12.
Group classification of systems of two coupled non-linear reaction-diffusion equation with a diagonal diffusion matrix is carried out. Symmetries of diffusion systems with singular diffusion matrix and additional first order derivative terms are described.  相似文献   
13.
Many problems in biology involve growth. In numerical simulations it can therefore be very convenient to employ a moving computational grid on a continuously deforming domain. In this paper we present a novel application of the moving grid finite element method to compute solutions of reaction–diffusion systems in two-dimensional continuously deforming Euclidean domains. A numerical software package has been developed as a result of this research that is capable of solving generalised Turing models for morphogenesis.  相似文献   
14.
Self‐organization plays an imperative role in recent materials science. Highly tunable, periodic structures based on dynamic self‐organization at micrometer scales have proven difficult to design, but are desired for the further development of micropatterning. In the present study, we report a microgroove array that spontaneously forms on a p‐type silicon surface during its electrodissolution. Our detailed experimental results suggest that the instability can be classified as Turing instability. The characteristic scale of the Turing‐type pattern is small compared to self‐organized patterns caused by the Turing instabilities reported so far. The mechanism for the miniaturization of self‐organized patterns is strongly related to the semiconducting property of silicon electrodes as well as the dynamics of their surface chemistry.  相似文献   
15.
16.
In this paper, we concentrate on the spatiotemporal patterns of a delayed reaction‐diffusion Holling‐Tanner model with Neumann boundary conditions. In particular, the time delay that is incorporated in the negative feedback of the predator density is considered as one of the principal factors to affect the dynamic behavior. Firstly, a global Turing bifurcation theorem for τ = 0 and a local Turing bifurcation theorem for τ > 0 are given. Then, further considering the degenerated situation, we derive the existence of Bogdanov‐Takens bifurcation and Turing‐Hopf bifurcation. The normal form method is used to study the explicit dynamics near the Turing‐Hopf singularity. It is shown that a pair of stable nonconstant steady states (stripe patterns) and a pair of stable spatially inhomogeneous periodic solutions (spot patterns) could be bifurcated from a positive equilibrium. Moreover, the TuringTuring‐Hopf–type spatiotemporal patterns, that is, a subharmonic phenomenon with two spatial wave numbers and one temporal frequency, are also found and explained theoretically. Our results imply that the interaction of Turing and Hopf instabilities can be considered as the simplest mechanism for the appearance of complex spatiotemporal dynamics.  相似文献   
17.
Mussel beds are important habitats and food sources for biodiversity in coastal ecosystems. The predation of mussel on algae depends not only on the current time and location, but also on the quantity of algae at other spatial location and time. To know the impacts of such predation behavior on the dynamics of mussel beds well, we pose a reaction-diffusion mussel-algae model coupling nonlocal interaction with kernel function. By calculating the critical conditions of Hopf bifurcation and Turing bifurcation, the conditions for the generation of Turing pattern are obtained. We find that the diffusion rate and predation rate of mussels have effect on the structure and density of spatial pattern of mussels under the nonlocal interaction, and the predation rate of mussels can produce different pattern types, while the diffusion rate plays a more important role on the pattern density. Moreover, the nonlocal interaction promotes the stability of the mussel beds. These results suggest that the nonlocal interaction between mussels and algaes is one of the important mechanisms for the formation of the spatial structure of mussel beds.  相似文献   
18.
For polytopes P 1,P 2⊂ℝ d , we consider the intersection P 1P 2, the convex hull of the union CH(P 1P 2), and the Minkowski sum P 1+P 2. For the Minkowski sum, we prove that enumerating the facets of P 1+P 2 is NP-hard if P 1 and P 2 are specified by facets, or if P 1 is specified by vertices and P 2 is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete.  相似文献   
19.
Let X be a compact, convex subset of Rn, and let 〈R(X),FR be a recursive space of alternatives, where R(X) is the image of X in a recursive metric space, and FR is the family of all recursive subsets of R(X). If C: FRFR is a non-trivial recursively representable choice function that is rational in the sense of Richter, we prove that C has no recursive realization within Church's Thesis. Our proof is not a diagonalization argument and uses no paradoxical statements from formal systems. Instead, the proof is a Kleene-Post reduction style argument and uses the Turing equivalence between mechanical devices of computation and the recursive functions of Gödel and Kleene.  相似文献   
20.
We present a detailed study of the reaction-diffusion patterns observed in the thiourea-iodate-sulfite (TuIS) reaction, operated in open one-side-fed reactors. Besides spatial bistability and spatio-temporal oscillatory dynamics, this proton autoactivated reaction shows stationary patterns, as a result of two back-to-back Turing bifurcations, in the presence of a low-mobility proton binding agent (sodium polyacrylate). This is the third aqueous solution system to produce stationary patterns and the second to do this through a Turing bifurcation. The stationary pattern forming capacities of the reaction are explored through a systematic design method, which is applicable to other bistable and oscillatory reactions. The spatio-temporal dynamics of this reaction is compared with that of the previous ferrocyanide-iodate-sulfite mixed Landolt system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号