首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   533篇
  免费   12篇
电工技术   5篇
化学工业   86篇
机械仪表   3篇
建筑科学   9篇
能源动力   19篇
轻工业   21篇
水利工程   4篇
无线电   92篇
一般工业技术   58篇
冶金工业   15篇
原子能技术   1篇
自动化技术   232篇
  2024年   1篇
  2023年   3篇
  2022年   4篇
  2021年   8篇
  2020年   3篇
  2019年   6篇
  2018年   12篇
  2017年   7篇
  2016年   22篇
  2015年   14篇
  2014年   26篇
  2013年   31篇
  2012年   35篇
  2011年   48篇
  2010年   40篇
  2009年   42篇
  2008年   37篇
  2007年   31篇
  2006年   31篇
  2005年   18篇
  2004年   14篇
  2003年   17篇
  2002年   18篇
  2001年   9篇
  2000年   7篇
  1999年   6篇
  1998年   9篇
  1997年   5篇
  1996年   2篇
  1995年   2篇
  1994年   3篇
  1993年   3篇
  1992年   2篇
  1990年   2篇
  1989年   7篇
  1987年   2篇
  1986年   1篇
  1985年   2篇
  1984年   3篇
  1983年   1篇
  1981年   2篇
  1979年   3篇
  1978年   1篇
  1977年   2篇
  1975年   1篇
  1973年   2篇
排序方式: 共有545条查询结果,搜索用时 15 毫秒
31.
Surface tensions (σ) of binary liquid mixtures of acetonitrile (ACN) with 1-propanol (PrOH) were measured over the entire composition range at eight different temperatures, 278.15 K, 283.15 K, 288.15 K, 293.15 K, 298.15 K, 303.15 K, 308.15 K, and 313.15 K. The lyophobicities (β) of the surfactant PrOH relative to that of ACN as well as the surface mole fractions () of PrOH at various temperatures were derived using the extended Langmuir model (Langmuir 17, 4261, 2001). The β values indicate the greater affinity of PrOH for the surface, and this trend slightly increases with rising temperature. The determined values indicate that the surface concentration of PrOH is always higher than its bulk concentration and consequently confirm that the surface is enriched with PrOH.  相似文献   
32.
We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formula in propositional logic with the property that every variable appears exactly once. Such a formula can be represented by a tree, where the leaves correspond to variables, and the internal nodes are labeled by binary connectives. Under certain assumptions, this representation is unique. Thus, one can define the depth of a formula as the depth of the tree that represents it. The complexity of the evaluation of general read-once formulae has attracted interest mainly in the decision tree model. In the communication complexity model many interesting results deal with specific read-once formulae, such as DISJOINTNESS and TRIBES. In this paper we use information theory methods to prove lower bounds that hold for any read-once formula. Our lower bounds are of the form n(f)/cd(f), where n(f) is the number of variables and d(f) is the depth of the formula, and they are optimal up to the constant in the base of the denominator.  相似文献   
33.
34.
The effects of carbon black, talc, and ultrafine silica filler, at different filler, loading, on the compatibility of two binary blends was examined. These were, the mechanically compatible polyurethane (PU)/poly(vinyl chloride) (PVC) at 25/75 weight ratio, and the poly(ε-caprolactone) (PCL)/styrene–acylonitrile (SAN) copolymer (with 30% AN content), at the 50/50 blend composition. For the former system, both dynamic mechanical analysis (DMA) and DSC measurements indicated that, depending on the filler surface, boundary layers are formed at the filler–matrix interface shifting the PU relaxation to higher temperatures. No significant effect was observed for the PVC component. Though the mechanical spectra are also affected, essentially no Tg shifts were observed for the PCL–SAN system. A qualitative explanation of selective filler activity towards the blend components was given by invoking the matrix–filler basic–acidic nature. Overall, the fillers had no compatibilizing effect on the blend. Using available theory both DSC and the DMA techniques agree in their estimate of the boundary layer thickness. Moduli data were also analyzed using mechanics models proposed for composite systems.  相似文献   
35.
Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), there is currently no method for dynamic settings. In this paper, we consider the continuous assignment problem (CAP), where an optimal assignment must be constantly maintained between mobile users and a set of servers. The fact that the users are mobile necessitates real-time reassignment so that the quality of service remains high (i.e., their distance from their assigned servers is minimized). The large scale and the time-critical nature of targeted applications require fast CAP solutions. We propose an algorithm that utilizes the geometric characteristics of the problem and significantly accelerates the initial assignment computation and its subsequent maintenance. Our method applies to different cost functions (e.g., average squared distance) and to any Minkowski distance metric (e.g., Euclidean, L 1 norm, etc.).  相似文献   
36.
The potential of certain Auger electron emitting nuclides for systemic radiotherapeutic applications has recently gained much attention. In particular, the ability of several nuclides, including 111In, 125I, and 123I, to induce DNA double-strand breaks (dsb), a good indicator of cytotoxicity, has been extensively studied. However, this ability has never previously been shown experimentally for 99mTc, which, besides the well-known gamma radiation that is used for diagnostic applications, also emits an average of 1.1 conversion electrons and 4 Auger or Coster-Kronig electrons per decay. Owing to the short range of Auger electrons, the radionuclide needs to be located very close to the DNA for dsb to occur. We synthesized two cationic 99mTcI-tricarbonyl complexes with pendant DNA binders, pyrene and anthraquinone. The X-ray crystal structures of the two complexes could be elucidated. Linear dichroism and UV/Vis spectroscopy revealed that the complex with pyrene intercalates DNA with a stability constant, K, of 1.1 x 10(6) M(-1), while the analogous complex with anthraquinone interacts with DNA in a groove-binding mode and has an affinity value of K=8.9 x 10(4) M(-1). We showed with phiX174 double-stranded DNA that the corresponding 99mTc complexes induce a significant amount of dsb, whereas non-DNA-binding [TcO4]- and nonradioactive Re compounds did not. These results indicate that the Auger electron emitter 99mTc can induce dsb in DNA when decaying in its direct vicinity and this implies potential for systemic radiotherapy with 99mTc complexes.  相似文献   
37.
This article presents a GRID framework for distributed computations in the chemical process industries. We advocate a generic agent-based GRID environment in which chemical processes can be represented, simulated, and optimized as a set of autonomous, collaborative software agents. The framework features numerous advantages in terms of scalability, software reuse, security, and distributed resource discovery and utilization. It is a novel example of how advanced distributed techniques and paradigms can be elegantly applied in the area of chemical engineering to support distributed computations and discovery functions in chemical process engineering. A prototype implementation of the proposed framework for chemical process design is presented to illustrate the concepts.  相似文献   
38.
39.
Similarity search is a core module of many data analysis tasks, including search by example, classification, and clustering. For time series data, Dynamic Time Warping (DTW) has been proven a very effective similarity measure, since it minimizes the effects of shifting and distortion in time. However, the quadratic cost of DTW computation to the length of the matched sequences makes its direct application on databases of long time series very expensive. We propose a technique that decomposes the sequences into a number of segments and uses cheap approximations thereof to compute fast lower bounds for their warping distances. We present several, progressively tighter bounds, relying on the existence or not of warping constraints. Finally, we develop an index and a multi-step technique that uses the proposed bounds and performs two levels of filtering to efficiently process similarity queries. A thorough experimental study suggests that our method consistently outperforms state-of-the-art methods for DTW similarity search.  相似文献   
40.
Reference structure tomography   总被引:1,自引:0,他引:1  
Reference structure tomography (RST) uses multidimensional modulations to encode mappings between radiating objects and measurements. RST may be used to image source-density distributions, estimate source parameters, or classify sources. The RST paradigm permits scan-free multidimensional imaging, data-efficient and computation-efficient source analysis, and direct abstraction of physical features. We introduce the basic concepts of RST and illustrate the use of RST for multidimensional imaging based on a geometric radiation model.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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