首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1988篇
  免费   54篇
  国内免费   2篇
电工技术   17篇
综合类   1篇
化学工业   368篇
金属工艺   24篇
机械仪表   18篇
建筑科学   16篇
能源动力   70篇
轻工业   74篇
水利工程   6篇
无线电   60篇
一般工业技术   186篇
冶金工业   1096篇
原子能技术   15篇
自动化技术   93篇
  2023年   14篇
  2022年   31篇
  2021年   43篇
  2020年   30篇
  2019年   37篇
  2018年   41篇
  2017年   45篇
  2016年   56篇
  2015年   23篇
  2014年   34篇
  2013年   64篇
  2012年   53篇
  2011年   61篇
  2010年   39篇
  2009年   32篇
  2008年   25篇
  2007年   25篇
  2006年   27篇
  2005年   19篇
  2004年   13篇
  2003年   17篇
  2002年   12篇
  2001年   12篇
  2000年   10篇
  1999年   42篇
  1998年   284篇
  1997年   175篇
  1996年   134篇
  1995年   74篇
  1994年   66篇
  1993年   73篇
  1992年   17篇
  1991年   26篇
  1990年   21篇
  1989年   21篇
  1988年   33篇
  1987年   31篇
  1986年   25篇
  1985年   28篇
  1984年   11篇
  1983年   10篇
  1982年   27篇
  1981年   29篇
  1980年   25篇
  1979年   8篇
  1978年   8篇
  1977年   30篇
  1976年   69篇
  1973年   4篇
  1972年   4篇
排序方式: 共有2044条查询结果,搜索用时 15 毫秒
71.
Designing text-to-speech systems capable of producing natural sounding speech segments in different Indian languages is a challenging and ongoing problem. Due to the large number of possible pronunciations in different Indian languages, a number of speech segments are needed to be stored in the speech database while a concatenative speech synthesis technique is used to achieve highly natural speech segments. However, the large speech database size makes it unusable for small hand held devices or human computer interactive systems with limited storage resources. In this paper, we proposed a fraction-based waveform concatenation technique to produce intelligible speech segments from a small footprint speech database. The results of all the experiments performed shows the effectiveness of the proposed technique in producing intelligible speech segments in different Indian languages even with very less storage and computation overhead compared to the existing syllable-based technique.  相似文献   
72.
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in . The algorithm uses and highlights the power of the quantization method of Szegedy. For the lower bound of , we give a reduction from a special case of Element Distinctness to our problem. Along the way, we prove the optimality of the algorithm of Pak for the randomized model.  相似文献   
73.
A novel serological test, IPAzyme Chlamydia (Savyon Diagnostics Ltd., Beer Sheva, Israel), was compared with an enzyme immunoassay (EIA) for the ability to detect serum immunoglobulin G and A antibodies in the diagnosis of acute chlamydial pelvic inflammatory disease. In comparison with cell culture, which is the "gold standard," IPAzyme Chlamydia and EIA exhibited sensitivities of 63 and 68% and specificities of 76 and 87%, respectively. Thus, IPAzyme Chlamydia offers no advantages over the EIA, and neither serological test can be recommended for the diagnosis of acute Chlamydia trachomatis infection. So far, conventional cell culture remains the most reliable diagnostic test for chlamydial pelvic inflammatory disease.  相似文献   
74.
In addition to a submuscular and subepithelial nerve plexus an infra-epithelial nerve-net also occurs in Notoplana acticola. It contains naked nerve cells which lie between the bases of epithelial cells. Individual neurites occur separately or in small tracts. Synapses contain clear spherical vesicles and are polarized. Post-synaptic neurites tend to be flat and ribbon-like. Rhabdite and mucus secreting cells in the epithelium have synapses associated with them. Neurites ending on the rhabdites appear to originate in the subepithelial plexus. The "sensory-free nerve endings" of earlier workers are reinterpreted as being motor terminals on epithelial secretory cells.  相似文献   
75.
The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of—or equivalently, to find—a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the detection and finding problems have the same time complexity. In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two types of hitting time are of the same order in both the classical and the quantum case. Then, we present new quantum algorithms for the detection and finding problems. The complexities of both algorithms are related to the new, potentially smaller, quantum hitting times. The detection algorithm is based on phase estimation and is particularly simple. The finding algorithm combines a similar phase estimation based procedure with ideas of Tulsi from his recent theorem (Tulsi A.: Phys. Rev. A 78:012310 2008) for the 2D grid. Extending his result, we show that we can find a unique marked element with constant probability and with the same complexity as detection for a large class of quantum walks—the quantum analogue of state-transitive reversible ergodic Markov chains. Further, we prove that for any reversible ergodic Markov chain P, the quantum hitting time of the quantum analogue of P has the same order as the square root of the classical hitting time of P. We also investigate the (im)possibility of achieving a gap greater than quadratic using an alternative quantum walk. In doing so, we define a notion of reversibility for a broad class of quantum walks and show how to derive from any such quantum walk a classical analogue. For the special case of quantum walks built on reflections, we show that the hitting time of the classical analogue is exactly the square of the quantum walk.  相似文献   
76.
Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using both the Shannon entropy measure as well as the Hartley entropy measure, with an aim to avoid excessive loss of beliefs that full meet contraction entails.  相似文献   
77.
78.
The free vibration of the laminated composite anticlastic doubly curved stiffened shells is investigated using the finite element method. The stiffened shell element is obtained by appropriate combination of the nine-node doubly curved isoparametric thin shallow shell element with the three-node curved isoparametric beam element. The shell forms include the hyperbolic paraboloid, hypar, and conoidal shells. The accuracy of the formulation is validated by comparing the authors’ results of specific problems with those available in the literature. The additional problems are taken up for parametric studies to include the effects of fiber orientation and lamina stacking sequence of shells and stiffeners. Moreover, the effects of number, types, and orientations of stiffeners, and stiffener depth to shell thickness ratio on the fundamental frequency are also included in the present study. Further, mode shapes corresponding to the fundamental frequency for typical cases are obtained to verify the parametric trend of the results of the fundamental frequency.  相似文献   
79.
An Autonomous Spacecraft Agent Prototype   总被引:12,自引:0,他引:12  
This paper describes the New Millennium Remote Agent (NMRA) architecture for autonomous spacecraft control systems. The architecture supports challenging requirements of the autonomous spacecraft domain not usually addressed in mobile robot architectures, including highly reliable autonomous operations over extended time periods in the presence of tight resource constraints, hard deadlines, limited observability, and concurrent activity. A hybrid architecture, NMRA integrates traditional real-time monitoring and control with heterogeneous components for constraint-based planning and scheduling, robust multi-threaded execution, and model-based diagnosis and reconfiguration. Novel features of this integrated architecture include support for robust closed-loop generation and execution of concurrent temporal plans and a hybrid procedural/deductive executive.We implemented a prototype autonomous spacecraft agent within the architecture and successfully demonstrated the prototype in the context of a challenging autonomous mission scenario on a simulated spacecraft. As a result of this success, the integrated architecture has been selected to fly as an autonomy experiment on Deep Space One (DS-1), the first flight of NASA';s New Millennium Program (NMP), which will launch in 1998. It will be the first AI system to autonomously control an actual spacecraft.  相似文献   
80.
Contact potential difference (CPD) measurements of the relative work functions of a range of organic semiconductor thin films show that oxygen causes effective p-type doping (with work functions increasing 0.1–0.3 eV). This doping effect is found to be reversible by exposure to high vacuum or heating in inert atmosphere. The mechanism of doping is explained by a model, based on a reversible formation of an O-substrate charge transfer state. Conductivity measurements of p-phthalocyanine films at variable temperatures support this doping model. The oxygen doping effect is consistent with filling of tail states in the gap, as shown by the increase of activation energy of hole transport with decreased O-doping, and by the good fit between experimental data and simulations of the in-gap density of states. A model hybrid solar cell configuration also shows the effect of doping by O2 and corroborates the fact that O-doping fills the tail states in the system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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