全文获取类型
收费全文 | 2508篇 |
免费 | 81篇 |
国内免费 | 42篇 |
专业分类
管理学 | 457篇 |
民族学 | 3篇 |
人口学 | 3篇 |
丛书文集 | 78篇 |
理论方法论 | 13篇 |
综合类 | 948篇 |
社会学 | 18篇 |
统计学 | 1111篇 |
出版年
2024年 | 8篇 |
2023年 | 12篇 |
2022年 | 40篇 |
2021年 | 25篇 |
2020年 | 36篇 |
2019年 | 67篇 |
2018年 | 71篇 |
2017年 | 128篇 |
2016年 | 80篇 |
2015年 | 75篇 |
2014年 | 82篇 |
2013年 | 327篇 |
2012年 | 166篇 |
2011年 | 117篇 |
2010年 | 106篇 |
2009年 | 93篇 |
2008年 | 129篇 |
2007年 | 143篇 |
2006年 | 136篇 |
2005年 | 125篇 |
2004年 | 113篇 |
2003年 | 83篇 |
2002年 | 71篇 |
2001年 | 64篇 |
2000年 | 72篇 |
1999年 | 56篇 |
1998年 | 39篇 |
1997年 | 29篇 |
1996年 | 30篇 |
1995年 | 22篇 |
1994年 | 17篇 |
1993年 | 10篇 |
1992年 | 24篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1981年 | 2篇 |
排序方式: 共有2631条查询结果,搜索用时 31 毫秒
171.
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present,
is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD), calls for a largest collection of edge disjoint cycles in a suitably-defined graph. It has been shown that for almost all instances SBR is equivalent to BGD, in the sense that any solution of the latter corresponds to a solution of the former having the same value. In this paper, we show how to improve the approximation ratio achievable in polynomial time for BGD, from the previously known
to
for any > 0. Combined with the results in (Caprara, Journal of Combinatorial Optimization, vol. 3, pp. 149–182, 1999b), this yields the same approximation guarantee for n! – O((n – 5)!) out of the n! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield an automatic improvement of our result. 相似文献
172.
Yoshiyuki Kusakari Daisuke Masubuchi Takao Nishizeki 《Journal of Combinatorial Optimization》2001,5(2):249-266
Let G = (V,E) be a plane graph with nonnegative edge weights, and let
be a family of k vertex sets
, called nets. Then a noncrossing Steiner forest for
in G is a set
of k trees
in G such that each tree
connects all vertices, called terminals, in net N
i, any two trees in
do not cross each other, and the sum of edge weights of all trees is minimum. In this paper we give an algorithm to find a noncrossing Steiner forest in a plane graph G for the case where all terminals in nets lie on any two of the face boundaries of G. The algorithm takes time
if G has n vertices and each net contains a bounded number of terminals. 相似文献
173.
数字签名技术的研究与探讨 总被引:2,自引:0,他引:2
李永新 《绍兴文理学院学报》2003,23(7):47-49
通过对对称加密体制、非对称加密体制以及Hash算法的分析,根据数字签名的要求,给出了一种具有防伪、防赖及保密的数字签名技术. 相似文献
174.
The problem of computing the strength and performing optimal reinforcement for an edge-weighted graph G(V, E, w) is well-studied. In this paper, we present fast (sequential linear time and parallel logarithmic time) on-line algorithms for optimally reinforcing the graph when the reinforcement material is available continuously on-line. These are the first on-line algorithms for this problem. We invest O(|V|3|E|log|V|) time (equivalent to (|V|) invocations of the fastest known algorithms for optimal reinforcement) in preprocessing the graph before the start of our algorithms. It is shown that the output of our on-line algorithms is as good as that of the off-line algorithms. Thus our algorithms are better than the fastest off-line algorithms in situations when a sequence of more than (|V|) reinforcement problems need to be solved. The key idea is to make use of ideas underlying the theory of Principal Partition of a Graph. Our ideas are easily generalized to the general setting of polymatroid functions. We also present a new efficient algorithm for computation of the Principal Sequence of a graph. 相似文献
175.
As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l
1 or l
norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l
1 and l
norms. It has been proved that the inverse maximum-weight perfect matching under l
norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l
1 norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l
1 and l
norms are solvable in polynomial time. 相似文献
176.
177.
动态共乘作为一种配合解决城市交通出行难题的新模式近年来引起了人们越来越多的关注,然而在较大范围内选择合适的乘客,以便获得最佳的综合服务效果却具有相当大的挑战性。本文正是针对这一问题,建立了以乘客效用最大化和司机总行程最短为目标函数,以满足司机与乘客的时间要求和司机参与约束为限制条件的多目标0-1规划共乘模型,用于帮助司机选择最合适的乘客。根据该模型的特点,构造了加入了分散搜索机制的新的和声搜索算法。在仿真实验时,针对司机和乘客效用的两种产生方式,在较大规模的路网环境下利用该算法分别对模型进行了求解,得到了Pareto最优解集。仿真结果不仅表明了模型的合理性和算法的可行性,而且还指出基于效用函数可以发现更多合适的潜在乘客。最后,通过与文献中其它算法的对比进一步展示了本文算法的有效性。 相似文献
178.
考虑到灾后路网受损难以运输应急物资,本文研究了应急响应中车辆-直升机联合调度的路径优化问题。针对受灾地区的实时路况,通往灾区的救援工具受到数量以及装载量的约束,本文将受灾点等待救援的平均时间最短以及应急网络总费用最低设为目标,构建运力受限条件下带通行约束的救援物资联合运输多目标优化模型,然后根据随机邻域搜索变异和分级交叉的思想构建出一种带精英策略的非支配排序混合进化算法(NSHEA-II)得到模型的解,并利用算例分析对该算法进行可行性检验。结果发现,本文构建的NSHEA-II算法相对NSGA-II算法能够得到较好的结果且波动性较小,这为决策者制定救援物资的配送方案提供有效的技术支撑。 相似文献
179.
不确定环境中,项目进度计划鲁棒性的高低直接影响项目能否顺利实施。本文研究了具有随机活动工期的柔性资源约束下的前摄性项目调度优化问题,目标是在柔性资源和项目工期的约束下,借助对活动开始时间合理的进行安排进而得到拥有最大鲁棒性的进度计划。首先对研究问题进行界定;随后构建优化模型,并根据问题NP-hard属性和模型特点设计了双层嵌套禁忌搜索启发式算法,通过内外两层交互搜索寻找满意解;最后通过一个实际案例对本文研究进行说明,并分析关键参数对进度计划鲁棒性的影响,得到如下结论:相对于资源无柔性情况下的项目进度计划而言,资源具备柔性后得到的项目进度计划的鲁棒性更高,具有更强的抗干扰能力,能够保证项目稳定执行;同时,项目进度计划鲁棒性分别随着项目工期的延长、资源可用量的增加或资源柔性的提高而上升。 相似文献
180.
The theory and properties of trend-free (TF) and nearly trend-free (NTF) block designs are wel1 developed. Applications have been hampered because a methodology for design construction has not been available. This article begins with a short review of concepts and properties of TF and NTF block designs. The major contribution is provision of an algorithm for the construction of linear and nearly linear TF block designs. The algorithm is incorporated in a computer program in FORTRAN 77 provided in an appendix for the IBM PC or compatible microcomputer, a program adaptable also to other computers. Three sets of block designs generated by the program are given as examples. A numerical example of analysis of a linear trend-free balanced incomplete block design is provided. 相似文献