全文获取类型
收费全文 | 1632篇 |
免费 | 35篇 |
国内免费 | 27篇 |
专业分类
化学 | 393篇 |
晶体学 | 1篇 |
力学 | 101篇 |
综合类 | 3篇 |
数学 | 865篇 |
物理学 | 331篇 |
出版年
2023年 | 25篇 |
2022年 | 43篇 |
2021年 | 18篇 |
2020年 | 30篇 |
2019年 | 18篇 |
2018年 | 19篇 |
2017年 | 27篇 |
2016年 | 27篇 |
2015年 | 33篇 |
2014年 | 57篇 |
2013年 | 94篇 |
2012年 | 155篇 |
2011年 | 105篇 |
2010年 | 65篇 |
2009年 | 120篇 |
2008年 | 108篇 |
2007年 | 96篇 |
2006年 | 67篇 |
2005年 | 32篇 |
2004年 | 37篇 |
2003年 | 53篇 |
2002年 | 20篇 |
2001年 | 22篇 |
2000年 | 18篇 |
1999年 | 17篇 |
1998年 | 34篇 |
1997年 | 22篇 |
1996年 | 29篇 |
1995年 | 20篇 |
1994年 | 19篇 |
1993年 | 17篇 |
1992年 | 13篇 |
1991年 | 16篇 |
1990年 | 15篇 |
1989年 | 10篇 |
1988年 | 12篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 25篇 |
1984年 | 20篇 |
1983年 | 15篇 |
1982年 | 23篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 25篇 |
1977年 | 5篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有1694条查询结果,搜索用时 244 毫秒
101.
Johannes J. Schneider 《Physica A》2010,389(14):2816-2581
Some years ago, Bachem, Hochstättler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem. 相似文献
102.
For a signalized road network with expansions of link capacity, the maximum possible increase in travel demands is considered while total delays for travelers are minimized. Using the concept of reserve capacity of signal-controlled junctions, the problem of finding the maximum possible increase in travel demand and determining optimal link capacity expansions can be formulated as optimization programs. In this paper, we present a new solution approach for simultaneously solving the maximum increase in travel demands and minimizing total delays of travelers. A projected Quasi-Newton method is proposed to effectively solve this problem to the KKT points. Numerical computations and comparisons are made on real data signal-controlled networks where obtained results outperform traditional methods. 相似文献
103.
A groundwater management problem is presented involving pumping cost minimization with both well discharges and well locations as decision variables. A grid of candidate well locations is set up and optimal arrangements of wells are sought within this discrete space. A genetic algorithm approach is presented with the following particular features: (a) A suitable scaling is applied to the objective function in order to alleviate its regionally flat behavior. (b) No penalty functions are involved in constraint handling. Instead, the feasible region is transformed into a rectangular domain. The transformation introduced is proved to be bijective. (c) A binary representation of well configurations is presented and compared to a combinatorial one. The binary representation necessitates the introduction of specially designed genetic operators. Besides purely genetic algorithms, the concept of cellular automaton is introduced as the basis of an alternative formulation of the optimization problem. The lattice of the cellular automaton provides the discrete set of candidate well positions. The well configuration is represented by a group of agents occupying an equal number of lattice sites. The agents change positions as dictated by the structure of the automaton and, also, by an associated genetic algorithm, which directs the evolution of the whole scheme toward an optimal configuration. An improved performance of this approach is noted and discussed in comparison to the purely genetic algorithm schemes of the present work. A simulated annealing approach is also applied to the same problem for comparison purposes. Finally, a new and more efficient hybrid annealing–genetic approach is introduced and discussed. 相似文献
104.
Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality 总被引:2,自引:0,他引:2
Hanif D. Sherali Shivaram Subramanian G.V. Loganathan 《Journal of Global Optimization》2001,19(1):1-26
In this paper, we address the development of a global optimization procedure for the problem of designing a water distribution network, including the case of expanding an already existing system, that satisfies specified flow demands at stated pressure head requirements. The proposed approach significantly improves upon a previous method of Sherali et al. (1998) by way of adopting tighter polyhedral relaxations, and more effective partitioning strategies in concert with a maximal spanning tree-based branching variable selection procedure. Computational experience on three standard test problems from the literature is provided to evaluate the proposed procedure. For all these problems, proven global optimal solutions within a tolerance of 10–4% and/or within 1$ of optimality are obtained. In particular, the two larger instances of the Hanoi and the New York test networks are solved to global optimality for the very first time in the literature. A new real network design test problem based on the Town of Blacksburg Water Distribution System is also offered to be included in the available library of test cases, and related computational results are presented. 相似文献
105.
Summary The analytical roles of chromatographic variables (column length, etc.) can be soundly comprehended and compared in terms
of the precision (Φ) of measurements and efficiency (ϑ) of analysis which are described as Shannon information and information
flow, respectively. The φϑ plots of the optimization process and the information Φ transmitted by a single peak are useful
to understand the analytical structure of optimization. Variables treated here are mobile phase composition (X), column length
(L), mobile phase velocity rate (u), detection wavelength (λ) and plate number (N). 相似文献
106.
The modern business environment is highly unpredictable. An anticipation approach in a real case study is presented to cope with such instability and minimize the total inventory cost without stock-outs occurring and inventory capacity being exceeded. The anticipation concept is performed using simulation models supported by inventory control algorithms on a selected sample of representative items. The inventory control algorithms include Silver–Meal, Part period balancing, Least-unit cost, and Fuzzy inventory control algorithm based on fuzzy stock-outs, highest inventory level and total cost. Transportation cost is explicitly defined as a discrete function of shipment size. The algorithms are tested on historic data. Simulation results are presented and the risk of accepting them as reliable is discussed. The process of simulation model implementation is briefly discussed to further validate the model and train order managers to use the simulation model in their order placement process. 相似文献
107.
Wafa B.E. Al-Othman Haitham M.S. Lababidi Imad M. Alatiqi Khawla Al-Shayji 《European Journal of Operational Research》2008
A multi-period stochastic planning model has been developed and implemented for a supply chain network of a petroleum organization operating in an oil producing country under uncertain market conditions. The proposed supply chain network consists of all activities related to crude oil production, processing and distribution. Uncertainties were introduced in market demands and prices. A deterministic optimization model was first developed and tested. The impact of uncertainty on the supply chain was studied by performing a sensitivity analysis in which ±20% deviations were introduced in market demands and prices of different commodities. A stochastic formulation was then proposed, which is based on the two-stage problem with finite number of realizations. The proposed stochastic programming approach proved to be quite effective in developing resilient production plans in light of high degree of uncertainty in market conditions. The anticipated production plans have a considerably lower expected value of perfect information (EVPI). The main conclusion of this study is that for an oil producing country with oil processing capabilities, the impact of economic uncertainties may be tolerated by an appropriate balance between crude exports and processing capacities. 相似文献
108.
Computer-assisted optimization of chromatographic separations is still a fruitful activity. In fact, advances in computerized
data handling should make the application of systematic optimization strategies much easier. However, in most contemporary
applications, the optimization criterion is not considered to be a key issue (Vanbel, J Pharm Biomed, 21:603–610, 1999). In this paper, an update of the importance of selecting adequate criteria in chromatographic separation is presented. 相似文献
109.
A passive scalar is advected by a velocity field, with a nonuniform spatial source that maintains concentration inhomogeneities. For example, the scalar could be temperature with a source consisting of hot and cold spots, such that the mean temperature is constant. Which source distributions are best mixed by this velocity field? This question has a straightforward yet rich answer that is relevant to real mixing problems. We use a multiscale measure of steady-state enhancement to mixing and optimize it by a variational approach. We then solve the resulting Euler-Lagrange equation for a perturbed uniform flow and for simple cellular flows. The optimal source distributions have many broad features that are as expected: they avoid stagnation points, favour regions of fast flow, and their contours are aligned such that the flow blows hot spots onto cold and vice versa. However, the detailed structure varies widely with diffusivity and other problem parameters. Though these are model problems, the optimization procedure is simple enough to be adapted to more complex situations. 相似文献
110.
Satya Prakash Pranav Kumar B.V.N.S. Prasad Anuj Gupta 《European Journal of Operational Research》2008
A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making. 相似文献