全文获取类型
收费全文 | 8037篇 |
免费 | 127篇 |
国内免费 | 1篇 |
专业分类
管理学 | 1131篇 |
民族学 | 47篇 |
人口学 | 674篇 |
丛书文集 | 25篇 |
理论方法论 | 699篇 |
综合类 | 75篇 |
社会学 | 3453篇 |
统计学 | 2061篇 |
出版年
2023年 | 46篇 |
2022年 | 27篇 |
2021年 | 51篇 |
2020年 | 119篇 |
2019年 | 186篇 |
2018年 | 195篇 |
2017年 | 293篇 |
2016年 | 202篇 |
2015年 | 147篇 |
2014年 | 215篇 |
2013年 | 1514篇 |
2012年 | 234篇 |
2011年 | 241篇 |
2010年 | 180篇 |
2009年 | 187篇 |
2008年 | 206篇 |
2007年 | 188篇 |
2006年 | 207篇 |
2005年 | 189篇 |
2004年 | 168篇 |
2003年 | 151篇 |
2002年 | 177篇 |
2001年 | 212篇 |
2000年 | 208篇 |
1999年 | 190篇 |
1998年 | 144篇 |
1997年 | 130篇 |
1996年 | 112篇 |
1995年 | 104篇 |
1994年 | 148篇 |
1993年 | 100篇 |
1992年 | 126篇 |
1991年 | 136篇 |
1990年 | 120篇 |
1989年 | 106篇 |
1988年 | 94篇 |
1987年 | 92篇 |
1986年 | 92篇 |
1985年 | 91篇 |
1984年 | 97篇 |
1983年 | 72篇 |
1982年 | 71篇 |
1981年 | 50篇 |
1980年 | 61篇 |
1979年 | 62篇 |
1978年 | 52篇 |
1977年 | 53篇 |
1976年 | 40篇 |
1975年 | 49篇 |
1974年 | 40篇 |
排序方式: 共有8165条查询结果,搜索用时 0 毫秒
991.
Peter K. Manning 《Qualitative sociology》1997,20(3):419-424
992.
993.
Fei-Huang Chang Hong-Bin Chen Frank K. Hwang 《Journal of Combinatorial Optimization》2014,27(3):567-573
A partition of a set of n points in d-dimensional space into p parts is called an (almost) separable partition if the convex hulls formed by the parts are (almost) pairwise disjoint. These two partition classes are the most encountered ones in clustering and other partition problems for high-dimensional points and their usefulness depends critically on the issue whether their numbers are small. The problem of bounding separable partitions has been well studied in the literature (Alon and Onn in Discrete Appl. Math. 91:39–51, 1999; Barnes et al. in Math. Program. 54:69–86, 1992; Harding in Proc. Edinb. Math. Soc. 15:285–289, 1967; Hwang et al. in SIAM J. Optim. 10:70–81, 1999; Hwang and Rothblum in J. Comb. Optim. 21:423–433, 2011a). In this paper, we prove that for d≤2 or p≤2, the maximum number of almost separable partitions is equal to the maximum number of separable partitions. 相似文献
994.
Let k be a positive integer and G=(V,E) be a graph. A vertex subset D of a graph G is called a perfect k-dominating set of G, if every vertex v of G, not in D, is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k-dominating set of G is the perfect k-domination number γ kp (G). In this paper, we give characterizations of graphs for which γ kp (G)=γ(G)+k?2 and prove that the perfect k-domination problem is NP-complete even when restricted to bipartite graphs and chordal graphs. Also, by using dynamic programming techniques, we obtain an algorithm to determine the perfect k-domination number of trees. 相似文献
995.
The need to integrate adaptation efforts into land-use planning policies has been only recently recognized in Ho Chi Minh City. The city's latest planning guidance addresses both flooding resilience and mitigation of urban heat. This paper outlines the development contexts and the current barriers for adapted land-use planning within the city. The key challenge for land-use planning is communicating the important functions and services of open and natural urban spaces and effectively guiding the mainly individual developer-driven development. As the realization of non-structural adaptation measures is in strong contrast to the current market-driven private and short-term developer interests, the main development trajectories are questioned and synergies identified. 相似文献
996.
997.
998.
999.
Summary This paper presents findings from tbe National Child DevelopmentStudy which examine the relationship between size of familyand school attainment, adjustment and height at the age of eleven.This relationship is shown to be a strong one, and alternativeexplanations for its existence are considered 相似文献
1000.