全文获取类型
收费全文 | 1033篇 |
免费 | 76篇 |
国内免费 | 22篇 |
专业分类
化学 | 67篇 |
晶体学 | 1篇 |
力学 | 38篇 |
综合类 | 13篇 |
数学 | 807篇 |
物理学 | 205篇 |
出版年
2024年 | 2篇 |
2023年 | 12篇 |
2022年 | 18篇 |
2021年 | 71篇 |
2020年 | 45篇 |
2019年 | 45篇 |
2018年 | 24篇 |
2017年 | 31篇 |
2016年 | 61篇 |
2015年 | 34篇 |
2014年 | 57篇 |
2013年 | 147篇 |
2012年 | 42篇 |
2011年 | 54篇 |
2010年 | 55篇 |
2009年 | 49篇 |
2008年 | 48篇 |
2007年 | 46篇 |
2006年 | 39篇 |
2005年 | 31篇 |
2004年 | 14篇 |
2003年 | 25篇 |
2002年 | 15篇 |
2001年 | 18篇 |
2000年 | 13篇 |
1999年 | 13篇 |
1998年 | 16篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 9篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1131条查询结果,搜索用时 15 毫秒
41.
Fractional low order moments have been reported as beneficial for sampling computations using the K distribution. However, it has been recently pointed out that this it not the case for the homodyned-K distribution for a tissue discrimination problem. In this paper we show that such an statement is not fully justified. To that end, we follow a standard pattern recognition procedure both to determine class separability measures and to classify data with several classifiers. We conclude that the optimum order of the moments is intimately linked to the specific statistical properties of the tissues to be discriminated. Some ideas on how to choose the optimum order are discussed. 相似文献
42.
We provide an asymptotic formula for the number of labelled essential DAGs an and show that limnan/an=c, where an is the number of labelled DAGs and c13.65, which is interesting in the field of Bayesian networks. Furthermore, we present an asymptotic formula for the number of labelled chain graphs.Acknowledgment. I would like to thank Prof. Peter Grabner for his support and very helpful discussions, which where constitutive for this article. I am also thankful to the referees for their comments.This Research was supported by the Austrian Science Fund (FWF), START-Project Y96-MATFinal version received: January 28, 2004 相似文献
43.
CHANG K. C.; FUNG ROBERT; LUCAS ALAN; OLIVER ROBERT; SHIKALOFF NINA 《IMA Journal of Management Mathematics》2000,11(1):1-18
Email: kchang{at}gmu.eduEmail: RobertFung{at}Fairlsaac.comEmail: alan.lucas{at}hotmail.com¶Email: BobOliver{at}Fairlsaac.com||Email: NShikaloff{at}Fairlsaac.com The objectives of this paper are to apply the theory and numericalalgorithms of Bayesian networks to risk scoring, and comparethe results with traditional methods for computing scores andposterior predictions of performance variables. Model identification,inference, and prediction of random variables using Bayesiannetworks have been successfully applied in a number of areas,including medical diagnosis, equipment failure, informationretrieval, rare-event prediction, and pattern recognition. Theability to graphically represent conditional dependencies andindependencies among random variables may also be useful incredit scoring. Although several papers have already appearedin the literature which use graphical models for model identification,as far as we know there have been no explicit experimental resultsthat compare a traditionally computed risk score with predictionsbased on Bayesian learning algorithms. In this paper, we examine a database of credit-card applicantsand attempt to learn the graphical structure ofthe characteristics or variables that make up the database.We identify representative Bayesian networks in a developmentsample as well as the associated Markov blankets and cliquestructures within the Markov blanket. Once we obtain the structureof the underlying conditional independencies, we are able toestimate the probabilities of each node conditional on its directpredecessor node(s). We then calculate the posterior probabilitiesand scores of a performance variable for the development sample.Finally, we calculate the receiver operating characteristic(ROC) curves and relative profitability of scorecards basedon these identifications. The results of the different modelsand methods are compared with both development and validationsamples. Finally, we report on a statistical entropy calculationthat measures the degree to which cliques identified in theBayesian network are independent of one another. 相似文献
44.
Importance sampling Monte Carlo offers powerful approaches to approximating Bayesian updating in sequential problems. Specific classes of such approaches are known as particle filters. These procedures rely on the simulation of samples or ensembles of the unknown quantities and the calculation of associated weights for the ensemble members. As time evolves and/or when applied in high-dimensional settings, such as those of interest in many data assimilation problems, these weights typically display undesirable features. The key difficulty involves a collapse toward approximate distributions concentrating virtually all of their probability on an implausibly few ensemble members.
After reviewing ensembling, Monte Carlo, importance sampling and particle filters, we present some approximations intended to moderate the problem of collapsing weights. The motivations for these suggestions are combinations of (i) the idea that key dynamical behavior in many systems actually takes place on a low dimensional manifold, and (ii) notions of statistical dimension reduction. We illustrate our suggestions in a problem of inference for ocean surface winds and atmospheric pressure. Real observational data are used. 相似文献
45.
《Journal of computational and graphical statistics》2013,22(3):590-609
In this article we consider the sequential monitoring process in normal dynamic linear models as a Bayesian sequential decision problem. We use this approach to build a general procedure that jointly analyzes the existence of outliers, level changes, variance changes, and the development of local correlations. In addition, we study the frequentist performance of this procedure and compare it with the monitoring algorithm proposed in an earlier article. 相似文献
46.
《Journal of computational and graphical statistics》2013,22(3):569-589
A rather common problem of data analysis is to find interesting features, such as local minima, maxima, and trends in a scatterplot. Variance in the data can then be a problem and inferences about features must be made at some selected level of significance. The recently introduced SiZer technique uses a family of nonparametric smooths of the data to uncover features in a whole range of scales. To aid the analysis, a color map is generated that visualizes the inferences made about the significance of the features. The purpose of this article is to present Bayesian versions of SiZer methodology. Both an analytically solvable regression model and a fully Bayesian approach that uses Gibbs sampling are presented. The prior distributions of the smooths are based on a roughness penalty. Simulation based algorithms are proposed for making simultaneous inferences about the features in the data. 相似文献
47.
This paper examines the extent to which financial returns on market indices exhibit mean and volatility asymmetries, as a response to past information from both the U.S. market and the local market itself. In particular, we wish to assess the asymmetric effect of a combination of local and U.S. market news on volatility. To the best of the authors knowledge, this joint effect has not been considered previously. We propose a double threshold non‐linear heteroscedastic model, combined with a GJR‐GARCH effect in the conditional volatility equation, to capture jointly both mean and volatility asymmetric behaviours and the interactive effect of U.S. and local market news. In an application to five major international market indices, clear evidence of threshold non‐linearity is discovered, supporting the hypothesis of an uneven mean‐reverting pattern and volatility asymmetry, both in reaction to U.S. market news and news from the local market itself. Significant, but somewhat different, interactive effects between local and U.S. news are observed in all markets. An asymmetric pattern in the exogenous relationship between the local market and the U.S. market is also found. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
48.
P.S. Koutsourelakis 《Journal of computational physics》2009,228(17):6184-6211
This paper proposes a hierarchical, multi-resolution framework for the identification of model parameters and their spatially variability from noisy measurements of the response or output. Such parameters are frequently encountered in PDE-based models and correspond to quantities such as density or pressure fields, elasto-plastic moduli and internal variables in solid mechanics, conductivity fields in heat diffusion problems, permeability fields in fluid flow through porous media etc. The proposed model has all the advantages of traditional Bayesian formulations such as the ability to produce measures of confidence for the inferences made and providing not only predictive estimates but also quantitative measures of the predictive uncertainty. In contrast to existing approaches it utilizes a parsimonious, non-parametric formulation that favors sparse representations and whose complexity can be determined from the data. The proposed framework in non-intrusive and makes use of a sequence of forward solvers operating at various resolutions. As a result, inexpensive, coarse solvers are used to identify the most salient features of the unknown field(s) which are subsequently enriched by invoking solvers operating at finer resolutions. This leads to significant computational savings particularly in problems involving computationally demanding forward models but also improvements in accuracy. It is based on a novel, adaptive scheme based on Sequential Monte Carlo sampling which is embarrassingly parallelizable and circumvents issues with slow mixing encountered in Markov Chain Monte Carlo schemes. The capabilities of the proposed methodology are illustrated in problems from nonlinear solid mechanics with special attention to cases where the data is contaminated with random noise and the scale of variability of the unknown field is smaller than the scale of the grid where observations are collected. 相似文献
49.
50.
Alessandro Antonucci Yi Sun Marco Zaffalon 《International Journal of Approximate Reasoning》2010,51(5):474-484
Credal networks generalize Bayesian networks by relaxing the requirement of precision of probabilities. Credal networks are considerably more expressive than Bayesian networks, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal networks. The algorithm is based on an important representation result we prove for general credal networks: that any credal network can be equivalently reformulated as a credal network with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal network is then updated by L2U, a loopy approximate algorithm for binary credal networks. Overall, we generalize L2U to non-binary credal networks, obtaining a scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences with respect to other state-of-the-art algorithms is evaluated by extensive numerical tests. 相似文献