首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2106篇
  免费   113篇
  国内免费   5篇
电工技术   23篇
综合类   4篇
化学工业   541篇
金属工艺   45篇
机械仪表   50篇
建筑科学   42篇
矿业工程   7篇
能源动力   58篇
轻工业   120篇
水利工程   11篇
石油天然气   25篇
武器工业   1篇
无线电   188篇
一般工业技术   643篇
冶金工业   69篇
原子能技术   37篇
自动化技术   360篇
  2024年   7篇
  2023年   22篇
  2022年   78篇
  2021年   104篇
  2020年   72篇
  2019年   66篇
  2018年   78篇
  2017年   70篇
  2016年   76篇
  2015年   49篇
  2014年   110篇
  2013年   150篇
  2012年   151篇
  2011年   201篇
  2010年   90篇
  2009年   103篇
  2008年   98篇
  2007年   116篇
  2006年   87篇
  2005年   71篇
  2004年   76篇
  2003年   51篇
  2002年   69篇
  2001年   25篇
  2000年   21篇
  1999年   24篇
  1998年   31篇
  1997年   23篇
  1996年   8篇
  1995年   13篇
  1994年   13篇
  1993年   11篇
  1992年   9篇
  1991年   6篇
  1990年   5篇
  1989年   3篇
  1988年   3篇
  1987年   4篇
  1985年   3篇
  1984年   4篇
  1983年   2篇
  1979年   2篇
  1976年   3篇
  1973年   2篇
  1968年   1篇
  1966年   2篇
  1965年   3篇
  1964年   1篇
  1959年   1篇
  1958年   2篇
排序方式: 共有2224条查询结果,搜索用时 15 毫秒
991.
Circulant graphs are regular graphs based on Cayley graphs defined on the Abelian group \(\mathbb{Z}_{n}\) . They are popular network topologies that arise in distributed computing. Using number theoretical tools, we first prove two main results for random directed k-regular circulant graphs with n vertices, when n is sufficiently large and k is fixed. First, for any fixed ε>0, n=p prime and Lp 1/k (logp)1+1/k+ε , walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm that for almost all undirected 2r-regular circulant graphs finds a vertex bisector and an edge bisector, both of size less than n 1?1/r+o(1). We then prove that the latter result also holds for all (rather than for almost all) 2r-regular circulant graphs with n=p, prime, vertices, while, in general, it does not hold for composite n. Using the bisection results, we provide lower bounds on the number of rounds required by any gossiping algorithms for any n. We introduce generic distributed algorithms to solve the gossip problem in any circulant graphs. We illustrate the efficiency of these algorithms by giving nearly matching upper bounds of the number of rounds required by these algorithms in the vertex-disjoint and the edge-disjoint paths communication models in particular circulant graphs.  相似文献   
992.
Mullite–nickel nanocomposite fibers with Ni nanoparticles of controllable size, dispersion, and consequent magnetic properties were fabricated using sol–gel/electrospinning method, followed by thermal reduction. The fibers were electrospun from an aqueous solution containing sol–gel mullite precursor and nickel nitrate. These fibers were then heat treated in the reducing atmosphere between 550°C and 750°C to achieve fine‐dis persed metallic Ni nanoparticles (NPs). After the Ni2+ was reduced to Ni NPs at 750°C for 10 h, the fibers were then directly transformed to the mullite fibers at 1000°C without the undesirable intermediate spinel phase. In many high‐temperature applications, mullite is the desired phase than spinel. If not fully reduced, the Ni2+ cations induce early precipitation of spinel phase before mullite can be formed. This spinel phase was a solid solution between Al2NiO4 and Al‐Si spinels, which later reacted with the residual silica and formed a mixture of mullite and spinel at 1400°C. The formation of spinel phase was suppressed or fully eliminated with chemically reducing Ni2+ to metal NPs. The average size of nickel NPs within the fibers was ~20 nm, insensitive of the Ni concentration and reducing temperature. However, the Ni NPs on the fiber surface grew as large as ~80 nm due to fast surface diffusion. The magnetic nanocomposites exhibited ferromagnetism with saturation magnetization (Ms) close to pure nickel of the same nominal weight, but coercivity (Hc) much smaller than the bulk nickel, indicating the nature of bimodal magnetic nanoparticle distributions. The majority of small Ni NPs (~20 nm) within the fibers exhibited superparamagnetism, while the minor portion of relatively large NPs (50–80 nm) showed ferromagnetism.  相似文献   
993.
We present the operation and design of newly developed, fully automatic equipment for the visualization of microwave electric fields. This equipment enables the observation of microwave field patterns around different objects including metamaterial prototypes and to study the field patterns of various microwave antennas and other objects that have been developed and that interact with a surrounding microwave electromagnetic field. Moreover, the developed prototypes whose interaction with an incident electromagnetic wave is crucial for practical applications can be investigated using size scaling, and hence our equipment can be used for the testing of antennas and other devices that interact with electromagnetic radiation, not only at microwave frequencies, but also at radio frequencies. The performance of our innovative equipment was demonstrated through the investigation of the metamaterial cloak. The frequency behavior of the metamaterial cloak revealed frequency bands with maximum cloaking efficiencies.  相似文献   
994.
Machine learning models in metabolomics, despite their great prediction accuracy, are still not widely adopted owing to the lack of an efficient explanation for their predictions. In this study, we propose the use of the general explanation method to explain the predictions of a machine learning model to gain detailed insight into metabolic differences between biological systems. The method was tested on a dataset of 1H NMR spectra acquired on normal lung and mesothelial cell lines and their tumor counterparts. Initially, the random forests and artificial neural network models were applied to the dataset, and excellent prediction accuracy was achieved. The predictions of the models were explained with the general explanation method, which enabled identification of discriminating metabolic concentration differences between individual cell lines and enabled the construction of their specific metabolic concentration profiles. This intuitive and robust method holds great promise for in‐depth understanding of the mechanisms that underline phenotypes as well as for biomarker discovery in complex diseases.  相似文献   
995.
The advances and problems associated with the synthesis, properties and structure of metal complexes based on chelating polymer ligands are presented and assessed. The polymeric metal chelates (PMCs) are divided into molecular, intracomplex, macrocyclic and polynuclear types, which in turn are grouped according to the nature of the donor atoms (N,N-, N,О-, N,S-, О,О-, O,S-, S,S-, Р,Р-chelates, etc.). The main attention is focused on the similarities and differences between low and high molecular weight metal chelates, as well as the spatial organization of PMCs. The most important areas of research in the field of such compounds are highlighted. Thermal transformations of metal complexes based on chelating polymer ligands leading to the formation of nanostructured materials are considered. The bibliography includes the articles published after 2010.  相似文献   
996.
In this paper we propose a new approach to on-line Takagi-Sugeno fuzzy model identification. It combines a recursive fuzzy c-means algorithm and recursive least squares. First the method is derived and than it is tested and compared on a benchmark problem of the Mackey-Glass time series with other established on-line identification methods. We showed that the developed algorithm gives a comparable degree of accuracy to other algorithms. The proposed algorithm can be used in a number of fields, including adaptive nonlinear control, model predictive control, fault detection, diagnostics and robotics. An example of identification based on a real data of the waste-water treatment process is also presented.  相似文献   
997.
Investigation was made into the effect of plasma treatment on the release kinetics of the drug Temozolomide (TMZ) from thin, biodegradable polyester films, comprising polylactic acid (PLA) and polyester urethane. The authors utilized two systems to achieve this, the first being diffuse coplanar surface barrier discharge, applying air as the gaseous medium, while the other involved capacitively coupled radio frequency discharge plasma under an argon atmosphere with hexamethyldisiloxane. Results showed that both forms of plasma treatment positively reduced the undesirable burst effect and benefited the release rate of TMZ. The hydrolytic degradability of the materials was slightly enhanced following hydrophilization, whereas the same diminished after hydrophobization had taken place. This was especially true for PLA due to modification of its wettability.  相似文献   
998.
In this paper, diffuse coplanar surface barrier discharge plasma at atmospheric pressure has been used for surface modification of polyester/cotton (PESc) fabric, which was subsequently modified by sol–gel process using suitable organofunctional silanes to enhance its hydrophobicity. Modified PESc fabric surfaces were conditioned during the gelling process to obtain the permanent hydrophobicity. The contact angle of water before washing of plasma and sol–gel pretreated PESc fabric was found to be 154° and 151° after standardized washings. It was also demonstrated that the process is applicable at the industrial scale.  相似文献   
999.

Karp and Miller’s algorithm is based on an exploration of the reachability tree of a Petri net where, the sequences of transitions with positive incidence are accelerated. The tree nodes of Karp and Miller are labeled with ω-markings representing (potentially infinite) coverability sets. This set of ω-markings allows us to decide several properties of the Petri net, such as whether a marking is coverable or whether the reachability set is finite. The edges of the Karp and Miller tree are labeled by transitions but the associated semantic is unclear which yields to a complex proof of the algorithm correctness. In this work we introduce three concepts: abstraction, acceleration and exploration sequence. In particular, we generalize the definition of transitions to ω-transitions in order to represent accelerations by such transitions. The notion of abstraction makes it possible to greatly simplify the proof of the correctness. On the other hand, for an additional cost in memory, which we theoretically evaluated, we propose an “accelerated” variant of the Karp and Miller algorithm with an expected gain in execution time. Based on a similar idea we have accelerated (and made complete) the minimal coverability graph construction, implemented it in a tool and performed numerous promising benchmarks issued from realistic case studies and from a random generator of Petri nets.

  相似文献   
1000.
The estimation of polynomial-phase signals (PPSs) is a multiparameter problem, and the maximum likelihood (ML) optimization functions have numerous local optima, making the application of gradient techniques impossible. The common solution to this problem is based on the phase differentiation (PD) techniques that reduce the number of dimensions but, at the same time, reduce the accuracy and generate additional difficulties such as spurious components and error propagation. Here we show that genetic algorithms (GAs) can serve as a powerful alternative to the PD techniques. We investigate the limits of accuracy of the ML technique, and of some alternatives such as the high-order cubic phase function (HO-CPF) and high-order Wigner distribution (HO-WD). The ML approach combined with the proposed GA setup is limited up to the fifth-order PPS, which is not sufficient in many applications. However, the HO-CPF and HO-WD techniques coupled with the GA are able to accurately estimate phase parameters up to the tenth-order PPS. They significantly improve the accuracy with respect to the high-order ambiguity function (HAF) and product HAF (PHAF) and, for higher-order PPSs, they are much simpler and more efficient than the integrated generalized ambiguity function (IGAF).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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