全文获取类型
收费全文 | 20754篇 |
免费 | 247篇 |
国内免费 | 19篇 |
专业分类
教育 | 14335篇 |
科学研究 | 2526篇 |
各国文化 | 160篇 |
体育 | 1492篇 |
综合类 | 19篇 |
文化理论 | 212篇 |
信息传播 | 2276篇 |
出版年
2022年 | 144篇 |
2021年 | 224篇 |
2020年 | 329篇 |
2019年 | 431篇 |
2018年 | 652篇 |
2017年 | 649篇 |
2016年 | 608篇 |
2015年 | 385篇 |
2014年 | 596篇 |
2013年 | 3430篇 |
2012年 | 505篇 |
2011年 | 506篇 |
2010年 | 461篇 |
2009年 | 413篇 |
2008年 | 469篇 |
2007年 | 446篇 |
2006年 | 406篇 |
2005年 | 361篇 |
2004年 | 399篇 |
2003年 | 333篇 |
2002年 | 346篇 |
2001年 | 454篇 |
2000年 | 496篇 |
1999年 | 395篇 |
1998年 | 221篇 |
1997年 | 280篇 |
1996年 | 253篇 |
1995年 | 186篇 |
1994年 | 211篇 |
1993年 | 172篇 |
1992年 | 332篇 |
1991年 | 296篇 |
1990年 | 312篇 |
1989年 | 327篇 |
1988年 | 295篇 |
1987年 | 275篇 |
1986年 | 262篇 |
1985年 | 303篇 |
1984年 | 223篇 |
1983年 | 216篇 |
1982年 | 182篇 |
1981年 | 174篇 |
1980年 | 165篇 |
1979年 | 266篇 |
1978年 | 187篇 |
1977年 | 172篇 |
1976年 | 138篇 |
1975年 | 135篇 |
1974年 | 147篇 |
1973年 | 140篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
82.
Gérald Séguin 《Journal of The Franklin Institute》1980,309(3):179-189
A sequence of metrics {DN} is said to be additive and matched to a discrete memoryless channel (DMC) if DN is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum DN-distance decoder. Necessary and sufficient conditions on the transition probabilities of a DMC for the existence of a sequence of additive metrics matched to it are given. In the case of the binary channel these are shown to be equivalent to the channel being symmetric. Explicit transition probabilities are given for a large class of ternary DMCs with an associated sequence of additive matched metrics. The problem solved here may be considered a generalization of the problem of finding the DMCs matched to the Lee metric solved by Chiang and Wolf in 1971 (2). 相似文献
83.
The Graph-Theoretical Field Model provides a unifying approach for developing numerical models of field and continuum problems. The methodology examines the field problem from the first stages of conceptualization without recourse to the governing differential equations of the field problem; this is accomplished by deriving discrete statements of the physical laws which govern the field behaviour. There are generally three laws, and these are modelled by the “cutset equations”, the “circuit equations”, and the “terminal equations”. In order to establish these three sets of equations it is expedient first to spatially discretize the field in a manner similar to the finite difference method and then to associate a linear graph (denoted as the field graph) with the spatial discretization. The concept of “through” and “across” variables, which underlies the cutset and circuit equations respectively, enables one to define the graph in an unambiguous manner such that each “edge” of the graph identifies a pair of complementary variables. From a knowledge of the constitutive properties and the boundary conditions of the field it is possible to associate terminal equations with sets of edges. Since the resulting sets of equations represent the field equations, these equations provide the basis for a complete (but approximate) solution to the field or continuum problem. In fact, this system approach uses a two part model: one for the components and another for the interconnection pattern of the components which renders the formulation procedures totally independent of the solution procedure.This paper presents the theoretical basis of the model and several graph-theoretic formulations for steady-state problems. Examples from heat conduction and small- deformation elasticity are included. 相似文献
84.
M.O. Ahmad C.H. Reddy V. Ramachandran M.N.S. Swamy 《Journal of The Franklin Institute》1979,307(2):71-81
Necessary and sufficient conditions are obtained for the realization of an m-variable positive real function (PRF) as the impedence function of a resistively-terminated ladder network of m lossless two-ports connected in cascade. Each two-port is a single-variable lossless ladder with all of its transmission zeros either at the origin or at finity. Conditions are also obtained when each of the two-ports is a Fujisawa-type lowpass ladder. 相似文献
85.
86.
87.
88.
89.
This paper introduces a polynomial operator called the DT-polynomial as a novel approach to network flow problems. The class of networks dealt with is time-varying in the sense that the capacity, cost, and travel-time of each edge may vary in discrete time. The Dt-polynomial is a polynomial in two operators, D (delay) and T (time), which is used for describing the time-varying transmission characteristics. The paper starts with the mathematics involving the DT-polynomials. A new shortest arrival route algorithm is presented, and its computational complexity is found to be favorable in comparison with others such as Dijkstra's method and the potential method derived from Ford-Fulkerson's technique. Furthermore, a dynamic flow problem is formulated and analyzed in terms of DT-polynomials, and a latest-departure earliest-arrival schedule is given. Finally, a modified DT-polynomial is applied to digital filter networks. 相似文献
90.
In an attempt to clarify the chronological relationship between identity and equivalence conservation, normal preschool-aged children (experiment 1) were exposed to brief videotape demonstrations of a model conserving identity and equivalence, identity only, equivalence only, or neither. Subsequent performances indicate that identity was easier to accelerate than equivalence, and training in both identity and equivalence appeared to be most effective in accelerating conservation. Trainable mentally retarded (TMR) children were then exposed to either the identity-equivalence-conserving or control model (experiment 2). This population, which some have argued remains at a preoperational level of functioning, was more likely to conserve identity than equivalence. In addition, conservation in the training group increased following training, though these gains were not maintained over a 3-week retention interval. 相似文献