全文获取类型
收费全文 | 2058篇 |
免费 | 14篇 |
国内免费 | 19篇 |
专业分类
管理学 | 312篇 |
民族学 | 18篇 |
人口学 | 390篇 |
丛书文集 | 12篇 |
理论方法论 | 104篇 |
综合类 | 181篇 |
社会学 | 837篇 |
统计学 | 237篇 |
出版年
2023年 | 8篇 |
2022年 | 2篇 |
2020年 | 11篇 |
2019年 | 15篇 |
2018年 | 33篇 |
2017年 | 61篇 |
2016年 | 96篇 |
2015年 | 31篇 |
2014年 | 22篇 |
2013年 | 68篇 |
2012年 | 175篇 |
2011年 | 143篇 |
2010年 | 36篇 |
2009年 | 18篇 |
2008年 | 37篇 |
2007年 | 29篇 |
2006年 | 28篇 |
2005年 | 572篇 |
2004年 | 292篇 |
2003年 | 160篇 |
2002年 | 44篇 |
2001年 | 87篇 |
2000年 | 36篇 |
1999年 | 4篇 |
1998年 | 10篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 11篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 3篇 |
1966年 | 2篇 |
1964年 | 2篇 |
排序方式: 共有2091条查询结果,搜索用时 0 毫秒
81.
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. 相似文献
82.
We consider dynamic routing of broadcast connections in WDM optical networks. Given the current network state, we want to find a minimum set of network nodes S such that a broadcast routing using only the nodes in S as wavelength conversion nodes can be found. This ensures that the average conversion delay from the source to all destinations is minimized. We refer to the problem as Broadcast Conversion Node Selection (BCNS) problem. We prove that BCNS has no polynomial-time approximation with performance ratio ln n for < 1 unless NPDTIME(nO(log log n)) where n is the number of vertices in the input graph. We present a greedy approximation algorithm for BCNS that achieves approximation ratio 2+ln n. Simulation results show that the algorithm performs very well in practice, obtaining optimal solutions in most of the cases. 相似文献
83.
Tak-Wah?LamEmail author Tusen-Wan?Johnny?Ngan Kar-Keung?To 《Journal of Combinatorial Optimization》2005,9(2):157-165
This paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm. Nevertheless, recent work has revealed that some online algorithms using a moderately faster processor (or extra processors) can guarantee very competitive performance Kalyanasundaram and Pruhs, 2000 or even be 1-competitive Koo et al., 2002; Lam and To, 2001. This paper takes a further step to investigate online scheduling algorithms with an even higher performance guarantee (i.e., better than 1-competitive algorithms) and in particular, presents an extra-resource analysis of the earliest-deadline-first strategy (EDF) with respect to such a higher performance guarantee.A preliminary version of this paper has been accepted by The Australian Theory Symposium on Computing, 2004.This research was supported in part by Hong Kong RGC Grant HKU-7024/01E. 相似文献
84.
Stanislav?BusyginEmail author Oleg?A.?Prokopyev Panos?M.?Pardalos 《Journal of Combinatorial Optimization》2005,10(1):7-21
Biclustering consists in simultaneous partitioning of the set of samples and the set of their attributes (features) into subsets (classes). Samples and features classified together are supposed to have a high relevance to each other which can be observed by intensity of their expressions. We define the notion of consistency for biclustering using interrelation between centroids of sample and feature classes. We prove that consistent biclustering implies separability of the classes by convex cones. While previous works on biclustering concentrated on unsupervised learning and did not consider employing a training set, whose classification is given, we propose a model for supervised biclustering, whose consistency is achieved by feature selection. The developed model involves solution of a fractional 0–1 programming problem. Preliminary computational results on microarray data mining problems are reported.This research work was partially supported by NSF, NIH and AirForce grants. 相似文献
85.
Binwu?Zhang Jianzhong?ZhangEmail author Yong?He 《Journal of Combinatorial Optimization》2005,9(2):187-198
In this paper, we consider the center location improvement problems under the sum-type and bottleneck-type Hamming distance. For the sum-type problem, we show that achieving an algorithm with a worst-case ratio of O(log |V|) is NP-hard, and for the bottleneck-type problem, we present a strongly polynomial algorithm. 相似文献
86.
Gary?KochenbergerEmail author Fred?Glover Bahram?Alidaee Haibo?Wang 《Journal of Combinatorial Optimization》2005,10(1):77-92
Microarrays are repositories of gene expression data that hold tremendous potential for new understanding, leading to advances in functional genomics and molecular biology. Cluster analysis (CA) is an early step in the exploration of such data that is useful for purposes of data reduction, exposing hidden patterns, and the generation of hypotheses regarding the relationship between genes and phenotypes. In this paper we present a new model for the clique partitioning problem and illustrate how it can be used to perform cluster analysis in this setting. 相似文献
87.
88.
89.
90.
Information and communication technologies (ICTs) are increasingly pervasive and continue to reshape our environment. This trend carries different risks. Therefore, the early sensitization of people to these risks, as well as improving their capacity for protective coping behavior, is essential. Based on the protection motivation theory (PMT), we examined with structural equation modeling the relationships between different components of threat and coping appraisal to explain protective and nonprotective responses. Calculations were performed with data from a representative survey on perception and use of ICT among German residents (N= 5,030). Our findings largely supported the proposed model: an increased perceived threat was positively related to the intentions to react protectively and nonprotectively. Perceived coping efficacy increased the protective and decreased the nonprotective responses. Negative affect enhanced the perceived threat and the nonprotective response, but inhibited protective intentions. The implications of these findings on how to sensitize people to the risks of these new technologies are outlined. 相似文献