首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1842篇
  免费   223篇
  国内免费   33篇
化学   102篇
晶体学   2篇
力学   39篇
综合类   17篇
数学   835篇
物理学   288篇
无线电   815篇
  2024年   7篇
  2023年   27篇
  2022年   77篇
  2021年   106篇
  2020年   86篇
  2019年   78篇
  2018年   63篇
  2017年   64篇
  2016年   110篇
  2015年   89篇
  2014年   134篇
  2013年   217篇
  2012年   101篇
  2011年   116篇
  2010年   97篇
  2009年   97篇
  2008年   95篇
  2007年   100篇
  2006年   71篇
  2005年   58篇
  2004年   34篇
  2003年   44篇
  2002年   28篇
  2001年   26篇
  2000年   15篇
  1999年   21篇
  1998年   20篇
  1997年   11篇
  1996年   10篇
  1995年   10篇
  1994年   11篇
  1993年   6篇
  1992年   8篇
  1991年   8篇
  1990年   6篇
  1989年   5篇
  1988年   9篇
  1987年   11篇
  1986年   3篇
  1985年   3篇
  1984年   6篇
  1983年   2篇
  1982年   1篇
  1980年   1篇
  1979年   2篇
  1977年   1篇
  1976年   1篇
  1973年   2篇
排序方式: 共有2098条查询结果,搜索用时 15 毫秒
91.
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.  相似文献   
92.
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  相似文献   
93.
Email: kchang{at}gmu.eduEmail: RobertFung{at}Fairlsaac.comEmail: alan.lucas{at}hotmail.comEmail: 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.  相似文献   
94.
设计了基于写相关支持向量描述的安全审计模型来实现一个新的单类分类器,对系统调用中“写性质”子集进行监视和分析,并以此训练单类分类器,使偏离正常模式的活动都被认为是潜在的入侵。该模型仅利用正常样本建立了单分类器,因此系统还具有对新的异常行为进行检测的能力。通过对主机系统执行迹国际标准数据集的优化处理,只利用少量的训练样本,实验获得了对异常样本100%的检测率,而平均虚警率接近为0。  相似文献   
95.
This paper deals with the problem of unsupervised image segmentation which consists in first mixture identification phase and second a Bayesian decision phase. During the mixture identification phase, the conditional probability density function (pdf) and the a priori class probabilities must be estimated. The most difficult part is the estimation of the number of pixel classes or in other words the estimation of the number of density mixture components. To resolve this problem, we propose here a Stochastic and Nonparametric Expectation-Maximization (SNEM) algorithm. The algorithm finds the most likely number of classes, their associated model parameters and generates a segmentation of the image by classifying the pixels into these classes. The non-parametric aspect comes from the use of the orthogonal series estimator. Experimental results are promising, we have obtained accurate results on a variety of real images.  相似文献   
96.
This paper presents a middleware platform for managing devices that operate in heterogeneous environments. The proposed management framework supports terminal-controlled, preference-based access network selection. Two separate problems are identified in this domain: one involving the computation of optimal allocations of services to access networks and quality levels (service configuration), and one concerning the dynamic inference of the user’s preferences, according to the usage context (user profiling). This paper includes an approach to the definition, mathematical formulation and solution of both these problems. Indicative results of the proposed solution methods are presented in the context of a real-life scenario simulating a day in the life of an ordinary user.  相似文献   
97.
一种基于贝叶斯网络的雷达重频模式识别方法   总被引:1,自引:0,他引:1  
雷达重频模式指雷达脉冲重复间隔(PRI)的调制样式,重频模式识别对于雷达型号、类别识别具有重要支持作用,但这是一个较困难的过程,一般难以通过单一重频特征完成多种复杂重频模式的自动识别。本文为解决雷达多重频模式自动识别及识别抗噪声干扰问题,针对多种重频模式提取了几种PRI序列特征量(重频特征),然后引入了贝叶斯多网络分类器(BMNClassifier),利用所提取的特征量作为贝叶斯多网络分类器输入节点,通过贝叶斯多网络分类器的概率推理能力来实现雷达重频模式识别。  相似文献   
98.
Approximate importance sampling Monte Carlo for data assimilation   总被引:1,自引:0,他引:1  
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.  相似文献   

99.
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.  相似文献   
100.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号