全文获取类型
收费全文 | 1271篇 |
免费 | 41篇 |
国内免费 | 41篇 |
专业分类
化学 | 93篇 |
力学 | 40篇 |
综合类 | 5篇 |
数学 | 1011篇 |
物理学 | 204篇 |
出版年
2024年 | 3篇 |
2023年 | 13篇 |
2022年 | 29篇 |
2021年 | 22篇 |
2020年 | 35篇 |
2019年 | 34篇 |
2018年 | 32篇 |
2017年 | 28篇 |
2016年 | 20篇 |
2015年 | 22篇 |
2014年 | 57篇 |
2013年 | 125篇 |
2012年 | 35篇 |
2011年 | 71篇 |
2010年 | 78篇 |
2009年 | 116篇 |
2008年 | 90篇 |
2007年 | 85篇 |
2006年 | 67篇 |
2005年 | 42篇 |
2004年 | 46篇 |
2003年 | 43篇 |
2002年 | 28篇 |
2001年 | 25篇 |
2000年 | 40篇 |
1999年 | 25篇 |
1998年 | 18篇 |
1997年 | 14篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 18篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有1353条查询结果,搜索用时 15 毫秒
1.
2.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
3.
V.B. Fainerman V.N. Kazakov S.V. Lylyk A.V. Makievski R. Miller 《Colloids and surfaces. A, Physicochemical and engineering aspects》2004,250(1-3):97-102
One of the essential differences in the design of bubble pressure tensiometers consists in the geometry of the measuring capillaries. To reach extremely short adsorption times of milliseconds and below, the so-called deadtime of the capillaries must be of the order of some 10 ms. In particular, for concentrated surfactant solutions, such as micellar solutions, short deadtimes are needed to minimize the initial surfactant load of the generated bubbles. A theoretical model is derived and confirmed by experiments performed for a wide range of experimental conditions, mainly in respect to variations in deadtime and bubble volume. 相似文献
4.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
5.
Giovanni Cupini Marcello Guidorzi Cristina Marcelli 《Journal of Differential Equations》2007,243(2):329-348
Classical one-dimensional, autonomous Lagrange problems are considered. In absence of any smoothness, convexity or coercivity condition on the energy density, we prove a DuBois-Reymond type necessary condition, expressed as a differential inclusion involving the subdifferential of convex analysis. As a consequence, a non-existence result is obtained. 相似文献
6.
E. Mathieu Y. Foucher P. Dellamonica J. P. Daures 《Methodology and Computing in Applied Probability》2007,9(3):389-397
In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical
taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In
this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding
the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed.
A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented
for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct
times and follow-up has an impact on the evolution of patients.
相似文献
7.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
8.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
9.
Antonio Vitolo 《Journal of Differential Equations》2003,194(1):166-184
This paper is concerned with the maximum principle for second-order linear elliptic equations in a wide generality. By means of a geometric condition previously stressed by Berestycki-Nirenberg-Varadhan, Cabré was very able to improve the classical ABP estimate obtaining the maximum principle also in unbounded domains, such as infinite strips and open connected cones with closure different from the whole space. Now we introduce a new geometric condition that extends the result to a more general class of domains including the complements of hypersurfaces, as for instance the cut plane. The methods developed here allow us to deal with complete second-order equations, where the admissible first-order term, forced to be zero in a preceding result with Cafagna, depends on the geometry of the domain. 相似文献
10.
We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance. 相似文献