全文获取类型
收费全文 | 640篇 |
免费 | 21篇 |
国内免费 | 1篇 |
专业分类
管理学 | 40篇 |
人口学 | 22篇 |
丛书文集 | 24篇 |
理论方法论 | 27篇 |
综合类 | 249篇 |
社会学 | 17篇 |
统计学 | 283篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 19篇 |
2019年 | 17篇 |
2018年 | 18篇 |
2017年 | 26篇 |
2016年 | 22篇 |
2015年 | 19篇 |
2014年 | 20篇 |
2013年 | 125篇 |
2012年 | 34篇 |
2011年 | 34篇 |
2010年 | 25篇 |
2009年 | 19篇 |
2008年 | 35篇 |
2007年 | 30篇 |
2006年 | 25篇 |
2005年 | 22篇 |
2004年 | 22篇 |
2003年 | 24篇 |
2002年 | 15篇 |
2001年 | 13篇 |
2000年 | 12篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 6篇 |
1996年 | 7篇 |
1995年 | 9篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 10篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有662条查询结果,搜索用时 234 毫秒
81.
分析了电磁波传播时的超光速群速。对高斯波包在分段填充不同介质的波导中的传播情况进行了数值模拟,得到高斯波包通过截止区的群速和能速,并对其中涉及到的“超光速”问题作了一定的分析。通过模拟得出,在一定的截止区长度范围内和一定工作频率范围内,群速超过光速;并得到,波包的能量传播速度(能速)始终不会超过光速。 相似文献
82.
In the present paper we are going to extend the likelihood ratio test to the case in which the available experimental information
involves fuzzy imprecision (more precisely, the observable events associated with the random experiment concerning the test
may be characterized as fuzzy subsets of the sample space, as intended by Zadeh, 1965). In addition, we will approximate the
immediate intractable extension, which is based on Zadeh’s probabilistic definition, by using the minimum inaccuracy principle
of estimation from fuzzy data, that has been introduced in previous papers as an operative extension of the maximum likelihood
method. 相似文献
83.
Yian Surao 《佛山科学技术学院学报(社会科学版)》1993,(2)
本文探讨如何找最小正实数k,使f(x)=sin(kx+)在任意两个整数间至少有一个最大值1与一个最小值-1,导出了函数f(x)的周期T与f(x)具有上述性质的关系,然后把问题简化为在0≤φ≤π/2的范围内讨论,并得出了φ为0,π/2,q/p·π/2(q/p为既约真分数)及其它四种情况的最小正实数k。 相似文献
84.
The authors introduce the notion of split generalized wordlength pattern (GWP), i.e., treatment GWP and block GWP, for a blocked nonregular factorial design. They generalize the minimum aberration criterion to suit this type of design. Connections between factorial design theory and coding theory allow them to obtain combinatorial identities that govern the relationship between the split GWP of a blocked factorial design and that of its blocked consulting design. These identities work for regular and nonregular designs. Furthermore, the authors establish general rules for identifying generalized minimum aberration (GMA) blocked designs through their blocked consulting designs. Finally they tabulate and compare some GMA blocked designs from Hall's orthogonal array OA(16,215,2) of type III. 相似文献
85.
Uniformly minimum-variance unbiased (UMVU) estimators of the total risk and the mean-squared-error (MSE) matrix of the Stein estimator for the multivariate normal mean with unknown covariance matrix are proposed. The estimated MSE matrix is helpful in identifying the components which contribute most to the total risk. It also contains information about the performance of the shrinkage estimator with respect to other quadratic loss functions. 相似文献
86.
This paper describes an estimation of the time delay between two stationary time series signals, in which an input signal is measured with little noise and an output signal is the sum of a noise and the response from a linear system. We use the Hilbert transform relation for minimum delay systems to estimate the time delay. Some computer simulation results are given to evaluate the performance of the proposed method. 相似文献
87.
Tsan-Sheng?Hsu Kuo-Hui?Tsai Da-Wei?WangEmail author D.?T.?Lee 《Journal of Combinatorial Optimization》2005,9(1):101-120
Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum total edge weight. In such a subgraph, we require that for each vertex s
S and t
T, there is a path from s to a terminating vertex as well as a path from a starting vertex to t. This problem can easily be proven NP-hard. For solving the minimum Steiner network problem, we first present an algorithm that runs in time and space that both are polynomial in n with constant degrees, but exponential in |S|+|T|, where n is the number of vertices in G. Then we present an algorithm that uses space that is quadratic in n and runs in time that is polynomial in n with a degree O(max {max {|S|,|T|}–2,min {|S|,|T|}–1}). In spite of this degree, we prove that the number of Steiner vertices in our solution can be as large as |S|+|T|–2. Our algorithm can enumerate all possible optimal solutions. The input graph G can either be undirected or directed acyclic. We also give a linear time algorithm for the special case when min {|S|,|T|} = 1 and max {|S|,|T|} = 2.The minimum union paths problem is similar to the minimum Steiner network problem except that we are given a set H of hitting vertices in G in addition to the sets of starting and terminating vertices. We want to find a subgraph of G with the minimum total edge weight such that the conditions required by the minimum Steiner network problem are satisfied as well as the condition that every hitting vertex is on a path from a starting vertex to a terminating vertex. Furthermore, G must be directed acyclic. For solving the minimum union paths problem, we also present algorithms that have a time and space tradeoff similar to algorithms for the minimum Steiner network problem. We also give a linear time algorithm for the special case when |S| = 1, |T| = 1 and |H| = 2.An extended abstract of part of this paper appears in Hsu et al. (1996).Supported in part by the National Science Foundation under Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under Grant No. N00014-93-1-0272.Supported in part by the National Science Council, Taiwan, ROC, under Grant No. NSC-83-0408-E-001-021. 相似文献
88.
Kam-Wah Tsui 《Revue canadienne de statistique》1979,7(2):193-200
Let X1, …, Xp be independent random variables, all having the same distribution up to a possibly varying unspecified parameter, where each of the p distributions belongs to the family of one parameter discrete exponential distributions. The problem is to estimate the unknown parameters simultaneously. Hudson (1978) shows that the minimum variance unbiased estimator (MVUE) of the parameters is inadmissible under squared error loss, and estimators better than the MVUE are proposed. Essentially, these estimators shrink the MVUE towards the origin. In this paper, we indicate that estimators shifting the MVUE towards a point different from the origin or a point determined by the observations can be obtained. 相似文献
89.
刘养卉 《西北农林科技大学学报(社会科学版)》2014,14(2):32-37
对甘肃省农村最低生活保障制度进行了相关调查,对该制度实施的现状和存在的问题进行了分析,研究表明:甘肃省农村最低生活保障制度在实施中存在的问题主要有经费缺乏,保障水平低,覆盖面窄,低保对象的确定和界定标准困难,缺乏法律保障,下级部门执行不力等,因此要科学确定农村居民最低生活保障标准,提高保障标准;完善最低生活保障对象的甄别机制;大力推行政府主导与多元复合的农村低保救助模式;运用专业技术,提高管理水平;建立健全综合性的低保制度体系;加强法制建设,实现最低生活保障的法制化、规范化管理。 相似文献
90.
公平的城乡居民最低生活保障制度是实现人权的基本需要,也是是社会公平的基本内容。制度化的城乡二元对立是造成实践中城乡居民最低生活保障否公的制度原因。所以,要从根本上解决城乡居民最低生活保障的否公必须从公平制度入手。文章力图在平等性和差别性相结合的公平.则指导下,从确立公平合理的低保标准、构建公平理性的法律和经济制度等方面提出了构建公平正义的城乡居民最低生活保障制度的设想。 相似文献