首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   603篇
  免费   52篇
电工技术   15篇
化学工业   208篇
金属工艺   3篇
机械仪表   11篇
建筑科学   23篇
矿业工程   3篇
能源动力   31篇
轻工业   95篇
水利工程   6篇
石油天然气   2篇
无线电   37篇
一般工业技术   106篇
冶金工业   16篇
原子能技术   5篇
自动化技术   94篇
  2024年   1篇
  2023年   5篇
  2022年   14篇
  2021年   28篇
  2020年   10篇
  2019年   21篇
  2018年   33篇
  2017年   24篇
  2016年   27篇
  2015年   14篇
  2014年   31篇
  2013年   56篇
  2012年   42篇
  2011年   52篇
  2010年   34篇
  2009年   35篇
  2008年   29篇
  2007年   33篇
  2006年   31篇
  2005年   17篇
  2004年   20篇
  2003年   16篇
  2002年   14篇
  2001年   5篇
  2000年   6篇
  1999年   5篇
  1998年   4篇
  1997年   2篇
  1996年   5篇
  1995年   4篇
  1994年   3篇
  1993年   4篇
  1992年   2篇
  1991年   1篇
  1990年   1篇
  1989年   1篇
  1988年   1篇
  1986年   1篇
  1985年   5篇
  1984年   2篇
  1983年   2篇
  1982年   2篇
  1981年   1篇
  1980年   2篇
  1979年   2篇
  1978年   3篇
  1977年   1篇
  1975年   2篇
  1969年   1篇
排序方式: 共有655条查询结果,搜索用时 15 毫秒
11.
We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao+ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.  相似文献   
12.
Recently, the development of efficient and environmentally benign solvents has received great attention to replace current harsh organic solvents. In this context, low-transition-temperature mixtures (LTTMs) have emerged as favorable green solvents for biomass delignification. Palm oil biomass, empty fruit bunch (EFB) was pretreated with commercial l-malic acid and microwave hydrothermally extracted cactus malic acid-derived LTTMs at 60, 80, and 100 °C. The LTTMs applied in this study were derived from malic acid–choline chloride–water and malic acid–monosodium glutamate–water with a molar ratio of 2:4:2 and 3:1:5, respectively. Three first-order reactions were used to express the delignification kinetic model of EFB. The first term was based on the initial stage and assigned as infinite due to the fast rate of delignification which could not be detected. The second and third terms were proportional to bulk and residual delignification stages. A good agreement was obtained between the kinetic model and the experimental data obtained in this study with R2?≥?0.91. The activation energies for the delignification reactions using l-malic acid and cactus malic acid-based LTTMs in the bulk and residual stages were approximated as 36–56 and 19–26 kJ/mol and 34–90 and 47–87 kJ/mol, respectively.  相似文献   
13.
Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing.In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible.This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking.  相似文献   
14.
15.
We apply signal processing techniques to the study of wireless sensor networks, whose nodes are deployed over a planar region for environmental monitoring. We address the problem of reconstructing the phenomenon of interest at a sink node, from the samples gathered by the sensors, and we evaluate the system performance in presence of both a flat and a clustered network topology. When the sensors are grouped into (possibly overlapping) clusters, the data collected within each cluster are compressed by the cluster head and sent to the sink node. By representing the compressed data through the Fourier coefficients of the field spectrum, we analyze both the case where the sensor positions are known to the sink, and the case where they are available at the cluster head only. We show that clustering significantly reduces the energy expenditure due to data transmission with respect to the case of a flat network topology, and, most importantly, we derive the possible degradation of the quality of the reconstructed field due to compression.  相似文献   
16.
In this paper, we present results of a discontinuous Galerkin (DG) scheme applied to deterministic computations of the transients for the Boltzmann–Poisson system describing electron transport in semiconductor devices. The collisional term models optical-phonon interactions which become dominant under strong energetic conditions corresponding to nano-scale active regions under applied bias. The proposed numerical technique is a finite element method using discontinuous piecewise polynomials as basis functions on unstructured meshes. It is applied to simulate hot electron transport in bulk silicon, in a silicon n+nn+ diode and in a double gated 12 nm MOSFET. Additionally, the obtained results are compared to those of a high order WENO scheme simulation and DSMC (Discrete Simulation Monte Carlo) solvers.  相似文献   
17.
The simulation of the wind action over the CAARC (Commonwealth Advisory Aeronautical Council) standard tall building model is performed in the present work. Aerodynamic and aeroelastic analyses are reproduced numerically in order to demonstrate the applicability of CFD techniques in the field of wind engineering. A major topic in this paper is referred to one of the first attempts to simulate the aeroelastic behavior of a tall building employing complex CFD techniques. Numerical results obtained in this work are compared with numerical and wind tunnel measurements and some important concluding remarks about the present simulation are also reported.  相似文献   
18.
We correct a fundamental formula from paper “A Robust Real-Time Ellipse Detector” by Zhang and Liu published in journal “Pattern Recognition” in 2005.  相似文献   
19.
Pump operating as turbine (PAT) is an effective source of reducing the equipment cost in small hydropower plants. However, the manufacturers provide poor information on the PAT performance thus representing a limit for its wider diffusion. Additional implementation difficulties arise under variable operating conditions, characteristic of water distribution networks (WDNs). WDNs allow to obtain widespread and globally significant amount of produced energy by exploiting the head drop due to the network pressure control strategy for leak reductions. Thus a design procedure is proposed that couples a parallel hydraulic circuit with an overall plant efficiency criteria for the market pump selection within a WDN. The proposed design method allows to identify the performance curves of the PAT that maximizes the produced energy for an assigned flow and pressure-head distribution pattern. Finally, computational fluid dynamics (CFD) is shown as a suitable alternative for performance curve assessment covering the limited number of experimental data.  相似文献   
20.
Engineering frameworks are currently required to support the easy, low-cost, modular and integrated development of manufacturing systems addressing the emergent requirements of re-configurability, responsiveness and robustness. This paper discusses the integration of 2D/3D digital software tools with Petri net based service-oriented frameworks to allow the design, configuration, analysis, validation, simulation, monitoring and control of manufacturing systems in a virtual environment and its posterior smooth migration into the real ??physical?? environment. An experimental case study was implemented to validate the proposed concepts, using the Continuum platform to design, compose, analyze, validate and simulate the Petri nets based service-oriented manufacturing control system, and the Delmia AutomationTM software suite to support the rapid prototyping and the easy simulation of the designed control solution. The experimental results prove several aspects of the proposed approach, notably the smooth migration between the design and the operation phases, one of the main objectives of the work.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号