全文获取类型
收费全文 | 11508篇 |
免费 | 292篇 |
国内免费 | 215篇 |
专业分类
化学 | 1879篇 |
晶体学 | 16篇 |
力学 | 342篇 |
综合类 | 42篇 |
数学 | 8038篇 |
物理学 | 1698篇 |
出版年
2024年 | 26篇 |
2023年 | 102篇 |
2022年 | 202篇 |
2021年 | 297篇 |
2020年 | 356篇 |
2019年 | 231篇 |
2018年 | 302篇 |
2017年 | 444篇 |
2016年 | 408篇 |
2015年 | 461篇 |
2014年 | 763篇 |
2013年 | 843篇 |
2012年 | 640篇 |
2011年 | 657篇 |
2010年 | 608篇 |
2009年 | 585篇 |
2008年 | 475篇 |
2007年 | 510篇 |
2006年 | 559篇 |
2005年 | 347篇 |
2004年 | 198篇 |
2003年 | 207篇 |
2002年 | 247篇 |
2001年 | 271篇 |
2000年 | 104篇 |
1999年 | 242篇 |
1998年 | 159篇 |
1997年 | 138篇 |
1996年 | 165篇 |
1995年 | 64篇 |
1994年 | 49篇 |
1993年 | 58篇 |
1992年 | 72篇 |
1991年 | 39篇 |
1990年 | 57篇 |
1989年 | 43篇 |
1988年 | 192篇 |
1987年 | 251篇 |
1986年 | 253篇 |
1985年 | 55篇 |
1984年 | 59篇 |
1983年 | 39篇 |
1982年 | 38篇 |
1981年 | 37篇 |
1980年 | 34篇 |
1979年 | 21篇 |
1978年 | 31篇 |
1977年 | 21篇 |
1976年 | 29篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
871.
Project scheduling problem is to determine the schedule of allocating resources so as to balance the total cost and the completion time. This paper considers a type of project scheduling problem with fuzzy activity duration times. According to some management goals, three types of fuzzy models are built to solve the project scheduling problem. Moreover, the technique of fuzzy simulation and genetic algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy models. Finally, some numerical examples are given to illustrate the effectiveness of the algorithm. 相似文献
872.
Given the NP-Hard nature of many optimization problems, it is often impractical to obtain optimal solutions to large-scale
problems in reasonable computing time. For this reason, heuristic and metaheuristic search approaches are used to obtain good
solutions fast. However, these techniques often struggle to develop a good balance between local and global search. In this
paper we propose a hybrid metaheuristic approach which we call the NeuroGenetic approach to search for good solutions for
these large scale optimization problems by at least partially overcoming this challenge. The proposed NeuroGenetic approach
combines the Augmented Neural Network (AugNN) and the Genetic Algorithm (GA) search approaches by interleaving the two. We
chose these two approaches to hybridize, as they offer complementary advantages and disadvantages; GAs are very good at searching
globally, while AugNNs are more proficient at searching locally. The proposed hybrid strategy capitalizes on the strong points
of each approach while avoiding their shortcomings. In the paper we discuss the issues associated with the feasibility of
hybridizing these two approaches and propose an interleaving algorithm. We also provide empirical evidence demonstrating the
effectiveness of the proposed approach. 相似文献
873.
This note deals with the orthogonality between sequences of random variables. The main idea of the note is to apply the results
on equidistant systems of points in a Hilbert space to the case of the space L
2(Ω, F, ℙ) of real square integrable random variables. The main result gives a necessary and sufficient condition for a particular
sequence of random variables (elements of which are taken from sets of equidistant elements of L
2(Ω, F, ℙ) to be orthogonal to some other sequence in L
2(Ω, F, ℙ). The result obtained is interesting from the point of view of the time series analysis, since it can be applied to a
class of sequences random variables that exhibit a monotonically increasing variance. An application to ergodic theorem is
also provided. 相似文献
874.
875.
利用拓扑度计算,研究了一类超线性奇异Neumann边值问题非平凡解的存在性,其中非线性项可变号且下方无界. 相似文献
876.
In this paper, we adapt the octahedral simplicial algorithm for solving systems of nonlinear equations to solve the linear complementarity problem with upper and lower bounds. The proposed algorithm generates a piecewise linear path from an arbitrarily chosen pointz
0 to a solution point. This path is followed by linear programming pivot steps in a system ofn linear equations, wheren is the size of the problem. The starting pointz
0 is left in the direction of one of the 2
n
vertices of the feasible region. The ray along whichz
0 is left depends on the sign pattern of the function value atz
0. The sign pattern of the linear function and the location of the points in comparison withz
0 completely govern the path of the algorithm.This research is part of the VF-Program Equilibrium and Disequilibrium in Demand and Supply, approved by the Netherlands Ministry of Education, Den Haag, The Netherlands. 相似文献
877.
How can the basic compatibility of theory and observations be investigated for nonlinear processes without requiring stochastic characterizations for residual error terms? The present paper proposes a flexible least-cost approach. For each possible estimatex for the sequence of process states, letc D (x) andx M(x) denote the costs incurred for deviations away from the prior dynamic specifications and prior measurement specifications, respectively. Define the cost-efficiency frontier to be the greatest lower bound for the set of all possible cost pairs [c D (x),c M(x)], conditional on the given observations. State sequence estimatesx that attain the cost-efficiency frontier indicate the possible ways that the actual process could have developed over time in a manner minimally incompatible with the prior dynamic and measurement specifications. An algorithm is developed for the exact sequential updating of the cost-efficient state sequence estimates as the duration of the process increases and additional observations are obtained. 相似文献
878.
Testing the validity of the conditional capital asset pricing model(CAPM) is a puzzle in the finance literatureLewellen and Nagel[14]find that the variation in betas and in the equity premium would have to be implausibly large to explain important asset-pricing anomaliesUnfortunately, they do not provide a rigorous test statisticBased on a simulation study, the method proposed in Lewellen and Nagel[14]tends to reject the null too frequently.We develop a new test procedure and derive its limiting distribution under the null hypothesis.Also, we provide a Bootstrap approach to the testing procedure to gain a good finite sample performanceBoth simulations and empirical studies show that our test is necessary for making correct inferences with the conditional CAPM. 相似文献
879.
880.
Giovanni P. Crespi Andreas H. Hamel Carola Schrage 《Journal of Mathematical Analysis and Applications》2015
Extremal problems are studied involving an objective function with values in (order) complete lattices of sets generated by so-called set relations. Contrary to the popular paradigm in vector optimization, the solution concept for such problems, introduced by F. Heyde and A. Löhne, comprises the attainment of the infimum as well as a minimality property. The main result is a Minty type variational inequality for set optimization problems which provides a sufficient optimality condition under lower semicontinuity assumptions and a necessary condition under appropriate generalized convexity assumptions. The variational inequality is based on a new Dini directional derivative for set-valued functions which is defined in terms of a “lattice difference quotient.” A residual operation in a lattice of sets replaces the inverse addition in linear spaces. Relationships to families of scalar problems are pointed out and used for proofs. The appearance of improper scalarizations poses a major difficulty which is dealt with by extending known scalar results such as Diewert's theorem to improper functions. 相似文献