全文获取类型
收费全文 | 2225篇 |
免费 | 90篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 18篇 |
综合类 | 2篇 |
化学工业 | 653篇 |
金属工艺 | 71篇 |
机械仪表 | 48篇 |
建筑科学 | 79篇 |
矿业工程 | 5篇 |
能源动力 | 66篇 |
轻工业 | 196篇 |
水利工程 | 11篇 |
石油天然气 | 1篇 |
无线电 | 207篇 |
一般工业技术 | 466篇 |
冶金工业 | 112篇 |
原子能技术 | 36篇 |
自动化技术 | 350篇 |
出版年
2023年 | 9篇 |
2022年 | 25篇 |
2021年 | 47篇 |
2020年 | 25篇 |
2019年 | 26篇 |
2018年 | 41篇 |
2017年 | 52篇 |
2016年 | 49篇 |
2015年 | 35篇 |
2014年 | 73篇 |
2013年 | 134篇 |
2012年 | 129篇 |
2011年 | 160篇 |
2010年 | 115篇 |
2009年 | 125篇 |
2008年 | 137篇 |
2007年 | 111篇 |
2006年 | 113篇 |
2005年 | 81篇 |
2004年 | 69篇 |
2003年 | 63篇 |
2002年 | 78篇 |
2001年 | 42篇 |
2000年 | 40篇 |
1999年 | 33篇 |
1998年 | 40篇 |
1997年 | 42篇 |
1996年 | 33篇 |
1995年 | 30篇 |
1994年 | 25篇 |
1993年 | 30篇 |
1992年 | 16篇 |
1991年 | 20篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 15篇 |
1984年 | 16篇 |
1983年 | 15篇 |
1982年 | 15篇 |
1981年 | 18篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 14篇 |
1976年 | 16篇 |
1975年 | 10篇 |
1974年 | 9篇 |
1972年 | 7篇 |
排序方式: 共有2321条查询结果,搜索用时 328 毫秒
41.
Abdoul Bitar Stéphane Dauzère-Pérès Claude Yugma Renaud Roussel 《Journal of Scheduling》2016,19(4):367-376
In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time. 相似文献
42.
The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion. 相似文献
43.
This paper presents a new algorithm to efficiently maintain Bounding-Volume Hierarchies (BVHs) for fast distance queries with deformable polygon meshes using multi-core architectures. The method involves inflating the bounding volumes in an efficient manner to guarantee the enclosure of the deformable model within the BVH at all times. This is done at low additional computation and memory cost without significantly degrading the quality of the BVH and also in a fashion that allows a simple parallel implementation. Additionally, to facilitate fast queries specifically for deforming meshes, we propose a novel algorithm for the bottom-up construction of BVHs that results in much faster distance queries. 相似文献
44.
Annals of Telecommunications - Le partage du risque est une des raisons les plus souvent avancées pour expliquer les clauses financières des contrats de licence. Pour autant, aucune... 相似文献
45.
Letf: {0,1}
n
{0,1}
m
be anm-output Boolean function inn variables.f is called ak-slice iff(x) equals the all-zero vector for allx with Hamming weight less thank andf(x) equals the all-one vector for allx with Hamming weight more thank. Wegener showed that PI
k
-set circuits (set circuits over prime implicants of lengthk) are at the heart of any optimum Boolean circuit for ak-slicef. We prove that, in PI
k
-set circuits, savings are possible for the mass production of anyFX, i.e., any collectionF ofm output-sets given any collectionX ofn input-sets, if their PI
k
-set complexity satisfiesSC
m
(FX)3n+2m. This PI
k
mass production, which can be used in monotone circuits for slice functions, is then exploited in different ways to obtain a monotone circuit of complexity 3n+o(n) for the Neiporuk slice, thus disproving a conjecture by Wegener that this slice has monotone complexity (n
3/2). Finally, the new circuit for the Neiporuk slice is proven to be asymptotically optimal, not only with respect to monotone complexity, but also with respect to combinational complexity. 相似文献
46.
Ibrahima Ka Ivy M. Asuo Suchismita Basu Paul Fourmont Dawit M. Gedamu Alain Pignolet Sylvain G. Cloutier Riad Nechache 《Small (Weinheim an der Bergstrasse, Germany)》2018,14(38)
The morphology of hybrid organic–inorganic perovskite films is known to strongly affect the performance of perovskite‐based solar cells. CH3NH3PbI3‐xClx (MAPbI3‐xClx) films have been previously fabricated with 100% surface coverage in glove boxes. In ambient air, fabrication generally relies on solvent engineering to obtain compact films. In contrast, this work explores the potential of altering the perovskites microstructure for solar cell engineering. This work starts with CH3NH3PbI3‐xClx, films with grain morphology carefully controlled by varying the deposition speed during the spin‐coating process to fabricate efficient and partially transparent solar cells. Devices produced with a CH3NH3PbI3‐xClx film and a compact thick top gold electrode reach a maximum efficiency of 10.2% but display a large photocurrent hysteresis. As it is demonstrated, the introduction of different concentrations of bromide in the precursor solution addresses the hysteresis issues and turns the film morphology into a partially transparent interconnected network of 1D microstructures. This approach leads to semitransparent solar cells with negligible hysteresis and efficiencies up to 7.2%, while allowing average transmission of 17% across the visible spectrum. This work demonstrates that the optimization of the perovskites composition can mitigate the hysteresis effects commonly attributed to the charge trapping within the perovskite film. 相似文献
47.
An improved algorithm for disaggregating microwave-derived soil moisture based on red, near-infrared and thermal-infrared data 总被引:3,自引:0,他引:3
Accurate high-resolution soil moisture data are needed for a range of agricultural and hydrologic activities. To improve the spatial resolution of ∼ 40 km resolution passive microwave-derived soil moisture, a methodology based on 1 km resolution MODIS (MODerate resolution Imaging Spectroradiometer) red, near-infrared and thermal-infrared data has been implemented at 4 km resolution. The three components of that method are (i) fractional vegetation cover, (ii) soil evaporative efficiency (defined as the ratio of actual to potential evaporation) and (iii) a downscaling relationship. In this paper, 36 different disaggregation algorithms are built from 3 fractional vegetation cover formulations, 3 soil evaporative efficiency models, and 4 downscaling relationships. All algorithms differ with regard to the representation of the nonlinear relationship between microwave-derived soil moisture and optical-derived soil evaporative efficiency. Airborne L-band data collected over an Australian agricultural area are used to both generate ∼ 40 km resolution microwave pixels and verify disaggregation results at 4 km resolution. Among the 36 disaggregation algorithms, one is identified as being more robust (insensitive to soil, vegetation and atmospheric variables) than the others with a mean slope between MODIS-disaggregated and L-band derived soil moisture of 0.94. The robustness of that algorithm is notably assessed by comparing the disaggregation results obtained using composited (averaged) Terra and Aqua MODIS data, and using data from Terra and Aqua separately. The error on disaggregated soil moisture is systematically reduced by compositing daily Terra and Aqua data with an error of 0.012 vol./vol. 相似文献
48.
The effects of numerical viscosity, subgrid scale (SGS) viscosity and grid resolution are investigated in LES and VMS-LES simulations of the flow around a circular cylinder at Re=3900 on unstructured grids. The separation between the largest and the smallest resolved scales in the VMS formulation is obtained through a variational projection operator and finite-volume cell agglomeration. Three different non-dynamic eddy-viscosity SGS models are used both in classical and in VMS-LES. The so-called small-small formulation is used in VMS-LES, i.e. the SGS viscosity is computed as a function of the smallest resolved scales. Two different grid resolutions are considered. It is found that, for each considered SGS model, the amount of SGS viscosity introduced in the VMS-LES formulation is significantly lower than in classical LES. This, together with the fact that in the VMS formulation the SGS viscosity only acts on the smallest resolved scales, has a strong impact on the results. However, a significant sensitivity of the results to the considered SGS model remains also in the VMS-LES formulation. Moreover, passing from classical LES to VMS-LES does not systematically lead to an improvement of the quality of the numerical predictions. 相似文献
49.
Abstract: Enterprise production is becoming more and more knowledge oriented nowadays and knowledge management is playing a key role in making commercial profit and maintaining enterprise competence. Knowledge characterization and measurement are the bases of knowledge management, and this paper aims to develop a method for characterizing and measuring knowledge in a comprehensive and practical way. Knowledge in its static state is modelled as a vector, whose values vary with the situation, and changes in state are modelled as a finite state machine. 相似文献
50.
Claudia Archetti Dominique Feillet Alain Hertz M. Grazia Speranza 《Computers & Operations Research》2010,37(11):1860-1869
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available. 相似文献