全文获取类型
收费全文 | 84575篇 |
免费 | 1430篇 |
国内免费 | 1168篇 |
专业分类
化学 | 28822篇 |
晶体学 | 859篇 |
力学 | 7084篇 |
综合类 | 42篇 |
数学 | 32667篇 |
物理学 | 17699篇 |
出版年
2023年 | 145篇 |
2022年 | 278篇 |
2021年 | 268篇 |
2020年 | 274篇 |
2019年 | 309篇 |
2018年 | 10601篇 |
2017年 | 10419篇 |
2016年 | 6349篇 |
2015年 | 1196篇 |
2014年 | 681篇 |
2013年 | 773篇 |
2012年 | 4379篇 |
2011年 | 11089篇 |
2010年 | 6008篇 |
2009年 | 6373篇 |
2008年 | 6968篇 |
2007年 | 9097篇 |
2006年 | 596篇 |
2005年 | 1588篇 |
2004年 | 1743篇 |
2003年 | 2165篇 |
2002年 | 1157篇 |
2001年 | 398篇 |
2000年 | 444篇 |
1999年 | 333篇 |
1998年 | 336篇 |
1997年 | 278篇 |
1996年 | 318篇 |
1995年 | 232篇 |
1994年 | 185篇 |
1993年 | 171篇 |
1992年 | 128篇 |
1991年 | 147篇 |
1990年 | 104篇 |
1989年 | 92篇 |
1988年 | 91篇 |
1987年 | 87篇 |
1986年 | 76篇 |
1985年 | 65篇 |
1984年 | 51篇 |
1983年 | 56篇 |
1982年 | 46篇 |
1981年 | 40篇 |
1980年 | 48篇 |
1979年 | 45篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
21.
Harish C. Bahl Stanley Zionts 《The Journal of the Operational Research Society》1987,38(12):1141-1148
Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method. 相似文献
22.
Christian Prins 《The Journal of the Operational Research Society》1994,45(6):611-623
Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints. 相似文献
23.
24.
25.
26.
M. De Falco F. De Giovanni C. Musella R. Schmidt 《Rendiconti del Circolo Matematico di Palermo》2003,52(1):70-76
A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated.
This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di
Matematica e Applicazioni” for its financial support. 相似文献
27.
28.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献
29.
In this paper a tripartite qualitative design combining abservation, stimulated recall and interview is presented and discussed. This three-step-design makes it possible to get insight into the interaction of internal and external processes when solving mathematical tasks. The data analysis depends on the research question and the methodological approach. In the light of two research projects in mathematics education two different methods of data analysis are presented and methodologically reflected. 相似文献
30.
Massoud Pourmahdian 《Archive for Mathematical Logic》2003,42(5):415-421
We prove that for any simple theory which is constructed via Fr?issé-Hrushovski method, if the forking independence is the
same as the d-independence then the stable forking property holds.
Received: 22 January 2001 /
Published online: 19 December 2002
This article is part of the author's D-Phil thesis, written at the University of Oxford and supported by the Ministry of
Higher Education of Iran. The author would like to thank the Institute for Studies in Theoretical Physics and Mathematics
(IPM), Tehran, Iran, for its financial support whilst working on this article.
Mathematics Subject Classification (2000): 03C45
Key words or phrases: Generic structures – Fr?issé-Hrushovski method – Predimension – Simple theories – Stable theories – Stable forking conjecture 相似文献