首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   511篇
  国内免费   33篇
  完全免费   12篇
  数学   556篇
  2019年   4篇
  2018年   9篇
  2017年   18篇
  2016年   6篇
  2015年   13篇
  2014年   20篇
  2013年   27篇
  2012年   36篇
  2011年   41篇
  2010年   36篇
  2009年   26篇
  2008年   40篇
  2007年   25篇
  2006年   26篇
  2005年   23篇
  2004年   19篇
  2003年   12篇
  2002年   25篇
  2001年   8篇
  2000年   12篇
  1999年   6篇
  1998年   5篇
  1997年   11篇
  1996年   4篇
  1995年   2篇
  1994年   7篇
  1993年   6篇
  1992年   2篇
  1991年   5篇
  1990年   5篇
  1989年   5篇
  1988年   7篇
  1987年   3篇
  1986年   1篇
  1985年   3篇
  1984年   2篇
  1983年   1篇
  1982年   6篇
  1981年   3篇
  1980年   3篇
  1979年   4篇
  1978年   6篇
  1976年   3篇
  1975年   2篇
  1974年   2篇
  1973年   5篇
  1972年   4篇
  1971年   3篇
  1970年   8篇
  1969年   2篇
  1968年   1篇
  1967年   3篇
排序方式: 共有556条查询结果,搜索用时 46 毫秒
1.
Training Multilayer Perceptrons Via Minimization of Sum of Ridge Functions   总被引:5,自引:0,他引:5  
Motivated by the problem of training multilayer perceptrons in neural networks, we consider the problem of minimizing E(x)= i=1 n f i ( i x), where i R s , 1in, and each f i ( i x) is a ridge function. We show that when n is small the problem of minimizing E can be treated as one of minimizing univariate functions, and we use the gradient algorithms for minimizing E when n is moderately large. For large n, we present the online gradient algorithms and especially show the monotonicity and weak convergence of the algorithms.  相似文献
2.
The gliding hump property in vector sequence spaces   总被引:4,自引:0,他引:4  
It is shown that vector sequence spaces with a gliding hump property have many of the properties of complete spaces. For example, it is shown that the -dual of certain vector sequence spaces with a gliding hump property are sequentially complete with respect to the topology of pointwise convergence and also versions of the Banach-Steinhaus Theorem are established for such spaces.  相似文献
3.
Summary We discuss the construction of three-point finite difference approximations and their convergence for the class of singular two-point boundary value problems: (x y)=f(x,y), y(0)=A, y(1)=B, 0<<1. We first establish a certain identity, based on general (non-uniform) mesh, from which various methods can be derived. To obtain a method having order two for all (0,1), we investigate three possibilities. By employing an appropriate non-uniform mesh over [0,1], we obtain a methodM 1 based on just one evaluation off. For uniform mesh we obtain two methodsM 2 andM 3 each based on three evaluations off. For =0,M 1 andM 2 both reduce to the classical second-order method based on one evaluation off. These three methods are investigated, theirO(h 2)-convergence established and illustrated by numerical examples.  相似文献
4.
The multiplicity of solutions in non-homogeneous boundary value problems   总被引:3,自引:0,他引:3  
We use a method recently devised by Bolle to establish the existence of an infinite number of solutions for various non-homogeneous boundary value problems. In particular, we consider second order systems, Hamiltonian systems as well as semi-linear partial differential equations. The non-homogeneity can originate in the equation but also from the boundary conditions. The results are more satisfactory than those obtained by the standard “Perturbation from Symmetry” method that was developed – in various forms – in the early eighties by Bahri–Berestycki, Struwe and Rabinowitz. Received: 13 August 1998 / Revised version: 6 July 1999  相似文献
5.
Gliding hump properties of matrix domains   总被引:2,自引:0,他引:2  
Gliding hump properties play an important role in numerous topics in analysis, for instance, they are used as a substitute for the uniform boundedness principle. Since examples of sequence spaces having certain gliding hump properties are rare, the main aim of this paper is to present classes of infinite matrices A such that the matrix domain E A has a certain gliding hump property whenever a given sequence space E has this property.  相似文献
6.
On Approximate Efficiency in Multiobjective Programming   总被引:2,自引:0,他引:2  
This paper is focused on approximate ( -efficient) solutions of multiobjective mathematical programs. We introduce a new -efficiency concept which extends and unifies different notions of approximate solution defined in the literature. We characterize these -efficient solutions in convex multiobjective programs through approximate solutions of linear scalarizations, which allow us to obtain parametric representations of different -efficiency sets. Several classical -efficiency notions are considered in order to show the concepts introduced and the results obtained.This research was partially supported by Ministerio de Ciencia y Tecnología (Spain), project BFM2003-02194.  相似文献
7.
A fuzzy random forest   总被引:2,自引:0,他引:2  
When individual classifiers are combined appropriately, a statistically significant increase in classification accuracy is usually obtained. Multiple classifier systems are the result of combining several individual classifiers. Following Breiman’s methodology, in this paper a multiple classifier system based on a “forest” of fuzzy decision trees, i.e., a fuzzy random forest, is proposed. This approach combines the robustness of multiple classifier systems, the power of the randomness to increase the diversity of the trees, and the flexibility of fuzzy logic and fuzzy sets for imperfect data management. Various combination methods to obtain the final decision of the multiple classifier system are proposed and compared. Some of them are weighted combination methods which make a weighting of the decisions of the different elements of the multiple classifier system (leaves or trees). A comparative study with several datasets is made to show the efficiency of the proposed multiple classifier system and the various combination methods. The proposed multiple classifier system exhibits a good accuracy classification, comparable to that of the best classifiers when tested with conventional data sets. However, unlike other classifiers, the proposed classifier provides a similar accuracy when tested with imperfect datasets (with missing and fuzzy values) and with datasets with noise.  相似文献
8.
The harmony search (HS) algorithm is a recently developed meta-heuristic algorithm, and has been very successful in a wide variety of optimization problems. HS was conceptualized using an analogy with music improvisation process where music players improvise the pitches of their instruments to obtain better harmony. The HS algorithm does not require initial values and uses a random search instead of a gradient search, so derivative information is unnecessary. Furthermore, the HS algorithm is simple in concept, few in parameters, easy in implementation, imposes fewer mathematical requirements, and does not require initial value settings of the decision variables. In recent years, the investigation of synchronization and control problem for discrete chaotic systems has attracted much attention, and many possible applications. The tuning of a proportional–integral–derivative (PID) controller based on an improved HS (IHS) algorithm for synchronization of two identical discrete chaotic systems subject the different initial conditions is investigated in this paper. Simulation results of the IHS to determine the PID parameters to synchronization of two Hénon chaotic systems are compared with other HS approaches including classical HS and global-best HS. Numerical results reveal that the proposed IHS method is a powerful search and controller design optimization tool for synchronization of chaotic systems.  相似文献
9.
A generalized Orlicz-Pettis Theorem and applications   总被引:1,自引:0,他引:1  
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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