首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   135篇
  免费   3篇
化学   60篇
力学   1篇
数学   18篇
物理学   59篇
  2021年   3篇
  2020年   2篇
  2019年   2篇
  2018年   3篇
  2017年   2篇
  2016年   2篇
  2015年   2篇
  2014年   2篇
  2013年   3篇
  2012年   6篇
  2011年   5篇
  2009年   3篇
  2008年   2篇
  2007年   1篇
  2006年   3篇
  2005年   2篇
  2004年   3篇
  2003年   1篇
  2002年   8篇
  2001年   3篇
  2000年   4篇
  1999年   7篇
  1998年   2篇
  1997年   1篇
  1996年   1篇
  1995年   4篇
  1994年   6篇
  1993年   7篇
  1992年   3篇
  1991年   1篇
  1990年   2篇
  1989年   2篇
  1988年   3篇
  1987年   2篇
  1986年   1篇
  1985年   8篇
  1984年   4篇
  1983年   1篇
  1981年   2篇
  1980年   4篇
  1978年   1篇
  1975年   1篇
  1971年   1篇
  1969年   3篇
  1968年   2篇
  1942年   1篇
  1940年   2篇
  1935年   1篇
  1934年   1篇
  1931年   1篇
排序方式: 共有138条查询结果,搜索用时 31 毫秒
81.
A spline-based approximation scheme is discussed for optimal control problems governed by nonlinear nonautonomous delay differential equations. The approximating framework reduces the original control problem to a sequence of optimization problems governed by ordinary differential equations. Convergence proofs, which appeal directly to dissipative-type estimates for the underlying nonlinear operator, are given and numerical findings are summarized.This work was supported in part by the Air Force Office of Scientific Research under Contract No. AFOSR-76-3092D, in part by the National Science Foundation under Grants Nos. NSF-MCS-79-05774-05 and NSF-MCS-82-00883, and in part by the US Army Research Office under Contract No. ARO-DAAG29-79-C-0161. The results reported here are a portion of the author's doctoral dissertation written under the supervision of Professor H. T. Banks, Brown University. The author is indebted to Professor Banks for his many valuable comments and suggestions during the course of this work.Part of this research was completed while the author was a visitor at the Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, Virginia.  相似文献   
82.
The maximum independent set problem is NP-hard and particularly difficult to solve in sparse graphs, which typically take exponential time to solve exactly using the best-known exact algorithms. In this paper, we present two new novel heuristic algorithms for computing large independent sets on huge sparse graphs, which are intractable in practice. First, we develop an advanced evolutionary algorithm that uses fast graph partitioning with local search algorithms to implement efficient combine operations that exchange whole blocks of given independent sets. Though the evolutionary algorithm itself is highly competitive with existing heuristic algorithms on large social networks, we further show that it can be effectively used as an oracle to guess vertices that are likely to be in large independent sets. We then show how to combine these guesses with kernelization techniques in a branch-and-reduce-like algorithm to compute high-quality independent sets quickly in huge complex networks. Our experiments against a recent (and fast) exact algorithm for large sparse graphs show that our technique always computes an optimal solution when the exact solution is known, and it further computes consistent results on even larger instances where the solution is unknown. Ultimately, we show that identifying and removing vertices likely to be in large independent sets opens up the reduction space—which not only speeds up the computation of large independent sets drastically, but also enables us to compute high-quality independent sets on much larger instances than previously reported in the literature.  相似文献   
83.
84.
We consider the Dirichlet problem for biharmonic maps u from a bounded, smooth domain ${\Omega\subset\mathbb R^n (n\ge 5)}$ to a compact, smooth Riemannian manifold ${N\subset{\mathbb {R}}^l}$ without boundary. For any smooth boundary data, we show that if u is a stationary biharmonic map that satisfies a certain boundary monotonicity inequality, then there exists a closed subset ${\Sigma\subset\overline{\Omega}}$ , with ${H^{n-4}(\Sigma)=0}$ , such that ${\displaystyle u\in C^\infty(\overline\Omega\setminus\Sigma, N)}$ .  相似文献   
85.
86.
87.
Three methods for determining a 'safe' estimate for high-mass limits of MALDI spectra of coal derived liquids were explored, using a sample of coal-tar pitch and its pyridine-insoluble fraction. Co-addition of increasing numbers of single-shot spectra (10, 30, 50 and 100 pulses) showed visually observable reductions in noise levels, consistent with robust and statistically meaningful signals. Three separate types of post-acquisition calculation were used to identify high-mass limits of the spectra. (i) A literature method indicated high-mass limits similar to those observed visually-as a shift from baseline at the highest masses, nearly 350 000 u for the coal tar pitch and about 390 000 u for its pyridine insoluble fraction. (ii) Comparing instrument signal with pre-selected multiples of the standard deviation, upper mass estimates of between 40-60 000 u for the coal-tar pitch and about 95 000 u for its pyridine-insoluble fraction were found. (iii) Calculation of the slope was used to identify 'lift-off' of the spectrum from baseline. The angle between the smoothed spectrum and the baseline was matched to a pre-selected value (e.g. 0.5 degrees and 1 degrees ). However, the arbitrary specification of the key parameter did not establish this last method on a firm basis. The choice of a criterion for estimating high-mass limits of MALDI spectra remains a semi-quantitative procedure; a reasonably conservative high-mass limit may be estimated by comparison of signal with five times the standard deviation. However, evaluation of size exclusion chromatograms of the present samples using polystyrene standards suggests that molecular mass distributions of pitch samples arrived at by MALDI mass spectrometry are, at least partly, determined by the limitations of available instruments. Copyright 1999 John Wiley & Sons, Ltd.  相似文献   
88.
89.
Zusammenfassung In dem beschriebenen Absorptionsapparat ist es m?glich, die bei den gew?hnlichen Absorptionsverfahren erreichbare Kapazit?t gewaltig zu steigern, ohne die Menge der absorbierenden Flüssigkeit zu erh?hen. Die Flüssigkeit wird im Gase nach dem Spritzverfahren verteilt und zirkuliert etwa einmal in der Sekunde. Arbeitsweise und Anwendungen werden diskutiert. Es k?nnen sehr hohe Empfindlichkeiten beim Nachweis von Fremdstoffen erhalten werden. Das Verfahren hat noch den Vorteil, eine betr?chtliche Absorption von Nebeln zustande zu bringen.  相似文献   
90.
Ohne Zusammenfassung
On the question of the quadrivalence of sulphur in sulphur diimides
  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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