全文获取类型
收费全文 | 408篇 |
免费 | 10篇 |
专业分类
化学 | 317篇 |
晶体学 | 4篇 |
力学 | 6篇 |
数学 | 48篇 |
物理学 | 43篇 |
出版年
2023年 | 7篇 |
2022年 | 21篇 |
2021年 | 21篇 |
2020年 | 14篇 |
2019年 | 14篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 24篇 |
2015年 | 14篇 |
2014年 | 12篇 |
2013年 | 20篇 |
2012年 | 39篇 |
2011年 | 34篇 |
2010年 | 17篇 |
2009年 | 26篇 |
2008年 | 35篇 |
2007年 | 24篇 |
2006年 | 15篇 |
2005年 | 13篇 |
2004年 | 15篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1994年 | 4篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有418条查询结果,搜索用时 62 毫秒
21.
dos Reis Lima Fernanda Maria Silva Saimon Moraes da Silva Freires André Goulart Marília Oliveira Fonseca Damos Flavio Santos de Cassia Silva Luz Rita 《Journal of Solid State Electrochemistry》2019,23(3):725-734
Journal of Solid State Electrochemistry - This paper reports the development of a photoelectrochemical platform based on indium tin oxide (ITO) electrode modified with carboxyl-functionalized... 相似文献
22.
Antônio Gomes dos Santos Neto Franciele de Matos Morawski Ana Caroline Ferreira Santos Cláudia Quintino da Rocha Roberto Batista de Lima Marília Oliveira Fonseca Goulart Clenilton Costa dos Santos Flávio Colmati Antônio Euzébio Goulart Santana Marco Aurélio Suller Garcia Auro Atsushi Tanaka 《Electroanalysis》2023,35(5):e202200390
Here, we report multiwalled carbon nanotubes (MWCNTs) functionalized with γ-cyclodextrins (γCD) as a novel electrochemical strategy for Rutin determination, showing superior performance than β-cyclodextrins (βCD) modified MWCNTs, suggesting an adequate environment for host-guest interactions. Under optimized conditions, the sensor showed a linear range of 39–975 nmol L−1 and a limit of detection of 7 nmol L−1. When tested with quercetin, catechin, and caffeine, the platform presented high selectivity with an interference response <10 %. The method was employed to quantify Rutin in spiked pharmaceutical and herbal extracts, providing recovery of 93–98.4 %. Also, HPLC-PDA confirmed the method‘s accuracy. 相似文献
23.
Guizellini Filipe Corrêa Franzin Bruno Trevizan da Silva Matheus Antonio Abra Luciana Mazotti Hojo Ossamu Pastre Iêda Aparecida Ribeiro Clóvis Augusto Paiva-Santos Carlos de Oliveira Fertonani Fernando Luis 《Journal of Thermal Analysis and Calorimetry》2021,143(1):47-60
Journal of Thermal Analysis and Calorimetry - The aim of this work is to synthesize and characterize a new structured silver–clay dried, calcined or sintered at different temperatures... 相似文献
24.
A. O. Porto G. Goulart Silva W. F. Magalhes 《Journal of Polymer Science.Polymer Physics》1999,37(3):219-226
Positron lifetime measurements were carried out in a series of poly(ethylene oxide)—PEO—of different average molecular weights (M w): 1000, 1500, 6000, 10,000, 300,000, and 4 M. The mean radius (R ) and the mean free volume size (Vf) values were determined using a semiempirical equation that correlates the ortho‐positronium (o‐Ps) lifetime (τ3) and size of holes existing in the amorphous phases. The hole mean radius values determined at room temperature from lifetime spectra were found to be between 2.68 and 2.97 Å, and the hole volumes between 80 and 110 Å3. Free volume size evolution was studied with temperature variation until the melting temperature of the PEO samples. The degree of crystallinity and the melting temperatures were determined by Differential Scanning Calorimetry. © 1999 John Wiley & Sons, Inc. J Polym Sci B: Polym Phys 37: 219–226, 1999 相似文献
25.
Alexandre Plastino Hugo Barbalho Luis Filipe M. Santos Richard Fuchshuber Simone L. Martins 《Journal of Heuristics》2014,20(1):39-74
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. Some researches have been combining machine learning techniques with metaheuristics to adaptively guide and improve the search for near optimal solutions. An example of such development is the DM-GRASP, a hybrid version of the Greedy Randomized Adaptative Search Procedures (GRASP) metaheuristic which incorporates a data mining process. In this hybrid proposal, after executing half of the total number of iterations, the data mining process extracts patterns from an elite set of sub-optimal solutions for the optimization problem. These patterns present characteristics of near optimal solutions and can be used to guide the following half GRASP iterations in the search through the solution space. In this work, we explore new versions of the DM-GRASP metaheuristic to experiment, not a single activation, but multiple and adaptive executions of the data mining process during the metaheuristic execution. We also applied the data mining technique into a reactive GRASP to show that a more sophisticated and not memoryless GRASP approach can also benefit from the use of this technique. In order to evaluate these new proposals, we adopted the server replication for reliable multicast problem since the best known results for this problem were obtained by GRASP and DM-GRASP implementations. The computational experiments, comparing traditional GRASP, DM-GRASP, and the new proposals, showed that multiple and adaptive executions of the data mining process can improve the results obtained by the DM-GRASP hybrid metaheuristic—the new proposals were able to find better results in less computational time for the reliable multicast problem. 相似文献
26.
Filipe J. Marques M. Theodor Loots Andriëtte Bekker 《Mathematical Methods in the Applied Sciences》2019,42(17):5718-5735
Series representations for several density functions are obtained as mixtures of generalized gamma distributions with discrete mass probability weights, by using the exponential expansion and the binomial theorem. Based on these results, approximations based on mixtures of generalized gamma distributions are proposed to approximate the distribution of the sum of independent random variables, which may not be identically distributed. The applicability of the proposed approximations are illustrated for the sum of independent Rayleigh random variables, the sum of independent gamma random variables, and the sum of independent Weibull random variables. Numerical studies are presented to assess the precision of these approximations. 相似文献
27.
Using a suitable decomposition of the null hypothesis of the sphericity test for several blocks of variables, into a sequence of conditionally independent null hypotheses, we show that it is possible to obtain the expressions for the likelihood ratio test statistic, for its hth null moment, and for the characteristic function of its logarithm. The exact distribution of the logarithm of the likelihood ratio test statistic is obtained in the form of a sum of a generalized integer gamma distribution with the sum of a given number of independent logbeta distributions, taking the form of a single generalized integer gamma distribution when each set of variables has two variables. The development of near‐exact distributions arises, from the previous decomposition of the null hypothesis and from the consequent‐induced factorization of the characteristic function, as a natural and practical way to approximate the exact distribution of the test statistic. A measure based on the exact and approximating characteristic functions, which gives an upper bound on the distance between the corresponding distribution functions, is used to assess the quality of the near‐exact distributions proposed and to compare them with an asymptotic approximation on the basis of Box's method. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
28.
Isabel Martins Filipe Alvelos Miguel Constantino 《Computational Optimization and Applications》2012,51(1):363-385
Recently, research on exact methods has been undertaken to solve forest management problems subject to constraints on the
maximum clearcut area by using the area restriction model approach. Three main basic integer programming models for these
problems have been discussed in the literature: the so-called cluster, path and bucket formulations. Solving these models
via branch-and-bound, where all variables and constraints are used a priori, is adequately suited for real problems of a small
to medium size, but is not appropriate for larger problems. In this paper, we describe a branch-and-price approach for the
cluster model, and we show that this formulation dominates the bucket model, by completing the results of the dominance relationships
between the bounds of the three models. Branch-and-price was tested on real and hypothetical forests ranging from 45 to 2945
stands and temporal horizons ranging from three to twelve periods were employed. Results show that the solutions obtained
by the proposed approach stood within 1% of the optimal solution and were achieved in a short computation time. It was found
that branch-and-bound was unable to produce solutions for most forests from 850 stands with either eleven or an average number
of stands per clearcut greater or equal than eight. 相似文献
29.
Patrícia A. Filipe Carlos A. Braumann Carlos J. Roquete 《Methodology and Computing in Applied Probability》2012,14(1):49-56
The evolution of the growth of an individual in a random environment can be described through stochastic differential equations
of the form dY
t
= β(α − Y
t
)dt + σdW
t
, where Y
t
= h(X
t
), X
t
is the size of the individual at age t, h is a strictly increasing continuously differentiable function, α = h(A), where A is the average asymptotic size, and β represents the rate of approach to maturity. The parameter σ measures the intensity of the effect of random fluctuations on growth and W
t
is the standard Wiener process. We have previously applied this monophasic model, in which there is only one functional form
describing the average dynamics of the complete growth curve, and studied the estimation issues. Here, we present the generalization
of the above stochastic model to the multiphasic case, in which we consider that the growth coefficient β assumes different values for different phases of the animal’s life. For simplicity, we consider two phases with growth coefficients
β
1 and β
2. Results and methods are illustrated using bovine growth data. 相似文献
30.
Rodrigues Filipe Agra Agostinho Hvattum Lars Magnus Requejo Cristina 《Journal of Heuristics》2021,27(3):459-496
Journal of Heuristics - Proximity search is an iterative method to solve complex mathematical programming problems. At each iteration, the objective function of the problem at hand is replaced by... 相似文献