全文获取类型
收费全文 | 14713篇 |
免费 | 179篇 |
国内免费 | 39篇 |
专业分类
管理学 | 1664篇 |
劳动科学 | 7篇 |
民族学 | 159篇 |
人才学 | 17篇 |
人口学 | 2493篇 |
丛书文集 | 653篇 |
理论方法论 | 773篇 |
综合类 | 3301篇 |
社会学 | 4571篇 |
统计学 | 1293篇 |
出版年
2024年 | 4篇 |
2023年 | 10篇 |
2022年 | 60篇 |
2021年 | 58篇 |
2020年 | 48篇 |
2019年 | 36篇 |
2018年 | 1694篇 |
2017年 | 1723篇 |
2016年 | 1150篇 |
2015年 | 166篇 |
2014年 | 185篇 |
2013年 | 226篇 |
2012年 | 506篇 |
2011年 | 1402篇 |
2010年 | 1307篇 |
2009年 | 1019篇 |
2008年 | 1037篇 |
2007年 | 1236篇 |
2006年 | 188篇 |
2005年 | 426篇 |
2004年 | 422篇 |
2003年 | 520篇 |
2002年 | 598篇 |
2001年 | 425篇 |
2000年 | 227篇 |
1999年 | 63篇 |
1998年 | 23篇 |
1997年 | 26篇 |
1996年 | 50篇 |
1995年 | 20篇 |
1994年 | 14篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 7篇 |
1989年 | 6篇 |
1988年 | 12篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1982年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
751.
Cornelia Edding 《Organisationsberatung, Supervision, Coaching》2005,12(1):21-30
Supporting processes of belonging in supervision and coachingThe contemporary employee has to cope with frequent changes. Not only does he lose his familiar environment, he also has to find ways to familiarize himself with new places and to develop a fresh sense of belonging. This process can be understood and facilitated by interpreting the German concept of “Heimat“ as something we have to create ourselves. First experiences demonstrate the usefulness of this approach in coaching processes. 相似文献
752.
753.
In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight wj and a profit pj. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases
(profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of
the proposed algorithms are evaluated on a large number of problem instances. 相似文献
754.
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to be NP-complete for general graphs. Mahdian (Discret Appl Math 118:239–248, 2002) proved that it is in polynomial time for quadrilateral-free graphs and proposed an \(O(n^{11})\) algorithm for the same, here n is the number of vertices in the graph, (along with a note that by a straightforward but lengthy argument it can be proved to be solvable in \(O(n^5)\) running time). In this paper we propose an \(O(n^2)\) time algorithm for finding a maximum cardinality neighbourly set in a quadrilateral-free graph. 相似文献
755.
Andrzej Kozik 《Journal of Combinatorial Optimization》2017,33(2):445-472
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations of SP, we construct heuristic and metaheuristic algorithms for the multiprocessor job scheduling problem, and verify their efficiency in the numerical experiment. 相似文献
756.
Peter Brown Yuedong Yang Yaoqi Zhou Wayne Pullan 《Journal of Combinatorial Optimization》2017,33(2):551-566
The linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an \(n \times m, m \ge n\) benefit matrix \(B = (b_{ij})\), matching each row to a different column so that the sum of entries at the row-column intersections is maximised. This paper describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version (\(n \ne m\)) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment between two proteins, normally of different numbers of amino acids, needs to be maximised. 相似文献
757.
Cong Chen Yinfeng Xu Yuqing Zhu Chengyu Sun 《Journal of Combinatorial Optimization》2017,33(2):590-608
MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is \(\frac{m+m(\Psi (m)-\Psi (k))}{k+m(\Psi (m)-\Psi (k))}\), higher than the basic online machine scheduling problem, where k is the root of the equation \(k=\big \lfloor {\frac{m-k}{1+\Psi (m)-\Psi (k)}+1 }\big \rfloor \) and m is the quantity of machines. Then we devise an \((2-\frac{1}{m})\)-competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines. 相似文献
758.
Reuven Cohen Mira Gonen Asaf Levin Shmuel Onn 《Journal of Combinatorial Optimization》2017,33(2):645-659
In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands \(\{d_0,\dots ,d_{n-1}\}\) and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly \(d_i\) subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant). 相似文献
759.
Jueliang Hu Yiwei Jiang Ping Zhou An Zhang Qinghui Zhang 《Journal of Combinatorial Optimization》2017,33(3):866-881
This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \). 相似文献
760.
A class \(\mathcal{G}\) of simple graphs is said to be girth-closed (odd-girth-closed) if for any positive integer g there exists a graph \(\mathrm {G} \in \mathcal{G}\) such that the girth (odd-girth) of \(\mathrm {G}\) is \(\ge g\). A girth-closed (odd-girth-closed) class \(\mathcal{G}\) of graphs is said to be pentagonal (odd-pentagonal) if there exists a positive integer \(g^*\) depending on \(\mathcal{G}\) such that any graph \(\mathrm {G} \in \mathcal{G}\) whose girth (odd-girth) is greater than \(g^*\) admits a homomorphism to the five cycle (i.e. is \(\mathrm {C}_{_{5}}\)-colourable). Although, the question “Is the class of simple 3-regular graphs pentagonal?” proposed by Ne?et?il (Taiwan J Math 3:381–423, 1999) is still a central open problem, Gebleh (Theorems and computations in circular colourings of graphs, 2007) has shown that there exists an odd-girth-closed subclass of simple 3-regular graphs which is not odd-pentagonal. In this article, motivated by the conjecture that the class of generalized Petersen graphs is odd-pentagonal, we show that finding the odd girth of generalized Petersen graphs can be transformed to an integer programming problem, and using the combinatorial and number theoretic properties of this problem, we explicitly compute the odd girth of such graphs, showing that the class is odd-girth-closed. Also, we obtain upper and lower bounds for the circular chromatic number of these graphs, and as a consequence, we show that the subclass containing generalized Petersen graphs \(\mathrm {Pet}(n,k)\) for which either k is even, n is odd and \(n\mathop {\equiv }\limits ^{k-1}\pm 2\) or both n and k are odd and \(n\ge 5k\) is odd-pentagonal. This in particular shows the existence of nontrivial odd-pentagonal subclasses of 3-regular simple graphs. 相似文献