全文获取类型
收费全文 | 450篇 |
免费 | 11篇 |
国内免费 | 2篇 |
专业分类
管理学 | 110篇 |
民族学 | 1篇 |
人口学 | 4篇 |
丛书文集 | 14篇 |
理论方法论 | 6篇 |
综合类 | 180篇 |
社会学 | 15篇 |
统计学 | 133篇 |
出版年
2023年 | 2篇 |
2021年 | 5篇 |
2020年 | 6篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 12篇 |
2015年 | 18篇 |
2014年 | 18篇 |
2013年 | 60篇 |
2012年 | 20篇 |
2011年 | 24篇 |
2010年 | 24篇 |
2009年 | 26篇 |
2008年 | 25篇 |
2007年 | 21篇 |
2006年 | 22篇 |
2005年 | 23篇 |
2004年 | 25篇 |
2003年 | 13篇 |
2002年 | 15篇 |
2001年 | 6篇 |
2000年 | 15篇 |
1999年 | 13篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有463条查询结果,搜索用时 15 毫秒
11.
通过收集石油套管现场失效数据资料,以套管失效为顶事件建立了石油套管的故障树,该故障树共考虑了47个不同的基本事件。通过对套管故障树的分析,得到了套管失效故障树的一阶最小割集27个,二阶最小割集29个,四阶最小割集1个,确立了套管的主要失效形式为潜在损坏、套管挤毁、套管断裂及严重腐蚀,并提出了提高套管可靠性的措施。 相似文献
12.
Weicai Peng 《统计学通讯:理论与方法》2017,46(23):11880-11891
In this paper, we first introduces a tree model without degree boundedness restriction namely generalized controlled tree T, which is an extension of some known tree models, such as homogeneous tree model, uniformly bounded degree tree model, controlled tree model, etc. Then some limit properties including strong law of large numbers for generalized controlled tree-indexed non homogeneous Markov chain are obtained. Finally, we establish some entropy density properties, monotonicity of conditional entropy, and entropy properties for generalized controlled tree-indexed Markov chains. 相似文献
13.
《Omega》2015
Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana into some microregions. The problem is formulated as a multi-objective partitioning of the nodes of an undirected graph (or network) with the municipalities as the nodes and the roads connecting them as the edges of the graph. Maximizing the population homogeneity in the microregions, maximizing the variety of medical procedures offered in the microregions, and minimizing the inter-microregion distances to be traveled by patients are considered as three objective functions of the problem. An integer-coded multi-objective genetic algorithm is adopted as the optimization tool, which yields a significant improvement to the existing healthcare system map of the Parana State. The results obtained may have a strong impact on the healthcare system management in Parana. The model proposed here could be a useful tool to aid the decision-making in health management, as well as for better organization of any healthcare system, including those of other Brazilian States. 相似文献
14.
《Journal of Statistical Computation and Simulation》2012,82(10):1901-1911
ABSTRACTIn this paper, we propose an adaptive stochastic gradient boosting tree for classification studies with imbalanced data. The adjustment of cost-sensitivity and the predictive threshold are integrated together with a composite criterion into the original stochastic gradient boosting tree to deal with the issues of the imbalanced data structure. Numerical study shows that the proposed method can significantly enhance the classification accuracy for the minority class with only a small loss in the true negative rate for the majority class. We discuss the relation of the cost-sensitivity to the threshold manipulation using simulations. An illustrative example of the analysis of suboptimal health-state data in traditional Chinese medicine is discussed. 相似文献
15.
Youngjae Chang 《统计学通讯:模拟与计算》2013,42(8):1703-1726
Many tree algorithms have been developed for regression problems. Although they are regarded as good algorithms, most of them suffer from loss of prediction accuracy when there are many irrelevant variables and the number of predictors exceeds the number of observations. We propose the multistep regression tree with adaptive variable selection to handle this problem. The variable selection step and the fitting step comprise the multistep method. The multistep generalized unbiased interaction detection and estimation (GUIDE) with adaptive forward selection (fg) algorithm, as a variable selection tool, performs better than some of the well-known variable selection algorithms such as efficacy adaptive regression tube hunting (EARTH), FSR (false selection rate), LSCV (least squares cross-validation), and LASSO (least absolute shrinkage and selection operator) for the regression problem. The results based on simulation study show that fg outperforms other algorithms in terms of selection result and computation time. It generally selects the important variables correctly with relatively few irrelevant variables, which gives good prediction accuracy with less computation time. 相似文献
16.
张黎明 《北京科技大学学报(社会科学版)》2016,32(2):80-85
植物精怪的动物化是一种世界性民俗现象,在中国古代则有“木精为青牛”的说法。究其原因,这一观念的出现大约有三方面的影响因素:一是古代神话中植物神祗动物形貌的遗存;二是秦汉时期有“出土牛迎春”的礼俗,土牛、青牛与春天、树木关联在一起;三是中国古代有源远流长的青牛信仰,在魏晋南北朝时期尤为突出,这是“木精为青牛”说的民俗背景。 相似文献
17.
Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.
We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.
Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users. 相似文献
18.
This paper concerns the geometric treatment of graphical models using Bayes linear methods. We introduce Bayes linear separation as a second order generalised conditional independence relation, and Bayes linear graphical models are constructed using this property. A system of interpretive and diagnostic shadings are given, which summarise the analysis over the associated moral graph. Principles of local computation are outlined for the graphical models, and an algorithm for implementing such computation over the junction tree is described. The approach is illustrated with two examples. The first concerns sales forecasting using a multivariate dynamic linear model. The second concerns inference for the error variance matrices of the model for sales, and illustrates the generality of our geometric approach by treating the matrices directly as random objects. The examples are implemented using a freely available set of object-oriented programming tools for Bayes linear local computation and graphical diagnostic display. 相似文献
19.
D. C. Wickramarachchi B. L. Robertson M. Reale C. J. Price J. A. Brown 《Australian & New Zealand Journal of Statistics》2019,61(3):380-391
We present an algorithm for learning oblique decision trees, called HHCART(G). Our decision tree combines learning concepts from two classification trees, HHCART and Geometric Decision Tree (GDT). HHCART(G) is a simplified HHCART algorithm that uses linear structure in the training examples, captured by a modified GDT angle bisector, to define splitting directions. At each node, we reflect the training examples with respect to the modified angle bisector to align this linear structure with the coordinate axes. Searching axis parallel splits in this reflected feature space provides an efficient and effective way of finding oblique splits in the original feature space. Our method is much simpler than HHCART because it only considers one reflected feature space for node splitting. HHCART considers multiple reflected feature spaces for node splitting making it more computationally intensive to build. Experimental results show that HHCART(G) is an effective classifier, producing compact trees with similar or better results than several other decision trees, including GDT and HHCART trees. 相似文献
20.