全文获取类型
收费全文 | 3417篇 |
免费 | 107篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 61篇 |
综合类 | 6篇 |
化学工业 | 1044篇 |
金属工艺 | 66篇 |
机械仪表 | 36篇 |
建筑科学 | 208篇 |
矿业工程 | 31篇 |
能源动力 | 41篇 |
轻工业 | 417篇 |
水利工程 | 12篇 |
石油天然气 | 4篇 |
无线电 | 173篇 |
一般工业技术 | 464篇 |
冶金工业 | 500篇 |
原子能技术 | 39篇 |
自动化技术 | 426篇 |
出版年
2022年 | 32篇 |
2021年 | 39篇 |
2020年 | 30篇 |
2019年 | 34篇 |
2018年 | 53篇 |
2017年 | 47篇 |
2016年 | 73篇 |
2015年 | 90篇 |
2014年 | 88篇 |
2013年 | 127篇 |
2012年 | 129篇 |
2011年 | 167篇 |
2010年 | 113篇 |
2009年 | 125篇 |
2008年 | 126篇 |
2007年 | 146篇 |
2006年 | 124篇 |
2005年 | 120篇 |
2004年 | 107篇 |
2003年 | 75篇 |
2002年 | 73篇 |
2001年 | 55篇 |
2000年 | 60篇 |
1999年 | 62篇 |
1998年 | 128篇 |
1997年 | 89篇 |
1996年 | 95篇 |
1995年 | 73篇 |
1994年 | 77篇 |
1993年 | 62篇 |
1992年 | 54篇 |
1991年 | 49篇 |
1990年 | 40篇 |
1989年 | 45篇 |
1988年 | 28篇 |
1987年 | 38篇 |
1986年 | 33篇 |
1985年 | 45篇 |
1984年 | 36篇 |
1983年 | 40篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 35篇 |
1978年 | 27篇 |
1977年 | 38篇 |
1976年 | 43篇 |
1975年 | 42篇 |
1974年 | 22篇 |
1973年 | 28篇 |
1970年 | 31篇 |
排序方式: 共有3528条查询结果,搜索用时 15 毫秒
151.
152.
Klaus Kirschke Gerhard Lutze Ernst Schmitz 《Advanced Synthesis \u0026amp; Catalysis》1984,326(3):367-373
Ring Opening and Substitution Reactions of 4,4-Dihalo-pyrazolin-5-ones with Nucleophiles 1-Aryl-4,4-dihalo-3-methyl-pyrazolin-5-ones ( 1a – c ) undergo ring opening with alkoxides and form alkyl 3-arylazo-2-halo-2-butenoats ( 2a – d ). Analogous reactions take place with ammonia and amines. 4-Nitro-phenoxide reacts with substitution of both halogens to the 4,4-bis(4-nitro-phenyl)-compound ( 5 ). Phenols are selectively orthobrominated by the title compounds 1a and b . 相似文献
153.
154.
Structure and density of deposits formed on filter fibers by inertial particle deposition and bounce
The morphology and packing density of particle deposits formed by accumulation on thin steel fibers suspended in an aerosol stream were studied by confocal microscopy. Measurements were made with electrically neutral polystyrene spheres (dP=1.3, 2.0, 2.6 and 5.2 μm) as a function of flow velocity (v=0.7–5 m/s) and fiber diameters (dF=8 and 30 μm). Deposition under these conditions was dominated by inertia (Stokes number St=0.3–9), interception (interception parameter R=0.04–0.35) and particle bounce, with a negligible contribution from diffusion.The experiments show a systematic transition of deposit morphologies with a newly introduced particle bounce parameter β~St/R, where St and R are based on the diameter dF of the bare fiber. Compact, forward facing deposit structures dominate in case of significant particle bounce (i.e. for β>β?, where β* represents the critical conditions for the onset of bounce on the bare fiber). Dendritic structures with pronounced sideways branching are formed at β<β*. R is of relatively little influence as an independent parameter, probably because interception occurs mostly on preexisting deposit structures with dimensions in the order of dP.The mean porosity ε of the deposit structures was determined on the basis of contour measurements by confocal microscopy, in combination with data on the accumulated particle volume per unit fiber length (known accurately from a previous paper by Kasper, Schollmeier, Meyer, and Hoferer (2009). Once noticeable deposits had formed, ε was found to attain stable values between 0.80 at dP=1.3 μm and 0.55 at dp=5.2 μm. 相似文献
155.
A simplex-centroid design was used to investigate the physico-chemical properties of flour mixtures composed of cassava starch, rice flour, waxy rice flour and wheat flour on the one hand and linear expansion, texture and sound emission properties of crackers, made from theses mixtures on the other hand. 相似文献
156.
Claudia Loitsch Gerhard Weber Nikolaos Kaklanis Konstantinos Votis Dimitrios Tzovaras 《User Modeling and User-Adapted Interaction》2017,27(3-5):445-491
Moving between devices is omnipresent, but not for people with disabilities or those who require specific accessibility options. Setting up assistive technologies or finding settings to overcome a certain barrier can be a demanding task for people without technical skills. Context-sensitive adaptive user interfaces are advancing, although migrating access features from one device to another is very rarely addressed. In this paper, we describe the knowledge-based component of the Global Public Inclusive Infrastructure that infers how a device shall be best configured at the operating system layer, the application layer and the web layer to meet the requirements of a user including possible special needs or disabilities. In this regard, a mechanism to detect and resolve conflicting accessibility policies as well as recommending preference substitutes is a main requirement, as elaborated in this paper. As the proposed system emulates decision-making of accessibility experts, we validated the automatic deduced configurations against manual configurations of ten accessibility experts. The assessment result shows that the average matching score of the developed system is high. Thus, the proposed system can be considered capable of making precise decisions towards personalizing user interfaces based on user needs and preferences. 相似文献
157.
158.
159.
160.
Pedro Barahona Gemma Bel-Enguix Veronica Dahl M. Dolores Jiménez-López Ludwig Krippahl 《Natural computing》2014,13(2):169-177
Trees are a useful framework for classifying entities whose attributes are, at least partially, related through a common ancestry, such as species of organisms, family members or languages. In some common applications, such as phylogenetic trees based on DNA sequences, relatedness can be inferred from the statistical analysis of unweighted attributes. The vast majority of mutations that survive across generations are evolutionarily neutral, which means that most genetic differences between species will have accumulated independently and randomly. In these cases, it is possible to calculate the tree from a precomputed matrix of distances. In other cases, such as with anatomical traits or languages, the assumption of random and independent differences does not hold, making it necessary to consider some traits to be more relevant than others for determining how related two entities are. In this paper, we present a constraint programming approach that can enforce consistency between bounds on the relative weight of each trait and tree topologies, so that the user can best determine which sets of traits to use and how the entities are likely to be related. 相似文献