全文获取类型
收费全文 | 111篇 |
免费 | 4篇 |
国内免费 | 12篇 |
专业分类
化学 | 2篇 |
力学 | 2篇 |
综合类 | 5篇 |
数学 | 110篇 |
物理学 | 8篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 4篇 |
2010年 | 4篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 6篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有127条查询结果,搜索用时 406 毫秒
71.
L─Fuzzy拓扑空间的局部连通性 总被引:1,自引:0,他引:1
文[1]曾在广义拓扑分子格中提出了一种连通性。本文在L—fuzzy拓扑空间中给出了这种连通性的几种刻划,并引入了L—fyzzy拓扑空间的局部连通性。这种局部连通性是有限可乘的,商序同态保持的且是好的推广。另外,fuzzy实直线是局部连通的。 相似文献
72.
A general class of Lorentzian metrics,
,
, with
any Riemannian manifold, is introduced in order to generalize classical exact plane fronted waves. Here, we start a systematic study of their main geodesic properties: geodesic completeness, geodesic connectedness and multiplicity causal character of connecting geodesics. These results are independent of the possibility of a full integration of geodesic equations. Variational and geometrical techniques are applied systematically. In particular, we prove that the asymptotic behavior of H(x,u) with x at infinity determines many properties of geodesics. Essentially, a subquadratic growth of H ensures geodesic completeness and connectedness, while the critical situation appears when H(x,u) behaves in some direction as
, as in the classical model of exact gravitational waves. 相似文献
73.
James C. Robinson 《Journal of Dynamics and Differential Equations》1999,11(3):557-581
Many dissipative evolution equations possess a global attractor
with finite Hausdorff dimension d. In this paper it is shown that there is an embedding X of
into
, with N=[2d+2], such that X is the global attractor of some finite-dimensional system on
with trivial dynamics on X. This allows the construction of a discrete dynamical system on
which reproduces the dynamics of the time T map on
and has an attractor within an arbitrarily small neighborhood of X. If the Hausdorff dimension is replaced by the fractal dimension, a similar construction can be shown to hold good even if one restricts to orthogonal projections rather than arbitrary embeddings. 相似文献
74.
By a scalarization method and properties of semi-algebraic sets, it is proved that both the Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the constraint set is polyhedral convex and the basic operators are given by polynomial functions, have finitely many connected components. Consequences of the results for vector optimization problems are discussed in details. The results of this paper solve in the affirmative some open questions for the case of general problems without requiring monotonicity of the operators involved. 相似文献
75.
Danica Jakubikova-Studenovska 《Czechoslovak Mathematical Journal》2005,55(4):1067-1078
The aim of the present paper is to describe all connected monounary algebras for which there exists a representation by means
of connected monounary algebras which are retract irreducible in the class
c (or in
).
This work was supported by the Slovak Grant VEGA 1/0423/03. 相似文献
76.
Alexander A. Ivanov 《Journal of Algebraic Combinatorics》1992,1(1):45-69
The sporadic simple group F
2 known as Fischer's Baby Monster acts flag-transitively on a rank 5 P-geometry
. P-geometries are geometries with string diagrams, all of whose nonempty edges except one are projective planes of order 2 and one terminal edge is the geometry of the Petersen graph. Let
be a flag-transitive P-geometry of rank 5. Suppose that each proper residue of
is isomorphic to the corresponding residue in
. We show that in this case
is isomorphic to
. This result realizes a step in classification of the flag-transitive P-geometries and also plays an important role in the characterization of the Fischer–Griess Monster in terms of its 2-local parabolic geometry. 相似文献
77.
QIANShang-Wu GUZhi-Yu 《理论物理通讯》2003,40(3):329-331
This article shows that in Aharonov-Bohm (AB) effect arrangements, the electron wave propagation space is doubly connected for two real coherent sources, and simply connected under certain condition for two virtual coherent sources, and all known AB experiments belong to the latter case. By the Feynman path integral method, we show that in the former case there is no AB effect, whereas in the latter case there is. 相似文献
78.
Efficiency and Henig Efficiency for Vector Equilibrium Problems 总被引:6,自引:0,他引:6
We introduce the concept of Henig efficiency for vector equilibrium problems, and extend scalarization results from vector optimization problems to vector equilibrium problems. Using these scalarization results, we discuss the existence of the efficient solutions and the connectedness of the set of Henig efficient solutions to the vector-valued Hartman–Stampacchia variational inequality. 相似文献
79.
拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性 总被引:3,自引:0,他引:3
本文研究局部凸的Hausdorff拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题。利用广义鞍点定理,证明了目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的。 相似文献
80.
The authors recently defined a new graph invariant denoted by Ω(G) only in terms of a given degree sequence which is also related to the Euler characteristic. It has many important combinatorial applications in graph theory and gives direct information compared to the better known Euler characteristic on the realizability, connectedness, cyclicness, components, chords, loops etc. Many similar classification problems can be solved by means of Ω. All graphs G so that Ω(G) ≤-4 are shown to be disconnected, and if Ω(G) ≥-2, then the graph is potentially connected. It is also shown that if the realization is a connected graph and Ω(G) =-2, then certainly the graph should be a tree.Similarly, it is shown that if the realization is a connected graph G and Ω(G) ≥ 0, then certainly the graph should be cyclic. Also, when Ω(G) ≤-4, the components of the disconnected graph could not all be cyclic and if all the components of G are cyclic, then Ω(G) ≥ 0. In this paper, we study an extremal problem regarding graphs. We find the maximum number of loops for three possible classes of graphs.We also state a result giving the maximum number of components amongst all possible realizations of a given degree sequence. 相似文献