首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   352篇
  免费   9篇
数理化   361篇
  2022年   3篇
  2021年   4篇
  2020年   12篇
  2019年   5篇
  2018年   3篇
  2017年   3篇
  2016年   11篇
  2015年   9篇
  2014年   5篇
  2013年   10篇
  2012年   12篇
  2011年   17篇
  2010年   8篇
  2009年   10篇
  2008年   12篇
  2007年   14篇
  2006年   14篇
  2005年   13篇
  2004年   12篇
  2003年   11篇
  2002年   10篇
  2001年   5篇
  2000年   4篇
  1999年   6篇
  1997年   4篇
  1996年   7篇
  1995年   3篇
  1994年   6篇
  1993年   8篇
  1992年   4篇
  1991年   3篇
  1988年   4篇
  1986年   8篇
  1985年   6篇
  1984年   9篇
  1983年   4篇
  1982年   3篇
  1980年   3篇
  1979年   4篇
  1978年   5篇
  1977年   6篇
  1976年   6篇
  1975年   6篇
  1974年   6篇
  1972年   5篇
  1900年   2篇
  1897年   2篇
  1894年   2篇
  1893年   2篇
  1888年   2篇
排序方式: 共有361条查询结果,搜索用时 15 毫秒
31.
32.
33.
We consider the problem of monotonicity testing over graph products. Monotonicity testing is one of the central problems studied in the field of property testing. We present a testing approach that enables us to use known monotonicity testers for given graphs G1, G2, to test monotonicity over their product G1 × G2. Such an approach of reducing monotonicity testing over a graph product to monotonicity testing over the original graphs, has been previously used in the special case of monotonicity testing over [n]d for a limited type of testers; in this article, we show that this approach can be applied to allow modular design of testers in many interesting cases: this approach works whenever the functions are boolean, and also in certain cases for functions with a general range. We demonstrate the usefulness of our results by showing how a careful use of this approach improves the query complexity of known testers. Specifically, based on our results, we provide a new analysis for the known tester for [n]d which significantly improves its query complexity analysis in the low‐dimensional case. For example, when d = O(1), we reduce the best known query complexity from O(log 2n/ε) to O(log n/ε). © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008  相似文献   
34.
35.
36.
37.
An iterative domain decomposition method is developed to solve a singular perturbation problem. The problem consists of a convection-diffusion equation with a discontinuous (piecewise-constant) diffusion coefficient, and the problem domain is decomposed into two subdomains, on each of which the coefficient is constant. After showing that the boundary value problem is well posed, we indicate a specific numerical implementation of the iterative technique that combines the finite element method on one subdomain with the method of matched asymptotic expansions on the other subdomain. This procedure extends work by Carlenzoli and Quarteroni, which was originally intended for a boundary layer problem with an outer region and an inner region. Our extension carries over to a problem where the domain consists of the outer and inner boundary layer regions plus a region in which the diffusion coefficient is constant and significant in magnitude. An unexpected benefit of our new implementation is its efficiency, which is due to the fact that at each iteration the problem needs to be solved explicitly only on one subdomain. It is only when the final approximation on the entire domain is desired that the matched asymptotic expansions approximation need be computed on the second subdomain. Two-dimensional convergence results and numerical results illustrating the method for a two-dimensional test problem are given.Received: February 12, 2004  相似文献   
38.
LP models are usually constructed using index sets and data tables which are closely related to the attributes and relations of relational database (RDB) systems. We extend the syntax of MPL, an existing LP modelling language, in order to connect it to a given RDB system. This approach reuses existing modelling and database software, provides a rich modelling environment and achieves model and data independence. This integrated software enables Mathematical Programming to be widely used as a decision support tool by unlocking the data residing in corporate databases.  相似文献   
39.
40.
Twenty-three phage-displayed peptides that specifically bind to an anti-benzothiostrobin monoclonal antibody (mAb) in the absence or presence of benzothiostrobin were isolated from a cyclic 8-residue peptide phage library. Competitive and noncompetitive phage enzyme linked immunosorbent assays (ELISAs) for benzothiostrobin were developed by using a clone C3-3 specific to the benzothiostrobin-free mAb and a clone N6-18 specific to the benzothiostrobin immunocomplex, respectively. Under the optimal conditions, the half maximal inhibition concentration (IC50) of the competitive phage ELISA and the concentration of analyte producing 50% saturation of the signal (SC50) of the noncompetitive phage ELISA for benzothiostrobin were 0.94 and 2.27 ng mL−1, respectively. The noncompetitive phage ELISA showed higher selectivity compared to the competitive. Recoveries of the competitive and the noncompetitive phage ELISAs for benzothiostrobin in cucumber, tomato, pear and rice samples were 67.6–119.6% and 70.4–125.0%, respectively. The amounts of benzothiostrobin in the containing incurred residues samples detected by the two types of phage ELISAs were significantly correlated with that detected by high-performance liquid chromatography (HPLC).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号