首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   165篇
  免费   16篇
  国内免费   4篇
  185篇
  2024年   3篇
  2023年   4篇
  2022年   9篇
  2021年   7篇
  2020年   6篇
  2019年   11篇
  2018年   5篇
  2017年   4篇
  2016年   4篇
  2014年   5篇
  2013年   8篇
  2012年   4篇
  2011年   2篇
  2010年   3篇
  2009年   3篇
  2008年   5篇
  2007年   9篇
  2006年   7篇
  2005年   4篇
  2004年   7篇
  2003年   6篇
  2002年   6篇
  2000年   3篇
  1999年   4篇
  1998年   3篇
  1997年   2篇
  1996年   5篇
  1995年   3篇
  1994年   1篇
  1993年   5篇
  1992年   4篇
  1990年   5篇
  1989年   3篇
  1988年   4篇
  1987年   1篇
  1986年   4篇
  1984年   1篇
  1983年   4篇
  1982年   2篇
  1981年   1篇
  1980年   2篇
  1979年   1篇
  1978年   1篇
  1977年   2篇
  1976年   2篇
排序方式: 共有185条查询结果,搜索用时 15 毫秒
101.
    
In exploratory factor analysis, latent factors and factor loadings are seldom interpretable until analytic rotation is performed. Typically, the rotation problem is solved by numerically searching for an element in the manifold of orthogonal or oblique rotation matrices such that the rotated factor loadings minimize a pre-specified complexity function. The widely used gradient projection (GP) algorithm, although simple to program and able to deal with both orthogonal and oblique rotation, is found to suffer from slow convergence when the number of manifest variables and/or the number of latent factors is large. The present work examines the effectiveness of two Riemannian second-order algorithms, which respectively generalize the well-established truncated Newton and trust-region strategies for unconstrained optimization in Euclidean spaces, in solving the rotation problem. When approaching a local minimum, the second-order algorithms usually converge superlinearly or even quadratically, better than first-order algorithms that only converge linearly. It is further observed in Monte Carlo studies that, compared to the GP algorithm, the Riemannian truncated Newton and trust-region algorithms require not only much fewer iterations but also much less processing time to meet the same convergence criterion, especially in the case of oblique rotation.  相似文献   
102.
    
This paper proposes a step‐by‐step decision making approach that incorporates preferences of a decision maker into a many‐objective evolutionary algorithm. The algorithm is applied to a challenging many‐objective optimization problem (MaOP) involving integer objective values, tight constraints, heavy computational burden, and limited knowledge about the true Pareto front. The proposed method consists of five steps. (a) The entire Pareto front with high dimensions is roughly approximated by a small set of nondominated solutions. (b) On the basis of the approximated Pareto front, the decision maker specifies a preference. (c) Reference points are distributed through part of the objective space using the preference information. (d) The approximation accuracy of the Pareto front in the region of interest is improved by local search using the reference points. (e) The most preferred solution from a set of the nondominated solutions is chosen. The evolutionary algorithms employed in Steps (a) and (d) have an improved normalization procedure and selection mechanism for the MaOP involving integer objective value(s) and the tight constraints. Steps (b) and (e) use a graphical‐user‐interface‐based interactive tool we developed to efficiently narrow down to the preferred solution(s) among the high‐dimensional, nondominated solutions. This alleviates the cognitive burden on the decision maker and therefore aids the decision maker in handling MaOPs. In the computational experiment, we choose the real‐world application of reconfiguring an electricity distribution network. We demonstrate that the proposed approach can provide satisfying solutions to a decision maker.  相似文献   
103.
    
Demand Response (DR) is a key attribute to enhance the operation of smart grid. Demand response improves the performance of the electric power systems and also deals with peak demand issues. Demand Response (DR) implementation for residential consumers is potentially accredited by Home Energy Management System (HEMS). This paper presents an algorithm for home energy management system to shift the schedulable loads in a residential home, that neglects consumer discomfort and minimizes electricity bill of energy consumption using Hourly-Time-Of-Use (HTOU) pricing scheme. Supervised learning algorithm is used in this paper to learn the usage patterns of consumers to allow schedulable appliances at a residential home to autonomously overcome consumer discomfort. Simulation results confirms that the proposed algorithm effectively decreases consumer electricity bill, decreases peak load demand and also avoids consumer discomfort.  相似文献   
104.
IRT模型参数估计的新方法——MCMC算法   总被引:1,自引:0,他引:1  
本研究主要探讨MCMC算法在IRT模型参数估计中的实现及其估计精度.通过模拟多种实验条件(人少题少、人题适中、人多题多、被试数及其参数固定情况下项目数变化、项目数及其参数固定情况下人数变化),考察两参数和叁参数Logistic模型的MCMC算法对其参数估计的精度,并与国际通用测量程序-Bilog程序(E-M算法)进行比较研究.模拟实验研究表明,上述各种实验条件下,MCMC算法均可用于IRT模型参数估计,且其估计的精度均较Bilog程序(E-M算法)高,值得推广.  相似文献   
105.
提出了一种改进的分层并行演化算法。针对传统算法中"同构子种群"和"同步通信"所引发的问题,新算法构建了异构模型,并将各子种群充分连接。子种群一旦满足迁移条件,便可按照预设的迁移模式实施异步迁移。仿真实验结果表明,本文提出的新算法有效地解决了"征服问题"和"无效问题",避免了算法的过早收敛,提高了算法的效率。  相似文献   
106.
Abstract: At least two types of models, the vector model and the unfolding model can be used for the analysis of dichotomous choice data taken from, for example, the pick any/ n method. The previous vector threshold models have a difficulty with estimation of the nuisance parameters such as the individual vectors and thresholds. This paper proposes a new probabilistic vector threshold model, where, unlike the former vector models, the angle that defines an individual vector is a random variable, and where the marginal maximum likelihood estimation method using the expectation-maximization algorithm is adopted to avoid incidental parameters. The paper also attempts to discuss which of the two models is more appropriate to account for dichotomous choice data. Two sets of dichotomous choice data are analyzed by the model.  相似文献   
107.
多维项目反应理论因其模型本身的天然优势及其兼具因素分析与项目反应理论于一身的优点,而被广大研究者及应用者所重视.本研究在前人研究基础上,重点讨论MIRT多维能力及能力间相关矩阵的参数估计问题.研究采用Monte Carlo模拟方法进行,在三因素完全随机设计(4 ×3×3)下,使用MCMC算法,探讨测验维度数、维度间的相关大小和测验项目数三个因素对MIRT能力及其相关矩阵估计的影响.  相似文献   
108.
Temporalising Tableaux   总被引:1,自引:0,他引:1  
As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order fragments can be used for constructing a tableau algorithm for the corresponding monodic fragment of FOTL. Some example instantiations of the framework are presented.  相似文献   
109.
A new algorithm to obtain the least-squares or MINRES solution in common factor analysis is presented. It is based on the up-and-down Marquardt algorithm developed by the present authors for a general nonlinear least-squares problem. Experiments with some numerical models and some empirical data sets showed that the algorithm worked nicely and that SMC (Squared Multiple Correlation) performed best among four sets of initial values for common variances but that the solution might sometimes be very sensitive to fluctuations in the sample covariance matrix.Numerical computation was made on a NEAC S-1000 computer in the Computer Center, Osaka University.  相似文献   
110.
朱玮  丁树良  陈小攀 《心理学报》2006,38(3):453-460
对IRT的双参数Logistic模型(2PLM)中未知参数估计问题,给出了一个新的估计方法――最小化χ2/EM估计。新方法在充分考虑项目反应理论(IRT)与经典测量理论(CTT)之间的差异的前提下,从统计计算的角度改进了Berkson的最小化χ2估计,取消了Berkson实施最小化χ2估计时需要已知能力参数的不合实际的前提,扩大了应用范围。实验结果表明新方法能力参数的估计结果与BILOG相比,精确度要高,且当样本容量超过2000时,项目参数的估计结果也优于BILOG。实验还表明新方法稳健性好  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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