首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   62860篇
  免费   1671篇
  国内免费   685篇
化学   30198篇
晶体学   1062篇
力学   3469篇
综合类   63篇
数学   5142篇
物理学   25282篇
  2022年   693篇
  2021年   651篇
  2020年   653篇
  2019年   606篇
  2018年   735篇
  2017年   629篇
  2016年   1108篇
  2015年   848篇
  2014年   1254篇
  2013年   2843篇
  2012年   2708篇
  2011年   3351篇
  2010年   2392篇
  2009年   2373篇
  2008年   2992篇
  2007年   2820篇
  2006年   2646篇
  2005年   2331篇
  2004年   2092篇
  2003年   1856篇
  2002年   1746篇
  2001年   3090篇
  2000年   2227篇
  1999年   1667篇
  1998年   1149篇
  1997年   1140篇
  1996年   949篇
  1995年   848篇
  1994年   752篇
  1993年   668篇
  1992年   978篇
  1991年   972篇
  1990年   868篇
  1989年   756篇
  1988年   736篇
  1987年   800篇
  1986年   667篇
  1985年   887篇
  1984年   829篇
  1983年   569篇
  1982年   564篇
  1981年   537篇
  1980年   496篇
  1979年   620篇
  1978年   650篇
  1977年   660篇
  1976年   575篇
  1975年   481篇
  1974年   521篇
  1973年   450篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.  相似文献   
122.
123.
New heuristics for over-constrained flight to gate assignments   总被引:1,自引:0,他引:1  
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.  相似文献   
124.
In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.  相似文献   
125.
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.  相似文献   
126.
In 1983, a preconditioner was proposed [J. Comput. Phys. 49 (1983) 443] based on the Laplace operator for solving the discrete Helmholtz equation efficiently with CGNR. The preconditioner is especially effective for low wavenumber cases where the linear system is slightly indefinite. Laird [Preconditioned iterative solution of the 2D Helmholtz equation, First Year's Report, St. Hugh's College, Oxford, 2001] proposed a preconditioner where an extra term is added to the Laplace operator. This term is similar to the zeroth order term in the Helmholtz equation but with reversed sign. In this paper, both approaches are further generalized to a new class of preconditioners, the so-called “shifted Laplace” preconditioners of the form Δφ−k2φ with . Numerical experiments for various wavenumbers indicate the effectiveness of the preconditioner. The preconditioner is evaluated in combination with GMRES, Bi-CGSTAB, and CGNR.  相似文献   
127.
128.
129.
Geerk  J.  Linker  G.  Meyer  O.  Politis  C.  Ratzel  F.  Smithey  R.  Strehlau  B.  Xiong  G. C. 《Zeitschrift für Physik B Condensed Matter》1987,67(4):507-511
Thin superconducting films of La1.8Sr0.2CuO4 have been prepared by magnetron sputter deposition and subsequent temperature treatment. The composition of the films has been determined by Rutherford backscattering and the structure by thin film X-ray diffraction. The onset of superconductivity was about 32 K and the midpoint near 28 K. Defect production in the films by He ion bombardment revealed a drasticT c reduction with a sensitivity similar to that observed in the Chevrel phases. Oxygen implantation and subsequent annealing led to an enhancement of theT c onset.  相似文献   
130.
In this paper we investigate the effects of heavy Majorana neutrinos in the reaction e + e ?W + W ?. We consider neutrino masses in the 1–10 TeV region. We show that at LEP II and NLC energies it is possible to use this processes to verify indirect evidence of heavy neutral particles with mixing angles of the order sin2 α = 0.01. We discuss the unitarity restrictions that can be obtained for vector singlet and fermion-mirror-fermion models.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号