全文获取类型
收费全文 | 8837篇 |
免费 | 1390篇 |
国内免费 | 436篇 |
专业分类
化学 | 2281篇 |
晶体学 | 35篇 |
力学 | 543篇 |
综合类 | 324篇 |
数学 | 3911篇 |
物理学 | 3569篇 |
出版年
2024年 | 30篇 |
2023年 | 134篇 |
2022年 | 536篇 |
2021年 | 423篇 |
2020年 | 270篇 |
2019年 | 241篇 |
2018年 | 190篇 |
2017年 | 357篇 |
2016年 | 422篇 |
2015年 | 351篇 |
2014年 | 625篇 |
2013年 | 715篇 |
2012年 | 557篇 |
2011年 | 554篇 |
2010年 | 512篇 |
2009年 | 574篇 |
2008年 | 541篇 |
2007年 | 599篇 |
2006年 | 443篇 |
2005年 | 332篇 |
2004年 | 297篇 |
2003年 | 272篇 |
2002年 | 252篇 |
2001年 | 200篇 |
2000年 | 205篇 |
1999年 | 163篇 |
1998年 | 137篇 |
1997年 | 121篇 |
1996年 | 116篇 |
1995年 | 62篇 |
1994年 | 82篇 |
1993年 | 72篇 |
1992年 | 45篇 |
1991年 | 35篇 |
1990年 | 35篇 |
1989年 | 16篇 |
1988年 | 31篇 |
1987年 | 12篇 |
1986年 | 24篇 |
1985年 | 23篇 |
1984年 | 14篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 10篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1977年 | 6篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Douglas N. Hales V. Sridharan Abirami Radhakrishnan Satya S. Chakravorty Samia M. Siha 《European Journal of Operational Research》2008
Although Information Technology (IT) solutions improve the collection and validation of operational data, Operations Managers must often rely on self-reported data from workers to make decisions. The problem with this data is that they are subject to intentional manipulation, thus reducing their suitability for decision-making. A method of identifying manipulated data, digital analysis, addresses this problem at low cost. In this paper, we demonstrate how one uses this method in real-world companies to validate self-reported data from line workers. The results of our study suggest that digital analysis estimates the accuracy of employee reported data in operations management, within limited contexts. These findings lead to improved operating performance by providing a tool for practitioners to exclude inaccurate information. 相似文献
992.
With the advent of the supply chain management concepts, business communities have been realizing that being competitive as a single company is no longer adequate; instead, competitiveness requires consideration of all channels in the supply chain. Despite its importance, the availability of the literature addressing supply chain flexibility is still limited to date. Although relationships between various types of flexibilities have been established, the degree to which one type of flexibility affects the other types and the system performance remains to be investigated. In particular, there is a lack of rigorous analytical models elucidating the relationships between the degree of flexibility in a system and the system level of performance. In this paper, a supply chain flexibility model is developed comprising labor flexibility, machine flexibility, routing flexibility, and information technology, with total system flexibility measured by an economic index. Outputs from the model can assist in making suitable production decisions to produce multiple products under an uncertain environment. Example solutions are given. This paper can help economic evaluation when supply chain flexibility and the factors affecting flexibility are to be improved. It can also assist in making supply chain flexibility-promotion decisions. 相似文献
993.
Continuous-time portfolio selection with liability: Mean–variance model and stochastic LQ approach 总被引:1,自引:1,他引:0
In this paper we formulate a continuous-time mean–variance portfolio selection model with multiple risky assets and one liability in an incomplete market. The risky assets’ prices are governed by geometric Brownian motions while the liability evolves according to a Brownian motion with drift. The correlations between the risky assets and the liability are considered. The objective is to maximize the expected terminal wealth while minimizing the variance of the terminal wealth. We derive explicitly the optimal dynamic strategy and the mean–variance efficient frontier in closed forms by using the general stochastic linear-quadratic (LQ) control technique. Several special cases are discussed and a numerical example is also given. 相似文献
994.
S. L. Hakimi 《Annals of Operations Research》1986,6(4):75-98
In competitive location theory, one wishes to optimally choose the locations ofr facilities to compete againstp existing facilities for providing service (or goods) to the customers who are at given discrete points (or nodes). One normally assumes that: (a) the level of demand of each customer is fixed (i.e. this demand is not a function of how far a customer is from a facility), and (b) the customer always uses the closest available facility. In this paper we study competitive locations when one or both of the above assumptions have been relaxed. In particular, we show that for each case and under certain assumptions, there exists a set of optimal locations which consists entirely of nodes.This work was supported by a National Science Foundation Grant ECS-8121741. 相似文献
995.
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. 相似文献
996.
In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature. 相似文献
997.
Computing semiparametric bounds for option prices is a widely studied pricing technique. In contrast to parametric pricing techniques, such as Monte-Carlo simulations, semiparametric pricing techniques do not require strong assumptions about the underlying asset price distribution. We extend classical results in this area. Specifically, we derive closed-form semiparametric bounds for the payoff of a European call option, given up to third-order moment (i.e., mean, variance, and skewness) information on the underlying asset price. We analyze how these bounds tighten the corresponding bounds, when only second-order moment (i.e., mean and variance) information is provided. We describe applications of these results in the context of option pricing; as well as in other areas such as inventory management, and actuarial science. 相似文献
998.
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three-dimensional space. In two dimensions we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In the former case such graphs are geometrically embedded in R2 and have an underlying backbone that is planar with convex faces; however within each face arbitrary edges (with arbitrary crossings) are allowed. In the latter case, these graphs are geometrically embedded in R3 and consist of a backbone of convex polyhedra and arbitrary edges within each polyhedron. In both cases we provide a routing algorithm that guarantees delivery. Our algorithms need only “remember” the source and destination nodes and one (respectively, two) reference nodes used to store information about the underlying face (respectively, polyhedron) currently being traversed. The existence of the backbone is used only in proofs of correctness of the routing algorithm; the particular choice is irrelevant and does not affect the behaviour of the algorithm. 相似文献
999.
The network trophic theory tries to explain the working of basic ecosystems by studying the trophic connections between species. A basic model that helps us to understand some rules that have been followed in the ecosystems is the one known as the model of trophic cascade. By following these ecological criteria, the algorithm that we present allows us to determine the number of viable trophic networks, taking into account the number of trophic levels, the maximum number of species at each level and the links between the different species. A development for five levels is shown. 相似文献
1000.
Yasuhiro Tanaka Tatsuro Endo Yasuko Yanagida Takeshi Hatsuzawa 《Microchemical Journal》2009,91(2):232-238
In this paper, we describe the design and fabrication of a dielectrophoresis (DEP)-based cell-positioning and cell-culture device for the construction of cell networks. This device enables both individual cell positioning and cell culture. Titanium electrodes were fabricated by deposition. Furthermore, microchambers and microchannels composed of SU-8, which is a negative photoresist, were used to carry out cell culture and enable cell differentiation. Using our device, N1E-115 cells were individually positioned in the microchambers, and the positioning yield was 45%. After positioning, the cells could be continuously cultured in the microchambers. Furthermore, the cells differentiated, and their neurites extended through the microchannels after cultivation for several days. These results indicate that our device greatly increases the prospects for individual cell positioning and can be used to construct cell networks that have several applications in the medical field, for example, in drug screening. 相似文献