全文获取类型
收费全文 | 14958篇 |
免费 | 1000篇 |
国内免费 | 869篇 |
专业分类
化学 | 216篇 |
晶体学 | 3篇 |
力学 | 1459篇 |
综合类 | 178篇 |
数学 | 13861篇 |
物理学 | 1110篇 |
出版年
2024年 | 30篇 |
2023年 | 139篇 |
2022年 | 174篇 |
2021年 | 211篇 |
2020年 | 320篇 |
2019年 | 339篇 |
2018年 | 393篇 |
2017年 | 392篇 |
2016年 | 383篇 |
2015年 | 281篇 |
2014年 | 624篇 |
2013年 | 1181篇 |
2012年 | 678篇 |
2011年 | 781篇 |
2010年 | 708篇 |
2009年 | 967篇 |
2008年 | 1026篇 |
2007年 | 1052篇 |
2006年 | 941篇 |
2005年 | 721篇 |
2004年 | 626篇 |
2003年 | 695篇 |
2002年 | 596篇 |
2001年 | 455篇 |
2000年 | 469篇 |
1999年 | 417篇 |
1998年 | 388篇 |
1997年 | 339篇 |
1996年 | 261篇 |
1995年 | 207篇 |
1994年 | 141篇 |
1993年 | 126篇 |
1992年 | 120篇 |
1991年 | 105篇 |
1990年 | 82篇 |
1989年 | 46篇 |
1988年 | 44篇 |
1987年 | 41篇 |
1986年 | 45篇 |
1985年 | 56篇 |
1984年 | 55篇 |
1983年 | 28篇 |
1982年 | 29篇 |
1981年 | 25篇 |
1980年 | 19篇 |
1979年 | 22篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 9篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
《Applied Mathematical Modelling》2014,38(7-8):2214-2223
The quantification problem of recovering the original material distribution from secondary ion mass spectrometry (SIMS) data is considered in this paper. It is an inverse problem, is ill-posed and hence it requires a special technique for its solution. The quantification problem is essentially an inverse diffusion or (classically) a backward heat conduction problem. In this paper an operator-splitting method (that is proposed in a previous paper by the first author for the solution of inverse diffusion problems) is developed for the solution of the problem of recovering the original structure from the SIMS data. A detailed development of the quantification method is given and it is applied to typical data to demonstrate its effectiveness. 相似文献
992.
《Applied Mathematical Modelling》2014,38(17-18):4396-4408
Accurate integral methods are applied to a one dimensional moving boundary problem describing the diffusion of oxygen in absorbing tissue. These methods have been well studied for classic Stefan problems but this situation is unusual because there is no condition which contains the velocity of the moving boundary explicitly. This paper begins by giving a short time solution and then discusses some of the previous integral methods found in the literature. The main drawbacks of these solutions are that they cannot be solved from and also cannot determine the end behaviour. This is due to the non-uniform initial profile which integral methods typically fail to capture. The use of a novel transformation removes this non-uniformity and, on applying optimal integral methods to the resulting system, leads to simple and yet very accurate approximate solutions that overcome the deficiencies of previous methods. 相似文献
993.
For every d and k, we determine the smallest order of a vertex‐transitive graph of degree d and diameter k, and in each such case we show that this order is achieved by a Cayley graph. 相似文献
994.
Sanming Zhou 《Journal of Graph Theory》2014,75(1):37-47
Unitary graphs are arc‐transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc‐transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter two and girth three. Based on this, we obtain, for any prime power , a lower bound of order on the maximum number of vertices in an arc‐transitive graph of degree and diameter two. 相似文献
995.
Klas Markström 《Journal of Graph Theory》2014,76(2):101-105
For ordinary graphs it is known that any graph G with more edges than the Turán number of must contain several copies of , and a copy of , the complete graph on vertices with one missing edge. Erd?s asked if the same result is true for , the complete 3‐uniform hypergraph on s vertices. In this note, we show that for small values of n, the number of vertices in G, the answer is negative for . For the second property, that of containing a , we show that for the answer is negative for all large n as well, by proving that the Turán density of is greater than that of . 相似文献
996.
The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the improved version by Desrochers and Laporte (DL) have been and are still in regular use to model a variety of routing problems. This paper presents a systematic way of deriving inequalities that are more complicated than the MTZ and DL inequalities and that, in a certain way, “generalize” the underlying idea of the original inequalities. We present a polyhedral approach that studies and analyses the convex hull of feasible sets for small dimensions. This approach allows us to generate generalizations of the MTZ and DL inequalities, which are “good” in the sense that they define facets of these small polyhedra. It is well known that DL inequalities imply a subset of Dantzig–Fulkerson–Johnson (DFJ) SECs for two-node subsets. Through the approach presented, we describe a generalization of these inequalities which imply DFJ SECs for three-node subsets and show that generalizations for larger subsets are unlikely to exist. Our study presents a similar analysis with generalizations of MTZ inequalities and their relation with the lifted circuit inequalities for three node subsets. 相似文献
997.
Increased rates of mortgage foreclosures in the U.S. have had devastating social and economic impacts during and after the 2008 financial crisis. As part of the response to this problem, nonprofit organizations such as community development corporations (CDCs) have been trying to mitigate the negative impacts of mortgage foreclosures by acquiring and redeveloping foreclosed properties. We consider the strategic resource allocation decisions for these organizations which involve budget allocations to different neighborhoods under cost and return uncertainty. Based on interactions with a CDC, we develop stochastic integer programming based frameworks for this decision problem, and assess the practical value of the models by using real-world data. Both policy-related and computational analyses are performed, and several insights such as the trade-offs between different objectives, and the efficiency of different solution approaches are presented. 相似文献
998.
The recycling of urban solid wastes is a critical point for the “closing supply chains” of many products, mainly when their value cannot be completely recovered after use. In addition to environmental aspects, the process of recycling involves technical, economic, social and political challenges for public management. For most of the urban solid waste, the management of the end-of-life depends on selective collection to start the recycling process. For this reason, an efficient selective collection has become a mainstream tool in the Brazilian National Solid Waste Policy. In this paper, we study effective models that might support the location planning of sorting centers in a medium-sized Brazilian city that has been discussing waste management policies over the past few years. The main goal of this work is to provide an optimal location planning design for recycling urban solid wastes that fall within the financial budget agreed between the municipal government and the National Bank for Economic and Social Development. Moreover, facility planning involves deciding on the best sites for locating sorting centers along the four-year period as well as finding ways to meet the demand for collecting recyclable materials, given that economic factors, consumer behavior and environmental awareness are inherently uncertain future outcomes. To deal with these issues, we propose a deterministic version of the classical capacity facility location problem, and both a two-stage recourse formulation and risk-averse models to reduce the variability of the second-stage costs. Numerical results suggest that it is possible to improve the current selective collection, as well as hedge against data uncertainty by using stochastic and risk-averse optimization models. 相似文献
999.
This paper is concerned with an algorithmic solution to the split common fixed point problem in Hilbert spaces. Our method can be regarded as a variant of the “viscosity approximation method”. Under very classical assumptions, we establish a strong convergence theorem with regard to involved operators belonging to the wide class of quasi-nonexpansive operators. In contrast with other related processes, our algorithm does not require any estimate of some spectral radius. The technique of analysis developed in this work is new and can be applied to many other fixed point iterations. Numerical experiments are also performed with regard to an inverse heat problem. 相似文献
1000.
In this work we consider scheduling problems where a sequence of assignments from products to machines – or from tasks to operators, or from workers to resources – has to be determined, with the goal of minimizing the costs (=money, manpower, and/or time) that are incurred by the interplay between those assignments. To account for the different practical requirements (e.g. few changes between different products/tasks on the same machine/operator, few production disruptions, or few changes of the same worker between different resources), we employ different objective functions that are all based on elementary combinatorial properties of the schedule matrix. We propose simple and efficient algorithms to solve the corresponding optimization problems, and provide hardness results where such algorithms most likely do not exist. 相似文献