全文获取类型
收费全文 | 1791篇 |
免费 | 77篇 |
国内免费 | 31篇 |
专业分类
化学 | 183篇 |
晶体学 | 1篇 |
力学 | 51篇 |
综合类 | 4篇 |
数学 | 617篇 |
物理学 | 291篇 |
无线电 | 752篇 |
出版年
2024年 | 14篇 |
2023年 | 96篇 |
2022年 | 99篇 |
2021年 | 109篇 |
2020年 | 107篇 |
2019年 | 63篇 |
2018年 | 55篇 |
2017年 | 71篇 |
2016年 | 81篇 |
2015年 | 52篇 |
2014年 | 112篇 |
2013年 | 120篇 |
2012年 | 84篇 |
2011年 | 96篇 |
2010年 | 82篇 |
2009年 | 108篇 |
2008年 | 100篇 |
2007年 | 86篇 |
2006年 | 62篇 |
2005年 | 58篇 |
2004年 | 35篇 |
2003年 | 20篇 |
2002年 | 19篇 |
2001年 | 18篇 |
2000年 | 8篇 |
1999年 | 25篇 |
1998年 | 20篇 |
1997年 | 14篇 |
1996年 | 18篇 |
1995年 | 16篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1971年 | 1篇 |
排序方式: 共有1899条查询结果,搜索用时 15 毫秒
1.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
2.
本文在A.Blanco等人的算法的基础上,提出了max-min神经网络的一种改进了的反馈学习算法,严格证明了该算法的迭代收敛性,理论分析及实例计算结果均表明,本文算法具有算法简单,收敛速度快,输出误差小等显著特点。 相似文献
3.
Djamel Meraghni Abdelhakim Necir 《Methodology and Computing in Applied Probability》2007,9(4):557-572
The characteristic exponent α of a Lévy-stable law S
α
(σ, β, μ) was thoroughly studied as the extreme value index of a heavy tailed distribution. For 1 < α < 2, Peng (Statist. Probab. Lett. 52: 255–264, 2001) has proposed, via the extreme value approach, an asymptotically normal estimator for the location parameter μ. In this paper, we derive by the same approach, an estimator for the scale parameter σ and we discuss its limiting behavior.
相似文献
4.
通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程. 相似文献
5.
Felipe Cucker Steve Smale Ding-Xuan Zhou 《Foundations of Computational Mathematics》2004,4(3):315-343
We describe a model for the evolution of the languages used by the agents of a
society. Our main result proves convergence of these languages to a common
one under certain conditions. A few special cases are elaborated in more
depth. 相似文献
6.
具有两台专用机,两台通用机的Q4//Cmax问题的近似算法 总被引:8,自引:1,他引:7
本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4//Cmax问题,对这类特殊的排序问题,提出一种启发式算法,得到了最差情况下性能指标的严格的界. 相似文献
7.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
8.
9.
In the present era, a major drawback of current anti-cancer drugs is the lack of satisfactory specificity towards tumor cells. Despite the presence of several therapies against cancer, tumor homing peptides are gaining importance as therapeutic agents. In this regard, the huge number of therapeutic peptides generated in recent years, demands the need to develop an effective and interpretable computational model for rapidly, effectively and automatically predicting tumor homing peptides. Therefore, a sequence-based approach referred herein as THPep has been developed to predict and analyze tumor homing peptides by using an interpretable random forest classifier in concomitant with amino acid composition, dipeptide composition and pseudo amino acid composition. An overall accuracy and Matthews correlation coefficient of 90.13% and 0.76, respectively, were achieved from the independent test set on an objective benchmark dataset. Upon comparison, it was found that THPep was superior to the existing method and holds high potential as a useful tool for predicting tumor homing peptides. For the convenience of experimental scientists, a web server for this proposed method is provided publicly at http://codes.bio/thpep/. 相似文献
10.
《Digital Communications & Networks》2023,9(1):125-137
In this paper, an advanced and optimized Light Gradient Boosting Machine (LGBM) technique is proposed to identify the intrusive activities in the Internet of Things (IoT) network. The followings are the major contributions: i) An optimized LGBM model has been developed for the identification of malicious IoT activities in the IoT network; ii) An efficient evolutionary optimization approach has been adopted for finding the optimal set of hyper-parameters of LGBM for the projected problem. Here, a Genetic Algorithm (GA) with k-way tournament selection and uniform crossover operation is used for efficient exploration of hyper-parameter search space; iii) Finally, the performance of the proposed model is evaluated using state-of-the-art ensemble learning and machine learning-based model to achieve overall generalized performance and efficiency. Simulation outcomes reveal that the proposed approach is superior to other considered methods and proves to be a robust approach to intrusion detection in an IoT environment. 相似文献