全文获取类型
收费全文 | 28497篇 |
免费 | 295篇 |
国内免费 | 2篇 |
专业分类
管理学 | 3839篇 |
民族学 | 181篇 |
人才学 | 3篇 |
人口学 | 3922篇 |
丛书文集 | 78篇 |
理论方法论 | 2083篇 |
综合类 | 440篇 |
社会学 | 12694篇 |
统计学 | 5554篇 |
出版年
2023年 | 95篇 |
2022年 | 88篇 |
2021年 | 107篇 |
2020年 | 277篇 |
2019年 | 371篇 |
2018年 | 2050篇 |
2017年 | 2237篇 |
2016年 | 1468篇 |
2015年 | 382篇 |
2014年 | 505篇 |
2013年 | 3479篇 |
2012年 | 919篇 |
2011年 | 1591篇 |
2010年 | 1426篇 |
2009年 | 1120篇 |
2008年 | 1192篇 |
2007年 | 1343篇 |
2006年 | 428篇 |
2005年 | 620篇 |
2004年 | 571篇 |
2003年 | 527篇 |
2002年 | 446篇 |
2001年 | 496篇 |
2000年 | 469篇 |
1999年 | 432篇 |
1998年 | 321篇 |
1997年 | 282篇 |
1996年 | 331篇 |
1995年 | 276篇 |
1994年 | 322篇 |
1993年 | 252篇 |
1992年 | 309篇 |
1991年 | 326篇 |
1990年 | 294篇 |
1989年 | 266篇 |
1988年 | 275篇 |
1987年 | 254篇 |
1986年 | 220篇 |
1985年 | 250篇 |
1984年 | 258篇 |
1983年 | 218篇 |
1982年 | 184篇 |
1981年 | 139篇 |
1980年 | 149篇 |
1979年 | 172篇 |
1978年 | 139篇 |
1977年 | 119篇 |
1976年 | 93篇 |
1975年 | 104篇 |
1974年 | 104篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Marin Bougeret Guillerme Duvillié Rodolphe Giroudeau 《Journal of Combinatorial Optimization》2018,36(3):1059-1073
In this paper we consider the multidimensional binary vector assignment problem. An input of this problem is defined by m disjoint multisets \(V^1, V^2, \ldots , V^m\), each composed of n binary vectors of size p. An output is a set of n disjoint m-tuples of vectors, where each m-tuple is obtained by picking one vector from each multiset \(V^i\). To each m-tuple we associate a p dimensional vector by applying the bit-wise AND operation on the m vectors of the tuple. The objective is to minimize the total number of zeros in these n vectors. We denote this problem by Open image in new window , and the restriction of this problem where every vector has at most c zeros by Open image in new window . Open image in new window was only known to be Open image in new window -hard, even for Open image in new window . We show that, assuming the unique games conjecture, it is Open image in new window -hard to Open image in new window -approximate Open image in new window for any fixed Open image in new window and Open image in new window . This result is tight as any solution is a Open image in new window -approximation. We also prove without assuming UGC that Open image in new window is Open image in new window -hard even for Open image in new window . Finally, we show that Open image in new window is polynomial-time solvable for fixed Open image in new window (which cannot be extended to Open image in new window ). 相似文献
992.
An oriented graph \(G^\sigma \) is a digraph without loops or multiple arcs whose underlying graph is G. Let \(S\left( G^\sigma \right) \) be the skew-adjacency matrix of \(G^\sigma \) and \(\alpha (G)\) be the independence number of G. The rank of \(S(G^\sigma )\) is called the skew-rank of \(G^\sigma \), denoted by \(sr(G^\sigma )\). Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that \(sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)\), where \(|V_G|\) is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for \(sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)\), \(sr(G^\sigma )/\alpha (G)\) and characterize all corresponding extremal graphs. 相似文献
993.
Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount. 相似文献
994.
A 2-distance k-coloring of a graph G is a proper k-coloring such that any two vertices at distance two get different colors. \(\chi _{2}(G)\)=min{k|G has a 2-distance k-coloring}. Wegner conjectured that for each planar graph G with maximum degree \(\Delta \), \(\chi _2(G) \le 7\) if \(\Delta \le 3\), \(\chi _2(G) \le \Delta +5\) if \(4\le \Delta \le 7\) and \(\chi _2(G) \le \lfloor \frac{3\Delta }{2}\rfloor +1\) if \(\Delta \ge 8\). In this paper, we prove that: (1) If G is a planar graph with maximum degree \(\Delta \le 5\), then \(\chi _{2}(G)\le 20\); (2) If G is a planar graph with maximum degree \(\Delta \ge 6\), then \(\chi _{2}(G)\le 5\Delta -7\). 相似文献
995.
A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete. 相似文献
996.
This paper studies the continuous connected 2-facility location problem (CC2FLP) in trees. Let \(T = (V, E, c, d, \ell , \mu )\) be an undirected rooted tree, where each node \(v \in V\) has a weight \(d(v) \ge 0\) denoting the demand amount of v as well as a weight \(\ell (v) \ge 0\) denoting the cost of opening a facility at v, and each edge \(e \in E\) has a weight \(c(e) \ge 0\) denoting the cost on e and is associated with a function \(\mu (e,t) \ge 0\) denoting the cost of opening a facility at a point x(e, t) on e where t is a continuous variable on e. Given a subset \(\mathcal {D} \subseteq V\) of clients, and a subset \(\mathcal {F} \subseteq \mathcal {P}(T)\) of continuum points admitting facilities where \(\mathcal {P}(T)\) is the set of all the points on edges of T, when two facilities are installed at a pair of continuum points \(x_1\) and \(x_2\) in \(\mathcal {F}\), the total cost involved in CC2FLP includes three parts: the cost of opening two facilities at \(x_1\) and \(x_2\), K times the cost of connecting \(x_1\) and \(x_2\), and the cost of all the clients in \(\mathcal {D}\) connecting to some facility. The objective is to open two facilities at a pair of continuum points in \(\mathcal {F}\) to minimize the total cost, for a given input parameter \(K \ge 1\). This paper focuses on the case of \(\mathcal {D} = V\) and \(\mathcal {F} = \mathcal {P}(T)\). We first study the discrete version of CC2FLP, named the discrete connected 2-facility location problem (DC2FLP), where two facilities are restricted to the nodes of T, and devise a quadratic time edge-splitting algorithm for DC2FLP. Furthermore, we prove that CC2FLP is almost equivalent to DC2FLP in trees, and develop a quadratic time exact algorithm based on the edge-splitting algorithm. Finally, we adapt our algorithms to the general case of \(\mathcal {D} \subseteq V\) and \(\mathcal {F} \subseteq \mathcal {P}(T)\). 相似文献
997.
Francisco J. Aragón Artacho Rubén Campoy Ilias Kotsireas Matthew K. Tam 《Journal of Combinatorial Optimization》2018,35(4):1061-1085
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas–Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices of circulant type, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a CW(126, 64) and a CW(198, 100), whose existence was previously marked as unresolved in the most recent version of Strassler’s table. 相似文献
998.
Qingsong Tang Xiangde Zhang Guoren Wang Cheng Zhao 《Journal of Combinatorial Optimization》2018,35(4):1250-1260
For a simple graph G on n vertices with adjacency matrix A, Motzkin and Strauss established a remarkable connection between the clique number and the global maximum value of the quadratic programm: \(\textit{max}\{ \mathbf {x}^T A \mathbf {x}\}\) on the standard simplex: \(\{\sum _{i=1}^{n} x_i =1, x_i \ge 0 \}\). In Gibbons et al. (Math Oper Res 122:754–768, 1997), an extension of the Motzkin–Straus formulation was provided for the vertex-weighted clique number of a graph. In this paper, we provide a continuous characterization of the maximum vertex-weighted clique problem for vertex-weighted uniform hypergraphs. 相似文献
999.
Ling Gai Hongwei Du Lidong Wu Junlei Zhu Yuehua Bu 《Journal of Combinatorial Optimization》2018,36(2):392-399
In this paper, a rumor blocking problem is studied with an objective function which is neither submodular or supermodular. We will prove that this problem is NP-hard and give a data-dependent approximation with sandwich method. In addition, we show that every set function has a pair of monotone nondecreasing modular functions as upper bound and lower bound, respectively. 相似文献
1000.
We investigate the reasons why “adoption” of one set of globally accepted accounting standards is presently unachievable. By “adoption” we mean that a jurisdiction incorporates IFRS instantly as its national accounting as issued by the IASB. We state that the IASB has used a Legitimacy Theory strategy to gain acceptance of its standards by more than 120 countries across the globe but it has only gained pseudo-“adoption” (not as published by the IASB) of its standards by many countries. We contend that achieving policing and enforcement of its standards globally has proven to be empirically illusive. This legitimacy deficit may explain why convergence between the IASB and FASB is currently idle. We offer a possible solution to bridging the legitimacy gap of global adoption of IFRS. We propose an internationally respected regulator and suggest the IOSCO for this role through its participation in the IFRS Foundation Monitoring Board for policing and enforcement of IFRS for cross-listed firms reporting in compliance with IFRS so that the IASB’s output legitimacy may be achieved globally. 相似文献