全文获取类型
收费全文 | 287篇 |
免费 | 16篇 |
国内免费 | 18篇 |
专业分类
化学 | 75篇 |
力学 | 10篇 |
综合类 | 3篇 |
数学 | 130篇 |
物理学 | 103篇 |
出版年
2023年 | 7篇 |
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 12篇 |
2013年 | 32篇 |
2012年 | 8篇 |
2011年 | 15篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 19篇 |
2007年 | 14篇 |
2006年 | 16篇 |
2005年 | 14篇 |
2004年 | 10篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1999年 | 8篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有321条查询结果,搜索用时 15 毫秒
1.
Renny Mathew Karolina A. Uchman Lydia Gkoura Chris J. Pickard Maria Baias 《Magnetic resonance in chemistry : MRC》2020,58(11):1018-1025
A combined experimental and computational approach was used to distinguish between different polymorphs of the pharmaceutical drug aspirin. This method involves the use of ab initio random structure searching (AIRSS), a density functional theory (DFT)-based crystal structure prediction method for the high-accuracy prediction of polymorphic structures, with DFT calculations of nuclear magnetic resonance (NMR) parameters and solid-state NMR experiments at natural abundance. AIRSS was used to predict the crystal structures of form-I and form-II of aspirin. The root-mean-square deviation between experimental and calculated 1H chemical shifts was used to identify form-I as the polymorph present in the experimental sample, the selection being successful despite the large similarities between the molecular environments in the crystals of the two polymorphs. 相似文献
2.
Matthew J. Katz 《Computational Geometry》1997,8(6):299-316
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).
We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm. 相似文献
3.
混合位级正交试验设计的极差分析方法 总被引:3,自引:0,他引:3
本文指出,在混合位级的正交试验设计中,以往的极差分析方法存在着不足。本文给出了极差的修正方法,并用大量实例做了数值验证,说明这个修正确实很有效 相似文献
4.
本文研究作用在C2周期函数空间上的微分算子u→u″ g(u) ,其中g(u)为连续有界函数.我们将证明上述微分算子的值域限制在周期函数空间的“超曲面”中. 相似文献
5.
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown. 相似文献
6.
F. Farid 《Linear and Multilinear Algebra》2002,50(3):223-239
An upper bound for the number of components of the numerical range of matrix polynomials is established. We also establish a necessary condition and a sufficient condition for the connectedness of the numerical range of a quadratic selfadjoint matrix polynomial. The boundary of the numerical range of linear matrix polynomials is also considered. 相似文献
7.
Xia Chen 《Journal of Theoretical Probability》2006,19(3):721-739
We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup
and the liminf laws of the iterated logarithm.
We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup
and the liminf laws of the iterated logarithm. 相似文献
8.
9.
Iddo Eliazar 《Queueing Systems》2007,55(1):71-82
We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated.
We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied
to various examples, including ones with infinite queues and non-summable workloads.
AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10 相似文献
10.
This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications. 相似文献