全文获取类型
收费全文 | 1281篇 |
免费 | 10篇 |
国内免费 | 19篇 |
专业分类
化学 | 121篇 |
晶体学 | 9篇 |
力学 | 482篇 |
综合类 | 1篇 |
数学 | 506篇 |
物理学 | 191篇 |
出版年
2023年 | 14篇 |
2022年 | 19篇 |
2021年 | 15篇 |
2020年 | 55篇 |
2019年 | 17篇 |
2018年 | 14篇 |
2017年 | 25篇 |
2016年 | 35篇 |
2015年 | 54篇 |
2014年 | 70篇 |
2013年 | 61篇 |
2012年 | 33篇 |
2011年 | 44篇 |
2010年 | 37篇 |
2009年 | 62篇 |
2008年 | 52篇 |
2007年 | 44篇 |
2006年 | 59篇 |
2005年 | 56篇 |
2004年 | 48篇 |
2003年 | 61篇 |
2002年 | 27篇 |
2001年 | 20篇 |
2000年 | 33篇 |
1999年 | 32篇 |
1998年 | 41篇 |
1997年 | 20篇 |
1996年 | 21篇 |
1995年 | 28篇 |
1994年 | 28篇 |
1993年 | 17篇 |
1992年 | 16篇 |
1991年 | 15篇 |
1990年 | 29篇 |
1989年 | 20篇 |
1988年 | 15篇 |
1987年 | 24篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 12篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1310条查询结果,搜索用时 46 毫秒
1.
Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces. 相似文献
2.
An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established. 相似文献
3.
Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means
of 1H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The
19F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the
information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by
means of correlation techniques without any preparation or marking of the pastes.
Received: 8 May 2000 Accepted: 1 May 2001 相似文献
4.
Arnon Arazi Eshel Ben-Jacob Uri Yechiali 《Mathematical Methods of Operations Research》2005,62(3):453-466
We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths
evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space
in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease
the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition
– should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is
briefly shut down as well, when certain conditions hold. 相似文献
5.
6.
This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO. 相似文献
7.
We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors. 相似文献
8.
We consider two queues in tandem, each with an exponential server, and with deterministic arrivals to the first queue. We
obtain an explicit solution for the steady state distribution of the process (N1(t), N2(t), Y(t)), where Nj(t) is the queue length in the jth queue and Y(t) measures the time elapsed since the last arrival. Then we obtain the marginal distributions of (N1(t), N2(t)) and of N2(t). We also evaluate the solution in various limiting cases, such as heavy traffic.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
We consider the following Type of problems. Calls arrive at a queue of capacity K (which is called the primary queue), and attempt to get served by a single server. If upon arrival, the queue is full and
the server is busy, the new arriving call moves into an infinite capacity orbit, from which it makes new attempts to reach
the primary queue, until it finds it non-full (or it finds the server idle). If the queue is not full upon arrival, then the
call (customer) waits in line, and will be served according to the FIFO order. If λ is the arrival rate (average number per
time unit) of calls and μ is one over the expected service time in the facility, it is well known that μ > λ is not always
sufficient for stability. The aim of this paper is to provide general conditions under which it is a sufficient condition.
In particular, (i) we derive conditions for Harris ergodicity and obtain bounds for the rate of convergence to the steady
state and large deviations results, in the case that the inter-arrival times, retrial times and service times are independent
i.i.d. sequences and the retrial times are exponentially distributed; (ii) we establish conditions for strong coupling convergence
to a stationary regime when either service times are general stationary ergodic (no independence assumption), and inter-arrival
and retrial times are i.i.d. exponentially distributed; or when inter-arrival times are general stationary ergodic, and service
and retrial times are i.i.d. exponentially distributed; (iii) we obtain conditions for the existence of uniform exponential
bounds of the queue length process under some rather broad conditions on the retrial process. We finally present conditions
for boundedness in distribution for the case of nonpatient (or non persistent) customers.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
10.
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and
service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform
acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the Mt/Mt/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion
of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis
generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process
are known. 相似文献