全文获取类型
收费全文 | 4638篇 |
免费 | 727篇 |
国内免费 | 109篇 |
专业分类
化学 | 739篇 |
晶体学 | 1篇 |
力学 | 87篇 |
综合类 | 74篇 |
数学 | 792篇 |
物理学 | 914篇 |
无线电 | 2867篇 |
出版年
2024年 | 106篇 |
2023年 | 386篇 |
2022年 | 772篇 |
2021年 | 749篇 |
2020年 | 572篇 |
2019年 | 315篇 |
2018年 | 231篇 |
2017年 | 240篇 |
2016年 | 258篇 |
2015年 | 189篇 |
2014年 | 237篇 |
2013年 | 254篇 |
2012年 | 133篇 |
2011年 | 131篇 |
2010年 | 109篇 |
2009年 | 115篇 |
2008年 | 90篇 |
2007年 | 85篇 |
2006年 | 71篇 |
2005年 | 67篇 |
2004年 | 48篇 |
2003年 | 34篇 |
2002年 | 40篇 |
2001年 | 24篇 |
2000年 | 43篇 |
1999年 | 31篇 |
1998年 | 16篇 |
1997年 | 23篇 |
1996年 | 16篇 |
1995年 | 21篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 9篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 5篇 |
排序方式: 共有5474条查询结果,搜索用时 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.
Nobuyuki Hanaki 《Complexity》2004,9(5):41-50
This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004 相似文献
3.
网络电视的发展及其对远程教育的影响 总被引:2,自引:0,他引:2
计算机网络技术的发展给电视节目的播出方式带来了巨大的变化,网络电视这一传播媒体应运而生。从而改变了目前广播电视媒体信息单向传播的缺陷。介绍了网络电视的发展,就网络电视对远程教育的影响进行了探讨。 相似文献
4.
Decentralized iterative learning control for a class of large scale interconnected dynamical systems
Hansheng Wu 《Journal of Mathematical Analysis and Applications》2007,327(1):233-245
The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes. 相似文献
5.
基于约束优化的联想记忆模型学习算法 总被引:1,自引:1,他引:0
本文提出了一种对称互连神经元网络的学习策略,利用全局约束优化方法确定连接权。优化过程采用了梯度下降技术。这种学习算法可以保证训练样本成为系统的稳定吸引子,并且具有优化意义上的最大吸引域。本文讨论了网络的存储容量,训练样本的渐近稳定性和吸引域大小。计算机实验结果说明了学习算法的优越性。 相似文献
6.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
7.
Evgenia Adamopoulou Konstantinos Demestichas Panagiotis Demestichas Michael Theologou 《International Journal of Communication Systems》2008,21(3):311-330
Cognitive radio systems dynamically reconfigure the algorithms and parameters they use, in order to adapt to the changing environment conditions. However, reaching proper reconfiguration decisions presupposes a way of knowing, with high enough assurance, the capabilities of the alternate configurations, especially in terms of achievable transmission capacity and coverage. The present paper addresses this problem, firstly, by specifying a complete process for extracting estimations of the capabilities of candidate configurations, in terms of transmission capacity and coverage, and, secondly, by enhancing these estimations with the employment of a machine learning technique. The technique is based on the use of Bayesian Networks, in conjunction with an effective learning and adaptation strategy, and aims at extracting and exploiting knowledge and experience, in order to reach robust (i.e. stable and reliable) estimations of the configurations' capabilities. Comprehensive results of the proposed method are presented, in order to validate its functionality. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
8.
Support vector machine (SVM), developed by Vapnik et al., is a new and promising technique for classification and regression and has been proved to be competitive with the best available learning machines in many applications. However, the classification speed of SVM is substantially slower than that of other techniques with similar generalization ability. A new type SVM named projected SVM (PSVM), which is a combination of feature vector selection (FVS) method and linear SVM (LSVM), is proposed in present paper. In PSVM, the FVS method is first used to select a relevant subset (feature vectors, FVs) from the training data, and then both the training data and the test data are projected into the subspace constructed by FVs, and finally linear SVM(LSVM) is applied to classify the projected data. The time required by PSVM to calculate the class of new samples is proportional to the count of FVs. In most cases, the count of FVs is smaller than that of support vectors (SVs), and therefore PSVM is faster than SVM in running. Compared with other speeding-up techniques of SVM, PSVM is proved to possess not only speeding-up ability but also de-noising ability for high-noised data, and is found to be of potential use in mechanical fault pattern recognition. 相似文献
9.
Alina Constantinescu 《Applications of Mathematics》2007,52(4):321-326
In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm
which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a
choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a
concrete example which uses this algorithm. 相似文献
10.
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/. 相似文献