首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   374篇
  免费   30篇
  国内免费   5篇
化学   6篇
力学   29篇
数学   315篇
物理学   59篇
  2024年   2篇
  2023年   8篇
  2022年   5篇
  2021年   16篇
  2020年   18篇
  2019年   10篇
  2018年   6篇
  2017年   16篇
  2016年   7篇
  2015年   12篇
  2014年   30篇
  2013年   22篇
  2012年   18篇
  2011年   35篇
  2010年   38篇
  2009年   30篇
  2008年   32篇
  2007年   18篇
  2006年   19篇
  2005年   9篇
  2004年   15篇
  2003年   5篇
  2002年   5篇
  2001年   3篇
  2000年   2篇
  1999年   4篇
  1998年   2篇
  1997年   2篇
  1996年   3篇
  1995年   1篇
  1993年   3篇
  1992年   1篇
  1991年   1篇
  1985年   3篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1978年   3篇
  1977年   1篇
排序方式: 共有409条查询结果,搜索用时 31 毫秒
311.
Consider the following FitzHugh-Nagumo type equation
  相似文献   
312.
《偏微分方程通讯》2013,38(7-8):1625-1658
ABSTRACT

It is shown that small perturbations of equilibrium states in ferromagnetic media give rise to standing and traveling waves that are stable for long times. The evolution of the wave profiles is governed by semilinear heat equations. The mathematical model underlying these results consists of the Landau–Lifshitz equation for the magnetization vector and Maxwell's equations for the electromagnetic field variables. The model belongs to a general class of hyperbolic equations for vector-valued functions, whose asymptotic properties are analyzed rigorously. The results are illustrated with numerical examples.  相似文献   
313.
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relation: for any nonnegative integral weight function w defined on E(M),
Our characterization contains a complete solution to a research problem on 2-edge-connected subgraph polyhedra posed by Cornuéjols, Fonlupt, and Naddef in 1985, which was independently solved by Vandenbussche and Nemhauser in Vandenbussche and Nemhauser (J. Comb. Optim. 9:357–379, 2005). W. Zang’s research partially supported by the Research Grants Council of Hong Kong.  相似文献   
314.
The paper is concerned with the asymptotic behavior as t → ±∞ of an entire solution u(x,t) for the nonlocal diffusion equation. With bistable assumption, it is well known that the model has three different types of travel- ing fronts. Under certain conditions on the wave speeds, and by some auxiliary rational functions with certain properties to construct appropriate super- and sub solutions of the model, we establish two new types of entire solutions u(x,t) which approach to three travelling fronts or the positive equilibrium as t → ±∞.  相似文献   
315.
For a 3-edge-connected cubic graph G=(V,E), we give an algorithm to construct a connected Eulerian subgraph of 2G using at most ?4|V|3? edges.  相似文献   
316.
This paper presents a General Variable Neighborhood Search (GVNS) heuristic for the Traveling Salesman Problem with Time Windows (TSPTW). The heuristic is composed by both constructive and optimization stages. In the first stage, the heuristic constructs a feasible solution using VNS, and in the optimization stage the heuristic improves the feasible solution with a General VNS heuristic. Both constructive and optimization stages take advantage of elimination tests, partial neighbor evaluation and neighborhood partitioning techniques. Experimental results show that this approach is efficient, reducing significantly the computation time and improving some best known results from the literature.  相似文献   
317.
This paper deals with the existence of traveling wave solutions in delayed nonlocal diffusion systems with mixed monotonicity. Based on two different mixed-quasimonotonicity reaction terms, we propose new definitions of upper and lower solutions. By using Schauder's fixed point theorem and a new cross-iteration scheme, we reduce the existence of traveling wave solutions to the existence of a pair of upper and lower solutions. The general results obtained have been applied to type-K monotone and type-K competitive nonlocal diffusive Lotka-Volterra systems.  相似文献   
318.
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-to-one relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhedral structure is analyzed. In particular, the dimension of the TSPPD polytope is determined and several valid inequalities, some of which are facet defining, are introduced. Separation procedures and a branch-and-cut algorithm are developed. Computational results show that the algorithm is capable of solving to optimality instances involving up to 35 pickup and delivery requests, thus more than doubling the previous record of 15.   相似文献   
319.
We propose an exponential function rational expansion method for solving exact traveling wave solutions to nonlinear differential-difference equations system. By this method, we obtain some exact traveling wave solutions to the relativistic Toda lattice equations system and discuss the significance of these solutions. Finally, we give an open problem.  相似文献   
320.
In this paper, a method with the aid of a sub-ODE and its solutions is used for constructing new periodic wave solutions for nonlinear Gardner equation and BBM equation with nonlinear terms of any order arising in mathematical physics. As a result, many exact traveling wave solutions are successfully obtained. The method in the paper is very direct and it can also be applied to other nonlinear evolution equations.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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