全文获取类型
收费全文 | 1858篇 |
免费 | 144篇 |
国内免费 | 47篇 |
专业分类
化学 | 344篇 |
晶体学 | 4篇 |
力学 | 196篇 |
综合类 | 45篇 |
数学 | 752篇 |
物理学 | 708篇 |
出版年
2024年 | 2篇 |
2023年 | 27篇 |
2022年 | 57篇 |
2021年 | 47篇 |
2020年 | 46篇 |
2019年 | 39篇 |
2018年 | 36篇 |
2017年 | 50篇 |
2016年 | 57篇 |
2015年 | 60篇 |
2014年 | 125篇 |
2013年 | 132篇 |
2012年 | 87篇 |
2011年 | 113篇 |
2010年 | 102篇 |
2009年 | 117篇 |
2008年 | 123篇 |
2007年 | 117篇 |
2006年 | 79篇 |
2005年 | 69篇 |
2004年 | 54篇 |
2003年 | 58篇 |
2002年 | 53篇 |
2001年 | 46篇 |
2000年 | 35篇 |
1999年 | 42篇 |
1998年 | 35篇 |
1997年 | 34篇 |
1996年 | 29篇 |
1995年 | 28篇 |
1994年 | 32篇 |
1993年 | 22篇 |
1992年 | 15篇 |
1991年 | 15篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有2049条查询结果,搜索用时 140 毫秒
301.
Gábor N. Sárközy 《Discrete Mathematics》2009,309(6):1611-1622
Suppose that 0<η<1 is given. We call a graph, G, on n vertices an η-Chvátal graph if its degree sequence d1≤d2≤?≤dn satisfies: for k<n/2, dk≤min{k+ηn,n/2} implies dn−k−ηn≥n−k. (Thus for η=0 we get the well-known Chvátal graphs.) An -algorithm is presented which accepts as input an η-Chvátal graph and produces a Hamiltonian cycle in G as an output. This is a significant improvement on the previous best -algorithm for the problem, which finds a Hamiltonian cycle only in Dirac graphs (δ(G)≥n/2 where δ(G) is the minimum degree in G). 相似文献
302.
Vittoria de Nitto Personè 《Annals of Operations Research》2009,170(1):95-112
The aim of this paper is to improve the machine interference model with vacation to deal with more recent problems of the
communication area. To this scope the model is extended to include parallelism in the vacation station. The underlying Markov
process is analyzed and a state arrangement is found that yields an efficient matrix-analytic technique that substantially
lowers down the time- and space-complexity of standard methods. A numerical example of the method effectiveness is presented,
and an example of resource allocation is introduced that finds applications in the QoS management of wireless networks.
The author is thankful to the anonymous referees for the improvements their comments have earned to the quality of the presentation
and to the completeness of the paper. The author is thankful to Giuseppe Iazeolla, whose careful reading of the original draft
of this paper led to significant improvements in its overall quality. This work was partially supported by funds from the
FIRB project “Performance Evaluation of Complex Systems: Techniques Methodologies and Tools” and by the University of Roma
TorVergata project on High Performance ICT Platforms. 相似文献
303.
In studies on scheduling problems, generally setup times and removal times of jobs have been neglected or by including those into processing times. However, in some production systems, setup times and removal times are very important such that they should be considered independent from processing times. Since, in general jobs are done according to automatic machine processes in production systems processing times do not differ according to process sequence. But, since human factor becomes influential when setup times and removal times are taken into consideration, setup times will be decreasing by repeating setup processes frequently. This fact is defined with learning effect in scheduling literature. In this study, a bicriteria m-identical parallel machines scheduling problem with a learning effect of setup times and removal times is considered. The objective function of the problem is minimization of the weighted sum of total completion time and total tardiness. A mathematical programming model is developed for the problem which belongs to NP-hard class. Results of computational tests show that the proposed model is effective in solving problems with up to 15 jobs and five machines. We also proposed three heuristic approaches for solving large jobs problems. According to the best of our knowledge, no work exists on the minimization of the weighted sum of total completion time and total tardiness with a learning effect of setup times and removal times. 相似文献
304.
Traditional studies in data envelopment analysis (DEA) view systems as a whole when measuring the efficiency, ignoring the operation of individual processes within a system. This paper builds a relational network DEA model, taking into account the interrelationship of the processes within the system, to measure the efficiency of the system and those of the processes at the same time. The system efficiency thus measured more properly represents the aggregate performance of the component processes. By introducing dummy processes, the original network system can be transformed into a series system where each stage in the series is of a parallel structure. Based on these series and parallel structures, the efficiency of the system is decomposed into the product of the efficiencies of the stages in the series and the inefficiency slack of each stage into the sum of the inefficiency slacks of its component processes connected in parallel. With efficiency decomposition, the process which causes the inefficient operation of the system can be identified for future improvement. An example of the non-life insurance industry in Taiwan illustrates the whole idea. 相似文献
305.
In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem. 相似文献
306.
Carlos Alberto Alonso Sanches Nei Yoshihiro Soma 《Applied mathematics and computation》2009,215(6):2055-2062
It is suggested here an algorithm based on stickers for the DNA Computing model [S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, A sticker-based model for DNA Computation, Journal of Computational Biology 5 (1998) 615–629] that solves the well known Bin-Packing Problem (BPP), that belongs to the class -Hard in the strong sense, in a time bounded by , where n is the quantity of items and q the space requirements expressed in bits.To the best of the authors’ knowledge, this is the first polynomial time algorithmic solution for the BPP in such a model. 相似文献
307.
Optical computing 总被引:1,自引:0,他引:1
308.
The optimization of parallel applications is difficult to achieve by classical optimization techniques because of their diversity and the variety of actual parallel and distributed platforms and/or environments. Adaptive algorithmic schemes, capable of dynamically changing the allocation of jobs during the execution to optimize global system behavior, are the best alternatives for solving this problem. In this paper, we focus on non-clairvoyant scheduling of parallel jobs with known resource requirements but unknown running times, with emphasis on the regulation of idle periods in the context of general list policies. We consider a new family of scheduling strategies based on two phases which successively combine sequential and parallel execution of jobs. We generalize known worst-case performance bounds by considering two extra parameters, in addition to the number of processors and maximum processor requirements considered in the literature, namely, job parallelization penalty and idle regulation factor. Furthermore, we prove that under certain conditions of idle regulation, the performance guarantee of parallel job scheduling in space-sharing mode can be improved. 相似文献
309.
Yi Li 《Applied mathematics and computation》2009,215(7):2495-2501
A hybrid algorithm for computing the determinant of a matrix whose entries are polynomials is presented. It is based on the dimension-decreasing algorithm [22] and the parallel algorithm for computing a symbolic determinant of [19]. First, through the dimension-decreasing algorithm, a given multivariate matrix can be converted to a bivariate matrix. Then, the parallel algorithm can be applied to effectively compute the determinant of the bivariate matrix. Experimental results show that the new algorithm can not only reduce enormously the intermediate expression swell in the process of symbolic computation, but also achieve higher degree of parallelism, compared with the single parallel algorithm given in [19]. 相似文献
310.
In this paper we consider the problem of scheduling jobs with release dates on parallel unbounded batch processing machines to minimize the maximum lateness. We show that the case where the jobs have deadlines is strongly NP-hard. We develop a polynomial-time approximation scheme for the problem to minimize the maximum delivery completion time, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. 相似文献