首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   130篇
  免费   0篇
化学   28篇
晶体学   3篇
力学   2篇
数学   58篇
物理学   39篇
  2023年   2篇
  2022年   1篇
  2021年   2篇
  2018年   1篇
  2016年   1篇
  2015年   1篇
  2014年   2篇
  2013年   13篇
  2012年   4篇
  2011年   5篇
  2010年   4篇
  2009年   3篇
  2008年   5篇
  2007年   5篇
  2006年   3篇
  2005年   6篇
  2004年   3篇
  2003年   1篇
  2002年   3篇
  2001年   3篇
  2000年   2篇
  1997年   2篇
  1996年   4篇
  1995年   1篇
  1994年   1篇
  1993年   1篇
  1992年   1篇
  1989年   2篇
  1986年   2篇
  1985年   4篇
  1984年   6篇
  1983年   2篇
  1982年   5篇
  1981年   3篇
  1980年   3篇
  1979年   3篇
  1978年   2篇
  1977年   2篇
  1976年   2篇
  1974年   2篇
  1972年   1篇
  1971年   5篇
  1969年   2篇
  1968年   3篇
  1966年   1篇
排序方式: 共有130条查询结果,搜索用时 250 毫秒
21.
22.
In this paper the method of stochastic quantization introduced by Parisi and Wu is extended to field theories that include fermions and are supersymmetric. A new non-perturbative regulator based on stochastic quantization is introduced. This regulator preserves all the symmetries of the lagrangian, including gauge, chiral, and supersymmetries, at the expense of introducing non-locality.  相似文献   
23.
Using the relationship between the decay rate of autocorrelation and the characteristics of singular Fourier spectra, we show that the correlation dimension of the spectral measure for the infinite Thue-Morse symbolic sequence equals 3 − log(1 + √17)/log 2=0.64298….  相似文献   
24.
Settling a problem raised by B. Grünbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about 1168 of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.  相似文献   
25.
L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n − 2)(n − 4) … 4 · 2, (or: n(n − 2)(n − 4) … 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.  相似文献   
26.
A variational formulation, equivalent to an initial-value problem for nonlinear systems, not necessarily self-adjoint, is derived with applications to linear and nonlinear wave problems and transonic aerodynamics.
Résumé Nous présentons une formulation variationnelle pour les systèmes quasi-linéaires et leur applications aux ondes non-linéaires et l'écoulement transonique stationnaire.


Work partially supported by Air-Force Grant No. AFOSR-73-2561.  相似文献   
27.
It is shown that for every sequence of non-negative integers (p n|1≦n≠3) satisfying the equation {ie19-1} (respectively, =0) there exists a 6-valent, planar (toroidal, respectively) multi-graph that has preciselyp n n gonal faces for alln, 1≦n≠3. This extends Eberhard’s theorem that deals, in a similar fashion, with 3-valent, 3-connected planar graphs; the equation involved follows from the famous Euler’s equation.  相似文献   
28.
A ring is an LD-ring ifR is left bounded, ifR/J is a left Artinian left principal ideal ring for every proper idealJ inR, and ifR has finite left Goldie dimension. IfR is non-Artinian thenR is an order in a simple Artinian ringS. The ideal theory of LD-rings is investigated, and we discuss some conditions under which an LD-ring is an hereditary ring, and some under which an LD-ring is a Noetherian, bounded, maximal Asano order. A central localization of an LD-ring is an LD-ring, and the center of some LD-rings is a Krull-domain. This research was supported in part by the National Science Foundation Grant GP 23861.  相似文献   
29.
Partial volume effects are often experienced in diffusion-weighted MRI of biologic tissue. This is when the signal attenuation reflects a mixture of diffusion processes, originating from different tissue compartments, residing in the same voxel. Decomposing the mixture requires elaborated models that account for multiple compartments, yet the fitting problem for those models is usually ill posed. We suggest a novel approach for stabilizing the fitting problem of the multiple-tensors model by a variational framework that adds biologically oriented assumption of neighborhood alignments. The framework is designed to address fiber ambiguity caused by a number of neuronal fiber compartments residing in the same voxel. The method requires diffusion data acquired by common, clinically feasible MRI sequences, and is able to derive familiar tensor quantities for each compartment. Neighborhood alignment is performed by adding piece-wise smooth regularization constraints to an energy function. Minimization with the gradient descent method produces a set of diffusion-reaction partial differential equations that describe a tensor-preserving flow towards a best approximation of the data while maintaining the constraints. We analyze fiber compartment separation capabilities on a synthetic model of crossing fibers and on brain areas known to have crossing fibers. We compare the results with diffusion tensor imaging analysis and discuss applications for the framework.  相似文献   
30.
Extending earlier results in the plane, we prove that every n-polygon in sufficiently general position in d-dimensional projective space, n d + 2, gives rise to a derived n-polygon, which preserves a few functions; these functions are the cyclial product of (actually affine) ratios of various points, obtained by proper projections on suitable lines.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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