全文获取类型
收费全文 | 5192篇 |
免费 | 128篇 |
国内免费 | 35篇 |
专业分类
化学 | 3891篇 |
晶体学 | 41篇 |
力学 | 115篇 |
综合类 | 2篇 |
数学 | 750篇 |
物理学 | 556篇 |
出版年
2022年 | 38篇 |
2021年 | 43篇 |
2020年 | 62篇 |
2019年 | 62篇 |
2018年 | 34篇 |
2017年 | 34篇 |
2016年 | 94篇 |
2015年 | 95篇 |
2014年 | 101篇 |
2013年 | 240篇 |
2012年 | 246篇 |
2011年 | 331篇 |
2010年 | 163篇 |
2009年 | 139篇 |
2008年 | 279篇 |
2007年 | 339篇 |
2006年 | 318篇 |
2005年 | 316篇 |
2004年 | 235篇 |
2003年 | 227篇 |
2002年 | 221篇 |
2001年 | 58篇 |
2000年 | 51篇 |
1999年 | 66篇 |
1998年 | 66篇 |
1997年 | 53篇 |
1996年 | 95篇 |
1995年 | 75篇 |
1994年 | 53篇 |
1993年 | 60篇 |
1992年 | 53篇 |
1991年 | 34篇 |
1990年 | 45篇 |
1989年 | 42篇 |
1988年 | 44篇 |
1987年 | 52篇 |
1986年 | 44篇 |
1985年 | 72篇 |
1984年 | 83篇 |
1983年 | 37篇 |
1982年 | 67篇 |
1981年 | 55篇 |
1980年 | 59篇 |
1979年 | 57篇 |
1978年 | 54篇 |
1977年 | 48篇 |
1976年 | 43篇 |
1975年 | 54篇 |
1974年 | 50篇 |
1973年 | 31篇 |
排序方式: 共有5355条查询结果,搜索用时 15 毫秒
11.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
12.
B. M. Azizur Rahman A. K. M. Saiful Kabir Muttukrishnan Rajarajan Kenneth T. V. Grattan 《Optical and Quantum Electronics》2005,37(1-3):171-183
Modal solutions of planar photonic crystal waveguides with rectangular air-holes are presented by using a rigorous full-vectorial finite element-based approach. The effective indices, mode field profiles, spot-sizes, power confinements, modal hybridness, beat lengths and group velocity dispersions are shown for the fundamental and higher order modes of the quasi-TE and TM polarizations. 相似文献
13.
Jnos Szanyi Ja Hun Kwak Sarah Burton Jose A. Rodriguez Charles H.F. Peden 《Journal of Electron Spectroscopy and Related Phenomena》2006,150(2-3):164-170
Adsorbed ionic NOx species formed upon the interaction of NO2 with dehydrated or hydrated Na- and Ba-Y, FAU zeolites were characterized using FT-IR/TPD, solid state NMR, and XANES techniques. NO2 disproportionates on both dehydrated catalyst materials forming NO+ and NO3− species. These ionic species are stabilized by their interactions with the negatively charged zeolite framework and the charge compensating cations (Na+ and Ba2+), respectively. Although the nature of the adsorbed NOx species formed on the two catalysts is similar, their thermal stabilities are strongly dependent on the charge compensating cations. In the presence of water in the channels of these zeolite materials new paths open for reactions between NO+ and H2O, and NO2 and H2O, resulting in significant changes in the adsorbed ionic species observed. These combined spectroscopic investigations afforded the understanding of the interactions between water and NO2 on these zeolite catalysts. 相似文献
14.
15.
If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time. 相似文献
16.
The Meyerhoff Program is an intensive, multicomponent program focused on enhancing the success of talented African-American students in science and engineering at a predominantly white, medium-sized university. The program components, taken together, address the four primary factors emphasized in the research literature as limiting minority student performance and persistence in science: knowledge and skills, motivation and support, monitoring and advising, and academic and social integration. Outcome analyses indicated that the first three cohorts of Meyerhoff students (total N=69) achieved an overall GPA (mean=3.5) significantly greater than that of an African-American historical comparison sample (mean=2.8) of comparably talented science students at the university. This difference was even greater for first year science GPA (means of 3.4 and 2.4, respectively), and in specific science and mathematics courses. Observational and questionnaire data indicated that the Meyerhoff program study groups, peerbased community, financial scholarships, summer bridge program and staff appear to be especially important contributors to student success. Implications of the findings for enhancing the success of African-American and other underrepresented populations in science are discussed. 相似文献
17.
Applied Biochemistry and Biotechnology - In summary, it appears that the microbial reduction process is clearly not competitive with conventional SO2-reduction techniques when glucose (DE95 corn... 相似文献
18.
In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks. 相似文献
19.
Kenneth Sörensen 《Central European Journal of Operations Research》2006,14(2):193-207
In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often
or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in
use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total
travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this
distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a
given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small.
By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between
changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness
of the approach. 相似文献
20.