首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   877篇
  免费   32篇
  国内免费   2篇
电工技术   5篇
化学工业   239篇
金属工艺   16篇
机械仪表   26篇
建筑科学   27篇
能源动力   8篇
轻工业   46篇
水利工程   1篇
无线电   78篇
一般工业技术   146篇
冶金工业   154篇
原子能技术   8篇
自动化技术   157篇
  2024年   2篇
  2022年   9篇
  2021年   15篇
  2020年   6篇
  2019年   7篇
  2018年   12篇
  2017年   10篇
  2016年   18篇
  2015年   17篇
  2014年   28篇
  2013年   47篇
  2012年   38篇
  2011年   48篇
  2010年   41篇
  2009年   28篇
  2008年   46篇
  2007年   24篇
  2006年   35篇
  2005年   26篇
  2004年   21篇
  2003年   22篇
  2002年   31篇
  2001年   18篇
  2000年   14篇
  1999年   23篇
  1998年   66篇
  1997年   35篇
  1996年   31篇
  1995年   20篇
  1994年   25篇
  1993年   20篇
  1992年   12篇
  1991年   5篇
  1990年   8篇
  1989年   6篇
  1988年   8篇
  1987年   4篇
  1986年   15篇
  1985年   8篇
  1984年   6篇
  1983年   4篇
  1982年   4篇
  1981年   7篇
  1980年   8篇
  1979年   4篇
  1978年   4篇
  1977年   4篇
  1976年   5篇
  1974年   4篇
  1973年   7篇
排序方式: 共有911条查询结果,搜索用时 15 毫秒
61.
Minetti C  Dubois F  Legros JC 《Applied optics》2002,41(17):3453-3460
Linear-correlation amplitude changes when the intensity level of the input image is modified. As recognition is often based on the correlation-peak level, a change of the input illumination may result in a false recognition. We propose an illumination-change compensation by a post processing of the correlation distribution that is based on statistical measures of the correlation histograms. The theoretical background and simulation results are provided in the frame of an actual application in biology.  相似文献   
62.
To support a global virtual memory space, an architecture must translate virtual addresses dynamically. In current processors, the translation is done in a TLB (translation lookaside buffer), before or in parallel with the first-level cache access. As processor technology improves at a rapid pace and the working sets of new applications grow insatiably, the latency and bandwidth demands on the TLB are difficult to meet, especially in multiprocessor systems, which run larger applications and are plagued by the TLB consistency problem. We describe and compare five options for virtual address translation in the context of distributed shared memory (DSM) multiprocessors, including CC-NUMAs (cache-coherent non-uniform memory access architectures) and COMAs (cache only memory access architectures). In CC-NUMAs, moving the TLB to shared memory is a bad idea because page placement, migration, and replication are all constrained by the virtual page address, which greatly affects processor node access locality. In the context of COMAs, the allocation of pages to processor nodes is not as critical because memory blocks can dynamically migrate and replicate freely among nodes. As the address translation is done deeper in the memory hierarchy, the frequency of translations drops because of the filtering effect. We also observe that the TLB is very effective when it is merged with the shared-memory, because of the sharing and prefetching effects and because there is no need to maintain TLB consistency. Even if the effectiveness of the TLB merged with the shared memory is very high, we also show that the TLB can be removed in a system with address translation done in memory because the frequency of translations is very low.  相似文献   
63.
In project management, three quantities are often used by project managers: the earliest starting date, the latest starting date and the float of tasks. These quantities are computed by the Program Evaluation and Review Techniques/Critical Path Method (PERT/CPM) algorithm. When task durations are ill known, as is often the case at the beginning of a project, they can be modeled by means of intervals, representing the possible values of these task durations. With such a representation, the earliest starting dates, the latest starting dates and the floats are also intervals. The purpose of this paper is to give efficient algorithms for their computation. After recalling the classical PERT/CPM problem, we present several properties of the concerned quantities in the interval-valued case, showing that the standard criticality analysis collapses. We propose an efficient algorithm based on path enumeration to compute optimal intervals for latest starting times and floats in the general case, and a simpler polynomial algorithm in the case of series-parallel activity networks.  相似文献   
64.
The present paper is concerned with a special group of approximants with B2 superstructures. In the first part, recent work on structural features of the B2 superstructure approximants is summarized. Experimental results obtained in Al-Cu-Mn and Al-Cu systems are presented, where a series of B2-based approximants are observed. These phases all have similar valence electron concentrations, in full support of thee/a-constant definition of approximants. Special emphasis is laid on the chemical twinning modes of the B2 basic structure in relation to the Al-Cu approximants. It is revealed that the B2 twinning mode responsible for the formation of local pentagonal atomic arrangements is of 180°/[111] type. This is also the origin of 5-fold twinning of the B2 phase on quasicrystal surfaces. Crystallographic features of phases B2, τ2, τ3,γ, and other newly discovered phases are also discussed. In all these phases, local pentagonal configurations are revealed. In the second part, dry tribological properties of some AlCuFe samples containing the B2-type phases are presented. The results indicated that the B2 phase having their valence ratio near that of the quasicrystal possesses low friction coefficient under various loads, comparable with the annealed quasicrystalline ingot. Such a result indicates that the B2-type phase withe/a near that of quasicrystal is indeed an approximant, which is in full support of the valence electron criterion for approximants.  相似文献   
65.
Wu, Apostolakis and Okrent1 have recently analyzed the current status of emerging alternatives to classical probabilistic methods in the modeling and pooling of expert opinions in safety analysis of engineering systems. They have pointed out some difficulties faced by these theories, due to their relative lack of maturity. This paper pursues the investigation so as to clarify some aspects of belief functions and possibility theories, and also to point out the need for further research. A comparison between the mathematical models of expert opinion pooling offered by Bayesian probabilities, belief functions and possibility theory is carried out. It is proved that the Bayesian approach that these authors advocate suffers from the same numerical stability problems as possibilistic and evidential rules of combination in the presence of strongly conflicting information due to their strong structural similarities. The problem of dependence between experts is briefly addressed. The other main point of this paper is that a single combination rule cannot reasonably address all situations where expert opinions must be pooled. It is suggested that the framework of possibility and evidence theories offers a more flexible framework for representing and combining subjective uncertain judgments than the one of subjective probability alone although some progress is required to reach the maturity of the Bayesian theory.  相似文献   
66.
Summary In this paper we report thermal studies and microscopic observations on optically active liquid crystalline monomers having the following general formula: with X = H (acrylates), CH3 (methacrylates) and Cl (chloroacrylates) and n=2, 6, 11 (flexible spacer groups) and a few corresponding side-chain polymers.  相似文献   
67.
68.
69.
There has been a long-lasting misunderstanding in the literature of artificial intelligence and uncertainty modeling, regarding the role of fuzzy set theory and many-valued logics. The recurring question is that of the mathematical and pragmatic meaningfulness of a compositional calculus and the validity of the excluded middle law. This confusion pervades the early developments of probabilistic logic, despite early warnings of some philosophers of probability. This paper tries to clarify this situation. It emphasizes three main points. First, it suggests that the root of the controversies lies in the unfortunate confusion between degrees of belief and what logicians call degrees of truth. The latter are usually compositional, while the former cannot be so. This claim is first illustrated by laying bare the non-compositional belief representation embedded in the standard propositional calculus. It turns out to be an all-or-nothing version of possibility theory. This framework is then extended to discuss the case of fuzzy logic versus graded possibility theory. Next, it is demonstrated that any belief representation where compositionality is taken for granted is bound to at worst collapse to a Boolean truth assignment and at best to a poorly expressive tool. Lastly, some claims pertaining to an alleged compositionality of possibility theory are refuted, thus clarifying a pervasive confusion between possibility theory axioms and fuzzy set basic connectives.  相似文献   
70.
This paper addresses the joint estimation and detection of time-varying harmonic components in audio signals. We follow a flexible viewpoint, where several frequency/amplitude trajectories are tracked in spectrogram using particle filtering. The core idea is that each harmonic component (composed of a fundamental partial together with several overtone partials) is considered a target. Tracking requires to define a state-space model with state transition and measurement equations. Particle filtering algorithms rely on a so-called sequential importance distribution, and we show that it can be built on previous multipitch estimation algorithms, so as to yield an even more efficient estimation procedure with established convergence properties. Moreover, as our model captures all the harmonic model information, it actually separates the harmonic sources. Simulations on synthetic and real music data show the interest of our approach  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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