全文获取类型
收费全文 | 565篇 |
免费 | 11篇 |
专业分类
化学 | 272篇 |
晶体学 | 4篇 |
力学 | 7篇 |
数学 | 219篇 |
物理学 | 74篇 |
出版年
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 37篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 15篇 |
2009年 | 18篇 |
2008年 | 23篇 |
2007年 | 28篇 |
2006年 | 16篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2003年 | 9篇 |
2002年 | 10篇 |
1997年 | 5篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1986年 | 5篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 13篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1974年 | 5篇 |
1972年 | 4篇 |
1971年 | 6篇 |
1933年 | 11篇 |
1929年 | 6篇 |
1926年 | 6篇 |
1924年 | 4篇 |
1922年 | 5篇 |
1919年 | 4篇 |
1912年 | 4篇 |
1909年 | 6篇 |
1908年 | 4篇 |
1907年 | 6篇 |
1906年 | 5篇 |
1903年 | 4篇 |
1901年 | 4篇 |
1887年 | 4篇 |
1885年 | 4篇 |
排序方式: 共有576条查询结果,搜索用时 15 毫秒
481.
Mak Giuseppe Y. Lam Edmund Y. Choi H. W. 《Applied Physics A: Materials Science & Processing》2011,102(2):441-447
Liquid-immersion nanosecond-pulsed laser micromachining is introduced as an efficient way for device isolation and rapid prototyping
on GaN-on-sapphire wafer. Using deionized water as an ambient medium for laser micromachining, smooth trenches that are free
from redeposition can be formed in the GaN layer. Coupled with the large difference between the ablation thresholds and ultraviolet
absorption coefficients of GaN and sapphire, the GaN/sapphire interface can be left undamaged after the ablation process.
This technique overcomes the limitation of heat accumulation in nanosecond-pulse regime, and offers a cost-effective alternative
to ultrashort-pulse laser micromachining. In this report, the advantages offered by liquid immersion are elucidated in terms
of improved heat conduction, increased plasma-induced recoil pressure due to water confinement, weakened plasma shielding
effect in water, and the collapse of cavitation bubbles. Simulation results show that the reduced fluctuation of temperature
profile over time in water could be correlated with the reduced redeposition of Ga from thermal decomposition at the trench
sidewalls. 相似文献
482.
483.
484.
Ruibin Bai Tom van Woensel Graham Kendall Edmund K. Burke 《4OR: A Quarterly Journal of Operations Research》2013,11(1):31-55
In this paper, we propose a two-dimensional shelf space allocation model. The second dimension stems from the height of the shelf. This results in an integer nonlinear programming model with a complex form of objective function. We propose a multiple neighborhood approach which is a hybridization of a simulated annealing algorithm with a hyper-heuristic learning mechanism. Experiments based on empirical data from both real-world and artificial instances show that the shelf space utilization and the resulting sales can be greatly improved when compared with a gradient method. Sensitivity analysis on the input parameters and the shelf space show the benefits of the proposed algorithm both in sales and in robustness. 相似文献
485.
Edmund R. Peay 《The Journal of mathematical sociology》2013,37(2):161-192
In fields of study from cognition to organizations and social networks , empirical structures have been formally represented in terms of graph theoretical models. When the empirical relationships can be seen as valued, a valued graph or digraph is called for. Values have been conventionally identified with real numbers, but other sorts of entities (most often signs) have been used. In this paper, we demonstrate a general system under which graphs and digraphs with values that are not numbers may be used to represent various important properties and features of empirical structures. Special cases include multiplexity of relationships, formal and informal linkages in organizational structures, systems and their environments, and structural consistency principles. The general system incorporates a matrix methodology which permits the convenient analysis of empirical structures. These cases are also intended to exemplify the ways in which valued relational models may be developed to extend this kind of formalization and its methodology to other areas of substantive interest. 相似文献
486.
Edmund Landau 《Mathematische Zeitschrift》1919,5(1-2):147-153
Ohne Zusammenfassung 相似文献
487.
488.
489.
490.
Jacek Blazewicz Edmund K. Burke Marta Kasprzak Alexandr Kovalev Mikhail Y. Kovalyov 《Discrete Applied Mathematics》2009,157(17):3586-3592
In this paper, we analyse the computational complexity of an optimization version of the Simplified Partial Digest Problem (SPDP), which is a mathematical model for DNA mapping based on the results of a simplified partial digest experiment. We prove that recognizing 46.16% of the elements of the DNA map in the error-free simplified partial digest experiment is NP-hard in the strong sense. This implies that the problem of maximizing the number of correct elements of the DNA map in the error-free simplified partial digest experiment is pseudopolynomially non-approximable with the approximation ratio . 相似文献