首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1368篇
  免费   82篇
  国内免费   28篇
化学   69篇
晶体学   1篇
力学   136篇
综合类   10篇
数学   1108篇
物理学   154篇
  2023年   13篇
  2022年   16篇
  2021年   23篇
  2020年   23篇
  2019年   20篇
  2018年   15篇
  2017年   27篇
  2016年   27篇
  2015年   36篇
  2014年   59篇
  2013年   91篇
  2012年   75篇
  2011年   51篇
  2010年   48篇
  2009年   68篇
  2008年   75篇
  2007年   94篇
  2006年   81篇
  2005年   53篇
  2004年   53篇
  2003年   42篇
  2002年   46篇
  2001年   43篇
  2000年   26篇
  1999年   42篇
  1998年   33篇
  1997年   32篇
  1996年   24篇
  1995年   25篇
  1994年   24篇
  1993年   18篇
  1992年   16篇
  1991年   14篇
  1990年   13篇
  1989年   14篇
  1988年   10篇
  1987年   7篇
  1986年   18篇
  1985年   15篇
  1984年   5篇
  1983年   3篇
  1982年   9篇
  1981年   4篇
  1980年   11篇
  1979年   9篇
  1978年   10篇
  1977年   5篇
  1976年   5篇
  1975年   1篇
  1974年   5篇
排序方式: 共有1478条查询结果,搜索用时 15 毫秒
51.
In this paper, the surplus of an insurance company is modeled by a Markovian regimeswitching diffusion process. The insurer decides the proportional reinsurance and investment so as to increase revenue. The regime-switching economy consists of a fixed interest security and several risky shares. The optimal proportional reinsurance and investment strategies with no short-selling constraints for maximizing an exponential utility on terminal wealth are obtained.  相似文献   
52.
The classical algebraic approach to graph transformation is a mathematical theory based on categorical techniques with several interesting applications in computer science. In this paper, a new semantics of graph transformation systems (in the algebraic, double-pushout (DPO) approach) is proposed in order to make them suitable for the specification of concurrent and reactive systems. Classically, a graph transformation system comes with a fixed behavioral interpretation. Firstly, all transformation steps are intended to be completely specified by the rules of the system, that is, there is an implicit frame condition: it is assumed that there is a complete control about the evolution of the system. Hence, the interaction between the system and its (possibly unknown) environment, which is essential in a reactive system, cannot be modeled explicitly. Secondly, each sequence of transformation steps represents a legal computation of the system, and this makes it difficult to model systems with control. The first issue is addressed by providing graph transformation rules with a loose semantics, allowing for unspecified effects which are interpreted as activities of the environment. This is formalized by the notion of double-pullback transitions, which replace (and generalize) the well-known double-pushout diagrams by allowing for spontaneous changes in the context of a rule application. Two characterizations of double-pullback transitions are provided: the first one describes them in terms of extended direct DPO derivations, and the second one as incomplete views of parallel or amalgamated derivations. The issue of constraining the behavior of a system to transformation sequences satisfying certain properties is addressed instead by introducing a general notion of logic of behavioral constraints, which includes instances like start graphs, application and consistency conditions, and temporal logic constraints. The loose semantics of a system with restricted behavior is defined as a category of coalgebras over a suitable functor. Such category has a final object which includes all finite and infinite transition sequences satisfying the constraints.  相似文献   
53.
For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.  相似文献   
54.
Belhaj (2010) established that a barrier strategy is optimal for the dividend problem under jump–diffusion model. However, if the optimal dividend barrier level is set too low, then the bankruptcy probability may be too high to be acceptable. This paper aims to address this issue by taking the solvency constrain into consideration. Precisely, we consider a dividend payment problem with solvency constraint under a jump–diffusion model. Using stochastic control and PIDE, we derive the optimal dividend strategy of the problem.  相似文献   
55.
56.
57.
58.
转动系统的相对论性分析力学理论   总被引:17,自引:3,他引:17  
本文讨论了转动相对论力学理论,主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Tr=∑ni=1I0iΓi2(1-1-θ·2i/Γi2)和广义加速度能量函数Sr=12∑ni=1Ii(θ·i·θ¨i)2Γi2-θ·2i+θ¨2i,给出其Hamilton原理和三种不同形式的D′Alembert原理;对于完整约束系统,建立了转动系统的相对论性Lagrange方程、Nielsen方程、Appel方程和Hamilton正则方程;对于非完整约束系统,建立了转动系统的相对论性Routh方程、Чаплыгин方程、Nielsen方程和Appel方程;并给出转动系统的相对论性Noether守恒律  相似文献   
59.
We study optimal control problems for semilinear elliptic equations subject to control and state inequality constraints. In a first part we consider boundary control problems with either Dirichlet or Neumann conditions. By introducing suitable discretization schemes, the control problem is transcribed into a nonlinear programming problem. It is shown that a recently developed interior point method is able to solve these problems even for high discretizations. Several numerical examples with Dirichlet and Neumann boundary conditions are provided that illustrate the performance of the algorithm for different types of controls including bang-bang and singular controls. The necessary conditions of optimality are checked numerically in the presence of active control and state constraints.  相似文献   
60.
In this paper, the value function for an optimal control problem with endpoint and state constraints is characterized as the unique lower semicontinuous generalized solution of the Hamilton-Jacobi equation. This is achieved under a constraint qualification (CQ) concerning the interaction of the state and dynamic constraints. The novelty of the results reported here is partly the nature of (CQ) and partly the proof techniques employed, which are based on new estimates of the distance of the set of state trajectories satisfying a state constraint from a given trajectory which violates the constraint.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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