全文获取类型
收费全文 | 11391篇 |
免费 | 49篇 |
国内免费 | 15篇 |
专业分类
管理学 | 1614篇 |
劳动科学 | 2篇 |
民族学 | 111篇 |
人才学 | 1篇 |
人口学 | 2461篇 |
丛书文集 | 86篇 |
理论方法论 | 544篇 |
综合类 | 738篇 |
社会学 | 4609篇 |
统计学 | 1289篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 21篇 |
2021年 | 33篇 |
2020年 | 29篇 |
2019年 | 35篇 |
2018年 | 1696篇 |
2017年 | 1681篇 |
2016年 | 1105篇 |
2015年 | 71篇 |
2014年 | 97篇 |
2013年 | 141篇 |
2012年 | 401篇 |
2011年 | 1201篇 |
2010年 | 1088篇 |
2009年 | 832篇 |
2008年 | 868篇 |
2007年 | 1055篇 |
2006年 | 48篇 |
2005年 | 276篇 |
2004年 | 288篇 |
2003年 | 231篇 |
2002年 | 105篇 |
2001年 | 33篇 |
2000年 | 18篇 |
1999年 | 8篇 |
1998年 | 3篇 |
1997年 | 9篇 |
1996年 | 31篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 10篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
181.
制约县域经济发展的因素分析与对策建议 总被引:1,自引:1,他引:1
梅迪 《辽东学院学报(社会科学版)》2004,6(5):61-64
以县级行政区划为单位的县域经济是我国国民经济的基础,是建设小康社会的主战场。我国目前县域经济发展缓慢,已成为宏观经济可持续发展的瓶颈。虽然制约县域经济发展的障碍因素较多,本文仅从经济体制、行政体制、财政体制、金融体制、相关政策制度等方面进行分析,提出改革和完善体制、推行"一主三化"发展战略和制订各县域特色经济总体规划的对策建议。 相似文献
182.
Mariacristina Piva Massimiliano Tani Marco Vivarelli 《Journal of population economics》2018,31(4):1321-1338
We investigate whether labor mobility can be a distinct source of growth by studying the productivity impact of business visits (BVs), vis-à-vis that of other well-known drivers of productivity enhancement. Our analysis uses an unbalanced panel—covering on average 16 sectors per year in ten countries during the period 1998–2011—which combines unique and novel data on BVs sourced from the US National Business Travel Association with Organization for Economic Cooperation and Development (OECD) data on R&D and capital formation. We find that mobility through BVs is an effective mechanism to improve productivity, being about half that obtained by investing in R&D. This relevant finding invites viewing short-term mobility as a strategic mechanism and prospective policy tool to overcome productivity slowdowns and foster economic growth. 相似文献
183.
Lingxin Hao Nan M. Astone Andrew J. Cherlin 《Population research and policy review》2007,26(3):235-257
This paper is an assessment of the impact of child support enforcement and welfare policies on nonmarital teenage childbearing
and motherhood. We derive four hypotheses about the effects of policies on nonmarital teenage childbearing and motherhood.
We propose that teenage motherhood and school enrollment are joint decisions for teenage girls. Based on individual trajectories
during ages 12–19, our analysis uses an event history model for nonmarital teenage childbearing and a dynamic model of motherhood
that is jointly determined with school enrollment. We find some evidence that child support policies indirectly reduce teen
motherhood by increasing the probability of school enrollment, which, in turn, reduces the probability of teen motherhood.
This finding suggests that welfare offices may wish to place greater weight on outreach programs that inform more teenagers
of the existence of strong child support enforcement measures. Such programs might reduce nonmarital teen motherhood further
and thus reduce the need for welfare support and child support enforcement in the long run.
相似文献
Lingxin HaoEmail: |
184.
We study uniqueness of Nash equilibria in atomic splittable congestion games and derive a uniqueness result based on polymatroid theory: when the strategy space of every player is a bidirectional flow polymatroid, then equilibria are unique. Bidirectional flow polymatroids are introduced as a subclass of polymatroids possessing certain exchange properties. We show that important cases such as base orderable matroids can be recovered as a special case of bidirectional flow polymatroids. On the other hand we show that matroidal set systems are in some sense necessary to guarantee uniqueness of equilibria: for every atomic splittable congestion game with at least three players and non-matroidal set systems per player, there is an isomorphic game having multiple equilibria. Our results leave a gap between base orderable matroids and general matroids for which we do not know whether equilibria are unique. 相似文献
185.
Corinna Gottschalk Hendrik Lüthen Britta Peis Andreas Wierz 《Journal of Combinatorial Optimization》2018,36(3):861-870
In 1984, Gabow and Tarjan provided a very elegant and fast algorithm for the following problem: given a matroid defined on a red and blue colored ground set, determine a basis of minimum cost among those with k red elements, or decide that no such basis exists. In this paper, we investigate extensions of this problem from ordinary matroids to the more general notion of poset matroids which take precedence constraints on the ground set into account. We show that the problem on general poset matroids becomes -hard, already if the underlying partially ordered set (poset) consists of binary trees of height two. On the positive side, we present two algorithms: a pseudopolynomial one for integer polymatroids, i.e., the case where the poset consists of disjoint chains, and a polynomial algorithm for the problem to determine a minimum cost ideal of size l with k red elements, i.e., the uniform rank-l poset matroid, on series-parallel posets. 相似文献
186.
In the facility location game on a line, there are some agents who have fixed locations on the line where an obnoxious facility will be placed. The objective is to maximize the social welfare, e.g., the sum of distances from the facility to all agents. On collecting location information, agents may misreport the locations so as to stay far away from the obnoxious facility. In this paper, strategy-proof mechanisms are designed and the approximation ratio is used to measure the performances of the strategy-proof mechanisms. Two objective functions, maximizing the sum of squares of distances (maxSOS) and maximizing the sum of distances (maxSum), have been considered. For maxSOS, a randomized 5/3-approximated strategy-proof mechanism is proposed, and the lower bound of the approximation ratio is proved to be at least 1.042. For maxSum, the lower bound of the approximation ratio of the randomized strategy-proof mechanism is proved to be 1.077. Moreover, a general model is considered that each agent may have multiple locations on the line. For the objective functions maxSum and maxSOS, both deterministic and randomized strategy-proof mechanisms are investigated, and the deterministic mechanisms are shown to be best possible. 相似文献
187.
This paper studies the large-scale stochastic job shop scheduling problem with general number of similar jobs, where the processing times of the same step are independently drawn from a known probability distribution, and the objective is to minimize the makespan. For the stochastic problem, we introduce the fluid relaxation of its deterministic counterpart, and define a fluid schedule for the fluid relaxation. By tracking the fluid schedule, a policy is proposed for the stochastic job shop scheduling problem. The expected value of the gap between the solution produced by the policy and the optimal solution is proved to be O(1), which indicates the policy is asymptotically optimal in expectation. 相似文献
188.
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)\). 相似文献
189.
Francesca Manes-Rossi Alessandra Allini Rosanna Spanò Riccardo Macchioni 《Journal of Management and Governance》2018,22(4):947-979
This study focuses on the issues relating to the implementation of management accounting systems in complex settings such as archeological sites. The aim is to understand the conditions under which the implementation of performance management systems (PMS) may enable cultural organizations to fulfil their multiple objectives and the factors which play a crucial role in such dynamics. Focusing on the Herculaneum Conservation Project (HCP) the study explains how PMS came to be implemented having been made acceptable to all parties involved. The Middle Range Theory as developed by Broadbent and Laughlin (Accounting control and controlling accounting: interdisciplinary and critical perspectives, Bingley, Emerald, 2013) was utilized to explore how the PMS change took place in the HCP, and focus on the factors influencing this process. The findings reveal that the change in the PMS benefited from the involvement of a multidisciplinary Specialist Work Group. This involvement reduced the natural tendency to resist the forces of change and increased the commitment of the various groups of stakeholders to the new culture. The findings reveal how PMS were developed in the context of a multifaceted approach to change, allowing us to draw both theoretical and practical lessons that may be brought to bear in other complex contexts. 相似文献
190.
In a graph \(G=(V,E)\), a set \(D \subseteq V\) is said to be a dominating set of G if for every vertex \(u\in V{\setminus }D\), there exists a vertex \(v\in D\) such that \(uv\in E\). A secure dominating set of the graph G is a dominating set D of G such that for every \(u\in V{\setminus }D\), there exists a vertex \(v\in D\) such that \(uv\in E\) and \((D{\setminus }\{v\})\cup \{u\}\) is a dominating set of G. Given a graph G and a positive integer k, the secure domination problem is to decide whether G has a secure dominating set of cardinality at most k. The secure domination problem has been shown to be NP-complete for chordal graphs via split graphs and for bipartite graphs. In Liu et al. (in: Proceedings of 27th workshop on combinatorial mathematics and computation theory, 2010), it is asked to find a polynomial time algorithm for computing a minimum secure dominating set in a block graph. In this paper, we answer this by presenting a linear time algorithm to compute a minimum secure dominating set in block graphs. We then strengthen the known NP-completeness of the secure domination problem by showing that the secure domination problem is NP-complete for undirected path graphs and chordal bipartite graphs. 相似文献