首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   735篇
  免费   32篇
电工技术   12篇
化学工业   163篇
金属工艺   15篇
机械仪表   12篇
建筑科学   27篇
能源动力   6篇
轻工业   92篇
水利工程   4篇
石油天然气   1篇
武器工业   1篇
无线电   54篇
一般工业技术   128篇
冶金工业   121篇
原子能技术   9篇
自动化技术   122篇
  2023年   7篇
  2022年   6篇
  2021年   10篇
  2020年   14篇
  2019年   7篇
  2018年   8篇
  2017年   11篇
  2016年   20篇
  2015年   23篇
  2014年   14篇
  2013年   26篇
  2012年   20篇
  2011年   35篇
  2010年   28篇
  2009年   24篇
  2008年   33篇
  2007年   25篇
  2006年   31篇
  2005年   17篇
  2004年   27篇
  2003年   17篇
  2002年   15篇
  2001年   12篇
  2000年   13篇
  1999年   12篇
  1998年   50篇
  1997年   25篇
  1996年   25篇
  1995年   30篇
  1994年   12篇
  1993年   12篇
  1992年   5篇
  1991年   6篇
  1990年   7篇
  1989年   14篇
  1988年   6篇
  1987年   17篇
  1986年   6篇
  1983年   3篇
  1982年   6篇
  1981年   7篇
  1980年   11篇
  1979年   7篇
  1978年   4篇
  1977年   3篇
  1976年   12篇
  1975年   4篇
  1974年   5篇
  1972年   3篇
  1950年   3篇
排序方式: 共有767条查询结果,搜索用时 15 毫秒
11.
A novel procedure is outlined whereby fracture toughness values for ceramics can be measured under uniaxial tension (mode I) in specimens containing a fatigue crack. Circumferentially notched rods of rapolycrystalline aluminum oxide were precracked in cyclic compression to introduce a fatigue crack at room temperature, following the technique proposed by Suresh and co-workers.7,10,11 Subsequently, the precracked rods were fractured in pure tension. Highly reproducible values of fracture toughness were obtained using this method.  相似文献   
12.
13.
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both with unit and non-unit coefficients? Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance than resorting to constraint decomposition. This paper shows how to use views to derive propagator variants, combining the efficiency of dedicated propagator implementations with the simplicity and effortlessness of decomposition. A model for views and derived propagators is introduced. Derived propagators are proved to be perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. The paper introduces an implementation architecture for views that is independent of the underlying constraint programming system. A detailed evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.  相似文献   
14.
We study critical-level inventory-management policies as means to provide differentiated (\(\alpha \) and \(\beta \)) service levels to more than two classes of customers. First, we derive closed-form expressions for the service levels of a single-period critical-level policy with an arbitrary number of customer classes (with Poisson demand). Based on the service-level expressions, we derive additional structural insights and provide an efficient algorithm with which to compute the essential system parameters, that is, the minimum required starting inventory and the associated critical levels. Based on these results, we conduct numerical experiments and develop structural insights into the system’s behavior.  相似文献   
15.
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs Leavens et al. (Formal Aspects Comput (FACS) 19:159–189, 2007). The dynamic frames approach is a promising solution to this problem. However, the approach is formalized in the context of an idealized logical framework. In particular, it is not clear the solution is suitable for use within a program verifier for a Java-like language based on verification condition generation and automated, first-order theorem proving. In this paper, we demonstrate that the dynamic frames approach can be integrated into an automatic verifier based on verification condition generation and automated theorem proving. The approach has been proven sound and has been implemented in a verifier prototype. The prototype has been used to prove correctness of several programming patterns considered challenging in related work.  相似文献   
16.
We present a method to measure the absorption of water molecules from the liquid and the vapour phase into polymer nano-films and the diffusion inside these films. Film thickness can be down to 45 nm. To demonstrate the possibilities of this method we use polymer films that are deposited on the upper side of a silicon cantilever by plasma polymerization of norbornene. When a microdrop of water is deposited onto the initially straight cantilever, the drop causes the cantilever to bend while it evaporates. Evaporation of such small water drops usually takes less than a second. An upwards bending is due to capillary forces and a downwards bending is due to the diffusion of water into the polymer film – and the consequent volume expansion (swelling) of the film. The magnitude of the capillary forces and the extent of swelling continuously change during drop evaporation. When drop evaporation is over the cantilever returns to its initial straight position. We simulate the time dependent bending with a numerical model that qualitatively agrees with the experiment. From the time dependence of cantilever bending we are able to determine the diffusion coefficient of water in the thin polymer film.  相似文献   
17.
The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high‐resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well‐suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high‐quality soft shadows and dynamic lights moving on fixed‐trajectories.  相似文献   
18.
We provide a rigorous framework for language and platform independent design and analysis of exception handling mechanisms in modern programming languages and their implementations. To illustrate the practicality of the method we develop it for the exception handling mechanism of Java and show that its implementation on the Java Virtual Machine (JVM) Is correct. For this purpose we define precise abstract models for exception handling in Java and in the JVM and define a compilation scheme of Java to JVM code which allows us to prove that, in corresponding runs, Java and the JVM throw the same exceptions and with equivalent effect. Thus, the compilation scheme can, with reasonable confidence, be used as a standard reference for Java exception handling compilation  相似文献   
19.
Clip art is a simplified illustration form consisting of layered filled polygons or closed curves used to convey 3D shape information in a 2D vector graphics format. This paper focuses on the problem of direct conversion of smooth surfaces, ranging from the free-form shapes of art and design to the mathematical structures of geometry and topology, into a clip art form suitable for illustration use in books, papers and presentations.We show how to represent silhouette, shadow, gleam and other surface feature curves as the intersection of implicit surfaces, and derive equations for their efficient interrogation via particle chains. We further describe how to sort, orient, identify and fill the closed regions that overlay to form clip art. We demonstrate the results with numerous renderings used to illustrate the paper itself.  相似文献   
20.
OBJECTIVE: We experimentally tested the degree that the size-weight illusion depends on perceptual conditions allowing the observer to assume that both the visual and the kinesthetic stimuli of a weight seen and lifted emanate from the same object. We expected that the degree of the illusion depended on the "realism" provided by different kinds of virtual reality (VR) used when the weights are seen in virtual reality and at the same time lifted in natural reality. BACKGROUND: Welch and Warren (1980) reported that an intermodal influence can be expected only if perceptual information of different modalities is compellingly related to only one object. METHOD: Objects of different sizes and weights were presented to 50 participants in natural reality or in four virtual realities: two immersive head-mounted display VRs (with or without head tracking) and two nonimmersive desktop VRs (with or without screening from input of the natural environment using a visor). The objects' heaviness was scaled using the magnitude estimation method. RESULTS: Data show that the degree of the illusion is largest in immersive and lowest in nonimmersive virtual realities. CONCLUSION: The higher the degree of the illusion is, the more compelling the situation is perceived and the more the observed data are in correspondence with the data predicted for the illusion in natural reality. This shows that the kind of mediating technology used strongly influences the presence experienced. APPLICATION: The size-weight illusion's sensitivity to conditions that affect the sense of presence makes it a promising objective presence measure.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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