全文获取类型
收费全文 | 949篇 |
免费 | 118篇 |
国内免费 | 91篇 |
专业分类
化学 | 150篇 |
力学 | 17篇 |
综合类 | 9篇 |
数学 | 595篇 |
物理学 | 110篇 |
无线电 | 277篇 |
出版年
2024年 | 4篇 |
2023年 | 21篇 |
2022年 | 27篇 |
2021年 | 20篇 |
2020年 | 52篇 |
2019年 | 32篇 |
2018年 | 29篇 |
2017年 | 38篇 |
2016年 | 48篇 |
2015年 | 38篇 |
2014年 | 49篇 |
2013年 | 80篇 |
2012年 | 52篇 |
2011年 | 50篇 |
2010年 | 51篇 |
2009年 | 47篇 |
2008年 | 69篇 |
2007年 | 51篇 |
2006年 | 48篇 |
2005年 | 34篇 |
2004年 | 43篇 |
2003年 | 38篇 |
2002年 | 36篇 |
2001年 | 41篇 |
2000年 | 27篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 27篇 |
1996年 | 9篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1158条查询结果,搜索用时 15 毫秒
1.
数字水印技术的发展为解决图像认证和完整性保护问题提供了新的思路。对用于篡改检测和图像认证的水印技术做了综述。数字水印技术根据其识别差错的能力分为四种类型:易损水印、半易损水印、混合水印和自嵌入水印。最后还对水印认证技术的安全性问题进行了讨论。 相似文献
2.
We consider some Sobolev-type spaces and obtain a necessary and sufficient condition for their embedding in a Lebesgue space. 相似文献
3.
Nikolaos S. PAPAGEORGIOU Nikolaos YANNAKAKIS 《数学学报(英文版)》2005,21(5):977-996
This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x(t) and x(t). In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 (T, H). Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 (T, H) to the solutions of the original convex problem (strong relaxation). An example of a nonlinear hyperbolic optimal control problem is also discussed. 相似文献
4.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure
of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered
under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some
of these along with some other recent advances on graph minors are surveyed.
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number
16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists
Supported in part by the Research Grant P1–0297 and by the CRC program
On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia 相似文献
5.
Howel Tong 《应用数学学报(英文版)》2002,18(2):177-184
Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series. 相似文献
6.
Piotr W. Nowak 《Journal of Functional Analysis》2007,243(1):323-344
We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory. 相似文献
7.
以Takens嵌入定理和影子定理为理论依据,提出一种能对混沌信号去噪的局部投影方法。该方法不需潜在动力学系统的先验知识,符合工程实用的要求。通过实验结果表明这种方法对混沌信号去噪很有效。 相似文献
8.
一种新的图像水印方案 总被引:1,自引:0,他引:1
目标区域是图像中视觉上最重要的部分。针对现有的水印算法很少考虑图像中确定的目标区域这一问题,提出了一种基于目标区域的水印方案(WIOR)。方案首先利用小波变换分析图像的目标特征,并依据图像的小波高频系数特征对其进行聚类,获得水印的嵌入域,在此嵌入域中,选择小波系数并对其进行量化调制来嵌入二值扩谱水印;同时,通过只在图像的局部区域内嵌入较少的水印信息来改善水印的隐蔽性。实验结果表明,该方案对于一类具有突出目标特征的图像具有较好的效果。嵌入的水印主要优势在于真正把水印嵌入图像的视觉重要部分,从而能有效地抵御剪切攻击,而且可以实现盲检测。 相似文献
9.
Brenda J. Latka 《Journal of Graph Theory》2003,42(3):165-192
A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N5 on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N5 by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T1,…,Tk} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T1,…,Tk is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003 相似文献
10.
Peter J. Cameron 《组合设计杂志》2005,13(6):466-470
It is shown that there is a function g on the natural numbers such that a partial Steiner triple system U on u points can be embedded in a Steiner triple system V on ν points, in such a way that all automorphisms of U can be extended to V, for every admissible ν satisfying ν > g(u). We find exponential upper and lower bounds for g. © 2005 Wiley Periodicals, Inc. J Combin Designs. 相似文献