全文获取类型
收费全文 | 4325篇 |
免费 | 206篇 |
国内免费 | 101篇 |
专业分类
化学 | 159篇 |
晶体学 | 3篇 |
力学 | 91篇 |
综合类 | 31篇 |
数学 | 2936篇 |
物理学 | 262篇 |
无线电 | 1150篇 |
出版年
2024年 | 13篇 |
2023年 | 69篇 |
2022年 | 73篇 |
2021年 | 100篇 |
2020年 | 82篇 |
2019年 | 87篇 |
2018年 | 79篇 |
2017年 | 86篇 |
2016年 | 110篇 |
2015年 | 99篇 |
2014年 | 236篇 |
2013年 | 332篇 |
2012年 | 214篇 |
2011年 | 265篇 |
2010年 | 239篇 |
2009年 | 318篇 |
2008年 | 304篇 |
2007年 | 285篇 |
2006年 | 208篇 |
2005年 | 203篇 |
2004年 | 168篇 |
2003年 | 162篇 |
2002年 | 151篇 |
2001年 | 101篇 |
2000年 | 83篇 |
1999年 | 84篇 |
1998年 | 94篇 |
1997年 | 57篇 |
1996年 | 57篇 |
1995年 | 37篇 |
1994年 | 51篇 |
1993年 | 32篇 |
1992年 | 22篇 |
1991年 | 24篇 |
1990年 | 18篇 |
1989年 | 13篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有4632条查询结果,搜索用时 15 毫秒
61.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
62.
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time. 相似文献
63.
This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf:
n
. The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements. 相似文献
64.
Tomasz Rolski 《Queueing Systems》1989,4(1):17-26
We study single server periodic queues in the day equilibrium conditions. The following characteristics of interest are considered at time of dayt: Vp(t)-the work load, Lp(t)-the number of customers and up(t)-the departure rate. We give relationships between E[Vp(t)], E[Lp(t)] and up(t). We also prove that E[Vp(t)] < and E[Lp(t)] < provided the second moment of the service time is finite. 相似文献
65.
R. Horst 《Journal of Optimization Theory and Applications》1989,61(1):143-146
This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures. 相似文献
66.
Any global minimization algorithm is made by several local searches performed sequentially. In the classical multistart algorithm, the starting point for each new local search is selected at random uniformly in the region of interest. In the tunneling algorithm, such a starting point is required to have the same function value obtained by the last local minimization. We introduce the class of acceptance-rejection based algorithms in order to investigate intermediate procedures. A particular instance is to choose at random the new point approximately according to a Boltzmann distribution, whose temperatureT is updated during the algorithm. AsT 0, such distribution peaks around the global minima of the cost function, producing a kind of random tunneling effect. The motivation for such an approach comes from recent works on the simulated annealing approach in global optimization. The resulting algorithm has been tested on several examples proposed in the literature. 相似文献
67.
Shengrui Lin Yiting Cai Jiaxi Luo Ziyu Xuan Yicong Zhao 《Journal of Nonlinear Modeling and Analysis》2022,4(2):220-244
In this paper, we investigate the Novikov equation with weak dissipation terms. First, we give the local well-posedness and the blow-up scenario. Then, we discuss the global existence of the solutions under certain conditions. After that, on condition that the compactly supported initial data keeps its sign, we prove the infinite propagation speed of our solutions, and establish the large time behavior. Finally, we also elaborate the persistence property of our solutions in weighted Sobolev space. 相似文献
68.
A. Puhalskii 《Queueing Systems》1995,21(1-2):5-66
We establish the large deviation principle (LDP) for the virtual waiting time and queue length processes in the GI/GI/1 queue. The rate functions are found explicitly. As an application, we obtain the logarithmic asymptotics of the probabilities that the virtual waiting time and queue length exceed high levels at large times. Additional new results deal with the LDP for renewal processes and with the derivation of unconditional LDPs for conditional ones. Our approach applies in large deviations ideas and methods of weak convergence theory.This work was supported in part by AT&T Bell Labs. 相似文献
69.
The local optimality conditions to polynomial optimization problems are a set of polynomial equations (plus some inequality conditions). With the recent techniques of Gröbner bases one can find all solutions to such systems, and hence also find global optima. We give a short survey of these methods. We also apply them to a set of problems termed with exact solutions unknown in the problem sets of Hock and Schittkowski. To these problems we give exact solutions. 相似文献
70.
Masakiyo Miyazawa 《Queueing Systems》1994,15(1-4):1-58
We survey the rate conservation law, RCL for short, arising in queues and related stochastic models. RCL was recognized as one of the fundamental principles to get relationships between time and embedded averages such as the extended Little's formulaH=G, but we show that it has other applications. For example, RCL is one of the important techniques for deriving equilibrium equations for stochastic processes. It is shown that the various techniques, including Mecke's formula for a stationary random measure, can be formulated as RCL. For this purpose, we start with a new definition of the rate with respect to a random measure, and generalize RCL by using it. We further introduce the notion of quasi-expectation, which is a certain extension of the ordinary expectation, and derive RCL applicable to the sample average results. It means that the sample average formulas such asH=G can be obtained as the stationary RCL in the quasi-expectation framework. We also survey several extensions of RCL and discuss examples. Throughout the paper, we would like to emphasize how results can be easily obtained by using a simple principle, RCL. 相似文献