全文获取类型
收费全文 | 8375篇 |
免费 | 282篇 |
国内免费 | 188篇 |
专业分类
电工技术 | 225篇 |
技术理论 | 2篇 |
综合类 | 911篇 |
化学工业 | 516篇 |
金属工艺 | 315篇 |
机械仪表 | 387篇 |
建筑科学 | 1404篇 |
矿业工程 | 298篇 |
能源动力 | 192篇 |
轻工业 | 225篇 |
水利工程 | 220篇 |
石油天然气 | 90篇 |
武器工业 | 19篇 |
无线电 | 231篇 |
一般工业技术 | 894篇 |
冶金工业 | 847篇 |
原子能技术 | 28篇 |
自动化技术 | 2041篇 |
出版年
2024年 | 16篇 |
2023年 | 27篇 |
2022年 | 98篇 |
2021年 | 105篇 |
2020年 | 159篇 |
2019年 | 127篇 |
2018年 | 129篇 |
2017年 | 132篇 |
2016年 | 165篇 |
2015年 | 206篇 |
2014年 | 716篇 |
2013年 | 501篇 |
2012年 | 638篇 |
2011年 | 676篇 |
2010年 | 516篇 |
2009年 | 532篇 |
2008年 | 460篇 |
2007年 | 507篇 |
2006年 | 449篇 |
2005年 | 391篇 |
2004年 | 375篇 |
2003年 | 344篇 |
2002年 | 279篇 |
2001年 | 213篇 |
2000年 | 160篇 |
1999年 | 135篇 |
1998年 | 134篇 |
1997年 | 92篇 |
1996年 | 79篇 |
1995年 | 91篇 |
1994年 | 53篇 |
1993年 | 32篇 |
1992年 | 30篇 |
1991年 | 23篇 |
1990年 | 37篇 |
1989年 | 22篇 |
1988年 | 15篇 |
1987年 | 18篇 |
1986年 | 20篇 |
1985年 | 6篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 13篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1976年 | 6篇 |
1966年 | 8篇 |
1965年 | 8篇 |
1963年 | 8篇 |
排序方式: 共有8845条查询结果,搜索用时 15 毫秒
1.
Tao Feng Mingde Tong Shuotian Yao Hejun Li Shifeng Wen Hongjiao Lin 《Journal of the European Ceramic Society》2021,41(1):158-166
Composites based on hafnium carbide and reinforced with continuous naked carbon fiber with and without PyC interface were prepared at low temperature by precursor infiltration and pyrolysis and chemical vapor deposition method. The microstructure, mechanical property, cyclic ablation and fiber bundle push-in tests of the composites were investigated. The results show that after three times ablation cycles, the bending strength of samples without PyC interface decreased by 63.6 %; the bending strength of samples with PyC interface only decreased by 37.8 %. The force displacement curve of the samples with PyC interface presented a well pseudoplastic deformation state. The mechanical behavior difference of two kinds of composites was due to crucial function of PyC interface phase including protection of fiber and weakening of fiber/matrix interface. 相似文献
2.
Daniela Fogli Antonio Piccinno Stefan Carmien Gerhard Fischer 《Behaviour & Information Technology》2020,39(1):27-46
ABSTRACTThe digital age of the future is ‘not out there to be discovered’, but it needs to be ‘designed’. The design challenge has to address questions about how we want to live, work, and learn (as individuals and as communities) and what we value and appreciate, e.g.: reflecting on quality of life and creating inclusive societies. An overriding design trade-off for the digital age is whether new developments will increase the digital divide or will create more inclusive societies. Sustaining inclusive societies means allowing people of all ages and all abilities to exploit information technologies for personally meaningful activities. Meta-design fosters the design of socio-technical environments that end-user developers can modify and evolve at use time to improve their quality of life and favour their inclusion in the society. This paper describes three case studies in the domain of assistive technologies in which end users themselves cannot act as end-user developers, but someone else (e.g.: a caregiver or a clinician) must accept this role requiring multi-tiered architectures. The design trade-offs and requirements for meta-design identified in the context of the case studies and other researchers’ projects are described to inform the development of future socio-technical environments focused on social inclusion. 相似文献
3.
4.
For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. 相似文献
5.
Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead. 相似文献
6.
Anis Zeglaoui Anouar Houmia Maher Mejai Radhouane Aloui 《International Journal of Adaptive Control and Signal Processing》2021,35(9):1842-1859
In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method. 相似文献
7.
进入新发展阶段,中国水资源安全保障需要以“节水优先、空间均衡、系统治理、两手发力”治水思路为指导,厘清问题、研判趋势、优化对策,支撑新阶段水利高质量发展。本文在全面分析我国水资源安全保障存在的突出问题与面临形势基础上,阐述了新发展阶段中国水资源安全保障的基本思路与战略路径,从保证资源安全、构建国家水网、强化供水保障、建设美丽河湖、改善水环境质量等方面提出了战略对策和需要进一步回答的重大问题,以期为完善新发展阶段中国水资源安全保障战略,全面提高国家水资源安全保障能力提供有力支撑。 相似文献
8.
D.R. Santos‐Peñate C.M. Campos‐Rodríguez J.A. Moreno‐Pérez 《International Transactions in Operational Research》2019,26(1):340-363
The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included. 相似文献
9.
G. Inglese 《Inverse Problems in Science & Engineering》2019,27(4):439-459
We deal with the mathematical model of the incremental degradation of the internal coating (e.g. a polymeric material) of a metallic pipe in which a fluid flows relatively fast. The fluid drags solid impurities so that longitudinal scratches, inaccessible to any direct inspection procedure, are produced on the coating. Time evolution of this kind of defects can be reconstructed from the knowledge of a sequence of temperature maps of the external surface. The time-varying orthogonal section of this damaged interface is determined as a function of time and polar angle through the identification of a suitable effective heat transfer coefficient by means of Thin Plate Approximation. 相似文献
10.
This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems. 相似文献