全文获取类型
收费全文 | 13657篇 |
免费 | 636篇 |
国内免费 | 645篇 |
专业分类
化学 | 636篇 |
晶体学 | 4篇 |
力学 | 355篇 |
综合类 | 102篇 |
数学 | 7789篇 |
物理学 | 514篇 |
综合类 | 5538篇 |
出版年
2024年 | 32篇 |
2023年 | 77篇 |
2022年 | 161篇 |
2021年 | 181篇 |
2020年 | 202篇 |
2019年 | 189篇 |
2018年 | 190篇 |
2017年 | 251篇 |
2016年 | 271篇 |
2015年 | 264篇 |
2014年 | 577篇 |
2013年 | 629篇 |
2012年 | 704篇 |
2011年 | 634篇 |
2010年 | 572篇 |
2009年 | 753篇 |
2008年 | 780篇 |
2007年 | 902篇 |
2006年 | 661篇 |
2005年 | 676篇 |
2004年 | 558篇 |
2003年 | 516篇 |
2002年 | 487篇 |
2001年 | 429篇 |
2000年 | 446篇 |
1999年 | 349篇 |
1998年 | 322篇 |
1997年 | 305篇 |
1996年 | 322篇 |
1995年 | 294篇 |
1994年 | 262篇 |
1993年 | 241篇 |
1992年 | 254篇 |
1991年 | 220篇 |
1990年 | 173篇 |
1989年 | 140篇 |
1988年 | 167篇 |
1987年 | 98篇 |
1986年 | 106篇 |
1985年 | 119篇 |
1984年 | 84篇 |
1983年 | 22篇 |
1982年 | 51篇 |
1981年 | 38篇 |
1980年 | 35篇 |
1979年 | 28篇 |
1978年 | 49篇 |
1977年 | 48篇 |
1976年 | 27篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
Outsourcing is a good strategy for firms that need to reduce operating costs and improve competitiveness and it is important that firms scientifically select appropriate outsourcing providers. Some efforts have been made to find systematic ways to deal with outsourcing problems, but these efforts incorrectly assumed that the criteria used in the decision process are independent, which is not true in the real world. In this study, we propose a new hybrid multiple criteria decision-making (MCDM) model, which addresses the dependent relationships between the various criteria. The relations-structure among the criteria is built with the aid of the decision-making trial and evaluation laboratory (DEMATEL) method. Decision-makers tend to hold diverse opinions about their preferences due to incomplete information and knowledge, or inherent conflict between various departments. We further used the fuzzy preference programming and the analytic network process (ANP) to form a model for the selection of partners for outsourcing providers. The proposed model can help practitioners improve their decision making process, especially when criteria are numerous and inter-related. The method is demonstrated using data from a Taiwanese airline. 相似文献
952.
This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the route. The mathematical formulation modifies and exploits the structure of linear programming problems designed for the traveling salesman problem. An innovative divide-and-conquer solution procedure is presented that not only makes the transit routing problem tractable, but also provides a range of high-quality alternate routes for consideration, some of which have substantially varying geometries. Variant formulations are provided for several common transit route types. The model is tested through its application to an existing street network in Richardson, TX. Optimal numeric results are obtained for several problem instances, and these results demonstrate that increased route cost is not correlated with increased service provision. 相似文献
953.
The paper formulates an extension of the traveling purchaser problem where multiple types of commodities are sold at spatially distributed locations with stochastic prices (each following a known probability distribution). A purchaser’s goal is to find the optimal routing and purchasing strategies that minimize the expected total travel and purchasing costs needed to purchase one unit of each commodity. The purchaser reveals the actual commodity price at a seller upon arrival, and then either purchases the commodity at the offered price, or rejects the price and visits a next seller. In this paper, we propose an exact solution algorithm based on dynamic programming, an iterative approximate algorithm that yields bounds for the minimum total expected cost, and a greedy heuristic for fast solutions to large-scale applications. We analyze the characteristics of the problem and test the computational performance of the proposed algorithms. The numerical results show that the approximate and heuristic algorithms yield near-optimum strategies and very good estimates of the minimum total cost. 相似文献
954.
This paper presents a model of lead-time policies for a production system, such as an integrated steel mill, in which the bottleneck process requires a minimum batch size. An accurate understanding of internal lead-time quotations is necessary for making good customer delivery-date promises, which must take into account processing time, queueing time and time for arrival of the requisite volume of orders to complete the minimum batch size requirement. The problem is modeled as a stochastic dynamic program with a large state space. A computational study demonstrates that lead time for an arriving order should generally be a decreasing function of the amount of that product already on order (and waiting for minimum batch size to accumulate), which leads to a very fast and accurate heuristic. The computational study also provides insights into the relationship between lead-time quotation, arrival rate, and the sensitivity of customers to the length of delivery promises. 相似文献
955.
The objective in designing a communications network is to find the most cost efficient network design that specifies hardware devices to be installed, the type of transmission links to be installed, and the routing strategy to be followed. In this paper algorithmic ideas are presented for improving tractability in solving the survivable network design problem by taking into account uncertainty in the traffic requirements. Strategies for improving separation of metric inequalities are presented and an iterative approach for obtaining solutions, that significantly reduces computing times, is introduced. Computational results are provided based on data collected from an operational network. 相似文献
956.
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not account for driving hours regulations, which restrict the available travel time for truck drivers. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing of a VRPTW. We propose an ILP formulation that minimizes the total duty time. The results of a case study indicate that duty time reductions of 15% can be achieved. Furthermore, computational experiments on VRPTW benchmarks indicate that ignoring traffic congestion or driving hours regulations leads to practically infeasible solutions. Therefore, new vehicle routing methods should be developed that account for these common restrictions. We propose an integrated approach based on classical insertion heuristics. 相似文献
957.
Given a connected graph G = (N, E) with node weights s∈? and nonnegative edge lengths, we study the following embedding problem related to an eigenvalue optimization problem over the second smallest eigenvalue of the (scaled) Laplacian of G: Find vi∈?|N|, i∈N so that distances between adjacent nodes do not exceed prescribed edge lengths, the weighted barycenter of all points is at the origin, and is maximized. In the case of a two‐dimensional optimal solution this corresponds to the equilibrium position of a quickly rotating net consisting of weighted mass points that are linked by massless cables of given lengths. We define the rotational dimension of G to be the minimal dimension k so that for all choices of lengths and weights an optimal solution can be found in ?k and show that this is a minor monotone graph parameter. We give forbidden minor characterizations up to rotational dimension 2 and prove that the rotational dimension is always bounded above by the tree‐width of G plus one. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:283‐302, 2011 相似文献
958.
In this paper, we give several results of learning errors for linear programming support vector regression. The corresponding theorems are proved in the reproducing kernel Hilbert space. With the covering number, the approximation property and the capacity of the reproducing kernel Hilbert space are measured. The obtained result (Theorem 2.1) shows that the learning error can be controlled by the sample error and regularization error. The mentioned sample error is summarized by the errors of learning regression function and regularizing function in the reproducing kernel Hilbert space. After estimating the generalization error of learning regression function (Theorem 2.2), the upper bound (Theorem 2.3) of the regularized learning algorithm associated with linear programming support vector regression is estimated. 相似文献
959.
J. G. Ecker M. Kupferschmid R. S. Sacher 《Journal of Optimization Theory and Applications》1984,43(2):237-263
We study the performance of four general-purpose nonlinear programming algorithms and one special-purpose geometric programming algorithm when used to solve geometric programming problems. Experiments are reported which show that the special-purpose algorithm GGP often finds approximate solutions more quickly than the general-purpose algorithm GRG2, but is usually not significantly more efficient than GRG2 when greater accuracy is required. However, for some of the most difficult test problems attempted, GGP was dramatically superior to all of the other algorithms. The other algorithms are usually not as efficient as GGP or GRG2. The ellipsoid algorithm is most robust.This work was supported in part by the National Science Foundation, Grant No. MCS-81-02141. 相似文献
960.
Preface to topics in data envelopment analysis 总被引:7,自引:0,他引:7
This paper serves as an introduction to a series of three papers which are directed to different aspects of DEA (Data Envelopment Analysis) as follows: (1) uses and extensions of window analyses' to study DEA efficiency measures with an illustrative applications to maintenance activities for U.S. Air Force fighter wings, (2) a comparison of DEA and regression approaches to identifying and estimating, sources of inefficiency by means of artificially generated data, and (3) an extension of ordinary (linear programming) sensitivity analyses to deal with special features that require attention in DEA. Background is supplied in this introductory paper with accompanying proofs and explanations to facilitate understanding of what DEA provides in the way of underpinning for the papers that follow. An attempt is made to bring readers abreast of recent progress in DEA research and uses. A synoptic history is presented along with brief references to related work, and problems requiring attention are also indicated and possible research approaches also suggested.This research was partly supported by the National Science Foundation and USARI Contract MDA 903-83-K0312, with the Center for Cybernetic Studies, the University of Texas at Austin. It was also partly supported by the IC2 Institute at the University of Texas at Austin. Reproduction in whole or in part is permitted for any purpose of the U.S. Government. 相似文献