全文获取类型
收费全文 | 2210篇 |
免费 | 89篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 18篇 |
综合类 | 2篇 |
化学工业 | 660篇 |
金属工艺 | 72篇 |
机械仪表 | 48篇 |
建筑科学 | 79篇 |
矿业工程 | 5篇 |
能源动力 | 65篇 |
轻工业 | 195篇 |
水利工程 | 11篇 |
石油天然气 | 1篇 |
无线电 | 207篇 |
一般工业技术 | 463篇 |
冶金工业 | 101篇 |
原子能技术 | 36篇 |
自动化技术 | 342篇 |
出版年
2023年 | 13篇 |
2022年 | 29篇 |
2021年 | 48篇 |
2020年 | 25篇 |
2019年 | 26篇 |
2018年 | 41篇 |
2017年 | 51篇 |
2016年 | 47篇 |
2015年 | 35篇 |
2014年 | 71篇 |
2013年 | 131篇 |
2012年 | 128篇 |
2011年 | 159篇 |
2010年 | 114篇 |
2009年 | 123篇 |
2008年 | 136篇 |
2007年 | 110篇 |
2006年 | 113篇 |
2005年 | 80篇 |
2004年 | 68篇 |
2003年 | 63篇 |
2002年 | 79篇 |
2001年 | 42篇 |
2000年 | 40篇 |
1999年 | 33篇 |
1998年 | 39篇 |
1997年 | 39篇 |
1996年 | 31篇 |
1995年 | 30篇 |
1994年 | 25篇 |
1993年 | 30篇 |
1992年 | 16篇 |
1991年 | 19篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 16篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 15篇 |
1982年 | 15篇 |
1981年 | 18篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 14篇 |
1976年 | 16篇 |
1975年 | 10篇 |
1974年 | 9篇 |
1972年 | 7篇 |
排序方式: 共有2305条查询结果,搜索用时 15 毫秒
41.
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... 相似文献
42.
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. 相似文献
43.
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. 相似文献
44.
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. 相似文献
45.
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. 相似文献
46.
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. 相似文献
47.
Wen Guang Qu Wonseok Oh Alain Pinsonneault 《The Journal of Strategic Information Systems》2010,19(2):96-108
Although research on the business impact of IT outsourcing abounds, little is known about the relative strategic value of IT outsourcing and IT insourcing. Drawing upon the knowledge-based view of the firm, this study postulates that, compared with IT outsourcing, IT insourcing is more effective for developing IT-enabled business processes (IEBP), which subsequently lead to superior firm performance. Our analysis of the data from InformationWeek and Compustat shows that IT insourcing is positively associated with IEBP, while the relationship between IT outsourcing and IEBP is not statistically significant. We also find that IEBP have a significant influence on firm performance. Finally, the effect of IT sourcing mechanisms on IEBP and the effect of IEBP on firm performance are both moderated by the type of innovation related to IEBP. The results suggest that in order to improve their performance firms should consider IT an integral part of their strategic core and should be proactively involved in the internal development of IT resources. We conclude with managerial implications and directions for future research. 相似文献
48.
Jonathan Gaudreault Jean-Marc Frayret Alain Rousseau Sophie D’Amours 《Computers & Operations Research》2011
Many research initiatives carried out in production management consider process planning and operations scheduling as two separate and sequential functions. However, in certain contexts, the two functions must be better integrated. This is the case in divergent production systems with co-production (i.e. production of different products at the same time from a single product input) when alternative production processes are available. This paper studies such a context and focuses on the case of drying and finishing operations in a softwood lumber facility. The situation is addressed using a single model that simultaneously performs process planning and scheduling. We evaluate two alternative formulations. The first one is based on mixed integer programming (MIP) and the second on constraint programming (CP). We also propose a search procedure to improve the performance of the CP approach. Both approaches are compared with respect to their capacity to generate good solutions in short computation time. 相似文献
49.
50.
Applications implemented on critical systems are subject to both safety critical and real-time constraints. Classically, applications are specified as precedence task graphs that must be scheduled onto a given target multiprocessor heterogeneous architecture. We propose a new method for simultaneously optimizing two objectives: the execution time and the reliability of the schedule. The problem is decomposed into two successive steps: a spatial allocation during which the reliability is maximized (randomized algorithm), and a scheduling during which the makespan is minimized (list scheduling algorithm). It allows us to produce several trade-off solutions, among which the user can choose the solution that best fits the application’s requirements. Reliability is increased by replicating adequate tasks onto well chosen processors. Our fault model assumes that processors are fail-silent, that they are subject to transient failures, and that the occurrences of failures follow a constant parameter Poisson law. We assess and validate our method by running extensive simulations on both random graphs and actual application graphs. They show that it is competitive, in terms of makespan, compared to existing reference scheduling methods for heterogeneous processors (HEFT), while providing a better reliability. 相似文献