全文获取类型
收费全文 | 5308篇 |
免费 | 493篇 |
国内免费 | 117篇 |
专业分类
化学 | 369篇 |
晶体学 | 2篇 |
力学 | 161篇 |
综合类 | 46篇 |
数学 | 2540篇 |
物理学 | 575篇 |
无线电 | 2225篇 |
出版年
2024年 | 16篇 |
2023年 | 75篇 |
2022年 | 111篇 |
2021年 | 145篇 |
2020年 | 147篇 |
2019年 | 103篇 |
2018年 | 100篇 |
2017年 | 135篇 |
2016年 | 193篇 |
2015年 | 147篇 |
2014年 | 265篇 |
2013年 | 307篇 |
2012年 | 288篇 |
2011年 | 298篇 |
2010年 | 256篇 |
2009年 | 323篇 |
2008年 | 380篇 |
2007年 | 409篇 |
2006年 | 316篇 |
2005年 | 244篇 |
2004年 | 209篇 |
2003年 | 189篇 |
2002年 | 170篇 |
2001年 | 138篇 |
2000年 | 125篇 |
1999年 | 107篇 |
1998年 | 104篇 |
1997年 | 78篇 |
1996年 | 79篇 |
1995年 | 50篇 |
1994年 | 59篇 |
1993年 | 49篇 |
1992年 | 39篇 |
1991年 | 31篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 28篇 |
1987年 | 17篇 |
1986年 | 23篇 |
1985年 | 23篇 |
1984年 | 26篇 |
1983年 | 8篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有5918条查询结果,搜索用时 437 毫秒
101.
With the rapid popularity of multi-camera networks, one human action is usually captured by multiple cameras located at different angles simultaneously. Multi-camera videos contain the distinct perspectives of one action, therefore multiple views can overcome the impacts of illumination and occlusion. In this paper, we propose a novel multi-camera video clustering model, named Shareability-Exclusivity Representation on Product Grassmann Manifolds (PGM-SER), to address two key issues in traditional multi-view clustering methods (MVC): (1) Most MVC methods directly construct a shared similarity matrix by fusing multi-view data or their corresponding similarity matrices, which ignores the exclusive information in each view; (2) Most MVC methods are designed for multi-view vectorial data, which cannot handle the nonlinear manifold structure hidden in multi-camera videos. The proposed PGM-SER firstly adopts Product Grassmann Manifolds to represent multi-camera videos, then simultaneously learn their shared and exclusive information in global structures to achieve multi-camera video clustering. We provide an effective optimization algorithm to solve PGM-SER and present the corresponding convergence analysis. Finally, PGM-SER is tested on three multi-camera human action video datasets and obtain satisfied experimental results. 相似文献
102.
Trigonometric wavelets for Hermite interpolation 总被引:4,自引:0,他引:4
Ewald Quak. 《Mathematics of Computation》1996,65(214):683-722
The aim of this paper is to investigate a multiresolution analysis of nested subspaces of trigonometric polynomials. The pair of scaling functions which span the sample spaces are fundamental functions for Hermite interpolation on a dyadic partition of nodes on the interval . Two wavelet functions that generate the corresponding orthogonal complementary subspaces are constructed so as to possess the same fundamental interpolatory properties as the scaling functions. Together with the corresponding dual functions, these interpolatory properties of the scaling functions and wavelets are used to formulate the specific decomposition and reconstruction sequences. Consequently, this trigonometric multiresolution analysis allows a completely explicit algorithmic treatment.
103.
Zbigniew Michalewicz 《Journal of Heuristics》1996,1(2):177-206
Evolutionary computation techniques, which are based on a powerful principle of evolution—survival of the fittest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival.Any evolutionary algorithm applied to a particular problem must address the issue of genetic representation of solutions to the problem and genetic operators that would alter the genetic composition of offspring during the reproduction process. However, additional heuristics should be incorporated in the algorithm as well; some of these heuristic rules provide guidelines for evaluating (feasible and infeasible) individuals in the population. This paper surveys such heuristics and discusses their merits and drawbacks.An abridged version of this paper appears in the volume entitled META-HEURISTICS: Theory & Application, edited by Ibrahim H. Osman and James P. Kelly, to be published by Kluwer Academic Publishers in March 1996. 相似文献
104.
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. 相似文献
105.
We adapted the genetic algorithm to minimize the AMBER potential energy function. We describe specific recombination and mutation operators for this task. Next we use our algorithm to locate low energy conformation of three polypeptides (AGAGAGAGA, A9, and [Met]-enkephalin) which are probably the global minimum conformations. Our potential energy minima are –94.71, –98.50, and –48.94 kcal/mol respectively. Next, we applied our algorithm to the 46 amino acid protein crambin and located a non-native conformation which had an AMBER potential energy 150 kcal/mol lower than the native conformation. This is not necessarily the global minimum conformation, but it does illustrate problems with the AMBER potential energy function. We believe this occurred because the AMBER potential energy function does not account for hydration. 相似文献
106.
Mireille Regnier 《BIT Numerical Mathematics》1985,25(2):335-357
Grid file algorithms were suggested in [12] to provide multi-key access to records in a dynamically growing file. We specify here two algorithms and derive the average sizes of the corresponding directories. We provide an asymptotic analysis. The growth of the indexes appears to be non-linear for uniform distributions:O(v
c
) orO(v
), wherec=1+b–1, =1+(s-1)/(sb+1),s is the number of attributes being used,v the file size, andb the page capacity of the system. Finally we give corresponding results for biased distributions and compare transient phases. 相似文献
107.
We present a series of conformational search calculations on the aggregation of short peptide fragments that form fibrils similar to those seen in many protein mis-folding diseases. The proteins were represented by a face-centered cubic lattice model with the conformational energies calculated using the Miyazawa-Jernigan potential. The searches were performed using algorithms based on the Metropolis Monte Carlo method, including simulated annealing and replica exchange. We also present the results of searches using the tabu search method, an algorithm that has been used for many optimization problems, but has rarely been used in protein conformational searches. The replica exchange algorithm consistently found more stable structures then the other algorithms, and was particularly effective for the octamers and larger systems. 相似文献
108.
Clustering analysis of data from DNA microarray hybridization studies is an essential task for identifying biologically relevant groups of genes. Attribute cluster algorithm (ACA) has provided an attractive way to group and select meaningful genes. However, ACA needs much prior knowledge about the genes to set the number of clusters. In practical applications, if the number of clusters is misspecified, the performance of the ACA will deteriorate rapidly. We propose the Cooperative Competition Cluster Algorithm (CCCA) in this paper. In the algorithm, we assume that both cooperation and competition exist simultaneously between clusters in the process of clustering. By using this principle of Cooperative Competition, the number of clusters can be found in the process of clustering. Experimental results on a synthetic and gene expression data are demonstrated. The results show that CCCA can choose the number of clusters automatically and get excellent performance with respect to other competing methods. 相似文献
109.
Genetic algorithms (GA) were used to solve one of the multidimensional problems in computational chemistry, the optimization of force field parameters. The correlation between the composition of the GA, its parameters (p(c), p(m)) and the quality of the results were investigated. The composition was studied for all combinations of a Simple GA/Steady State GA with a Roulette Wheel/Tournament Selector using different values each for crossover (0.5, 0.7, 0.9) and mutation rates (0.01, 0.02, 0.05, 0.10, 0.20). The results show that the performance is strongly dependent on the GA scheme, where the Simple GA/Tournament Selector yields the best results. Two new MM3 parameters were introduced for rhenium compounds with coordination number four (204) and coordination number five (205), the formal oxidation states of rhenium ranging from +V to +VII. A manifold of parameters (Re-C, N, O, S) was obtained by using a diverse set of CSD structures. The advantage of the GA vs. UFF calculations is shown by comparison of several examples. The GA optimized parameters were able to reproduce the geometrical data of the X-ray structures. 相似文献
110.
《Analytica chimica acta》2004,515(1):87-100
The goal of present work is to analyse the effect of having non-informative variables (NIV) in a data set when applying cluster analysis and to propose a method computationally capable of detecting and removing these variables. The method proposed is based on the use of a genetic algorithm to select those variables important to make the presence of groups in data clear. The procedure has been implemented to be used with k-means and using the cluster silhouettes as fitness function for the genetic algorithm.The main problem that can appear when applying the method to real data is the fact that, in general, we do not know a priori what the real cluster structure is (number and composition of the groups).The work explores the evolution of the silhouette values computed from the clusters built by using k-means when non-informative variables are added to the original data set in both a literature data set as well as some simulated data in higher dimension. The procedure has also been applied to real data sets. 相似文献