首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1028篇
  免费   78篇
  国内免费   38篇
化学   175篇
晶体学   1篇
力学   43篇
综合类   18篇
数学   652篇
物理学   92篇
无线电   163篇
  2023年   8篇
  2022年   16篇
  2021年   18篇
  2020年   21篇
  2019年   30篇
  2018年   27篇
  2017年   34篇
  2016年   35篇
  2015年   26篇
  2014年   45篇
  2013年   79篇
  2012年   53篇
  2011年   43篇
  2010年   39篇
  2009年   54篇
  2008年   57篇
  2007年   48篇
  2006年   54篇
  2005年   41篇
  2004年   31篇
  2003年   31篇
  2002年   23篇
  2001年   29篇
  2000年   28篇
  1999年   29篇
  1998年   25篇
  1997年   22篇
  1996年   16篇
  1995年   9篇
  1994年   18篇
  1993年   14篇
  1992年   15篇
  1991年   14篇
  1990年   13篇
  1989年   7篇
  1988年   15篇
  1987年   6篇
  1986年   4篇
  1985年   3篇
  1984年   7篇
  1983年   2篇
  1982年   9篇
  1981年   5篇
  1980年   5篇
  1979年   4篇
  1978年   5篇
  1977年   14篇
  1976年   6篇
  1974年   4篇
  1971年   1篇
排序方式: 共有1144条查询结果,搜索用时 484 毫秒
1.
This minireview describes the strategies for synthesis of fiuorinated surfactants potentially nonbioaccumulable.Various strategies have been focused on(Ⅰ) reducing the length of the perfluorocarbon chain,(Ⅱ) introducing hetero atoms into the fluorocarbon chain,(Ⅲ) introducing branch(herein and after branch means the fluoro-carbon chain section is not straight).In most cases,the surface tensions versus the surfactant concentrations have been assessed.These above strategies led to various highly fiuorinated(perfluorinated or not perfluorinated) surfactants whose chemical changes enabled to obtain novel alternatives to perfluorooctanoic acid(PFOA) and perfluorooctane sulphonate(PFOS).  相似文献   
2.
This review provides a comprehensive evaluation of solidified floating organic drop microextraction (SFODME) procedures for metal ions preconcentration and their contributions to green chemistry. In this article we focused on the modifications that have been performed in the recent years to improve this environmentally friendly procedure. Among the most important of these modifications are the inclusion of ultrasonic energy, vortex and air agitation to enhance the dispersion process. The article also discussed new challenges in the procedure by using more ecofriendly solvents as extractants such as ionic liquids, deep eutectic. and supramolecular solvents. The coupling of SFODME with solid phase extraction increases selectivity and efficiency of the preconcentration procedure.  相似文献   
3.
We analyse a model for equilibrium configurations of composite systems of nematic liquid crystal with polymer inclusions, in the presence of an external magnetic field. We assume that the system has a periodic structure, and consider the relaxed problem on the unit length constraint of the nematic director field. The relaxation of the Oseen–Frank energy functional is carried out by including bulk as well as surface energy penalty terms, rendering the problem fully non‐linear. We employ two‐scale convergence methods to obtain effective configurations of the system, as the size of the polymeric inclusions tends to zero. We discuss the minimizers of the effective energies for, both, the constrained as well as the unconstrained models. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
4.
孟钢  章梅荣 《应用数学》2006,19(3):613-620
本文研究作用在C2周期函数空间上的微分算子u→u″ g(u) ,其中g(u)为连续有界函数.我们将证明上述微分算子的值域限制在周期函数空间的“超曲面”中.  相似文献   
5.
New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately.  相似文献   
6.
Empirical minimization   总被引:3,自引:0,他引:3  
We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.  相似文献   
7.
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement.  相似文献   
8.
Energy minimization and design for testability   总被引:6,自引:0,他引:6  
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.  相似文献   
9.
An overview is presented of the analytical approaches developed by our research group over the last ten years for analysis of alternative fuel, both biomass and fossil. The alternative fuels are analyzed successively by PLC-8 (preparative liquid chromatography–group-type) fractionation and high resolution gas chromatography. Some of the possibilities for fractionation and characterization of alternative fuels are herein exemplified with sugar cane bagasse pyrolysis products.  相似文献   
10.
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n 4 m) algorithm for this class of problems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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