首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   149篇
  免费   6篇
管理学   41篇
民族学   1篇
人口学   5篇
丛书文集   5篇
理论方法论   9篇
综合类   17篇
社会学   24篇
统计学   53篇
  2022年   1篇
  2021年   2篇
  2020年   3篇
  2019年   4篇
  2018年   2篇
  2017年   8篇
  2016年   4篇
  2015年   7篇
  2014年   13篇
  2013年   37篇
  2012年   10篇
  2011年   3篇
  2010年   3篇
  2009年   9篇
  2008年   7篇
  2007年   5篇
  2006年   6篇
  2005年   4篇
  2004年   2篇
  2003年   4篇
  2002年   1篇
  2001年   3篇
  2000年   5篇
  1999年   1篇
  1998年   1篇
  1997年   3篇
  1994年   1篇
  1993年   2篇
  1992年   1篇
  1986年   2篇
  1970年   1篇
排序方式: 共有155条查询结果,搜索用时 468 毫秒
101.
国际垄断资本主义在世界事物中起着主导作用,它自身还有发展的空间和潜力,社会主义力量还没有成熟到能与其相对抗的地步,由此决定当今时代的性质是国际垄断资本主义时代。在这个时代,资本主义的固有矛盾和历史局限性没有改变,时代的发展方向仍是社会主义。社会主义制度作为20世纪产生的新事物,将在向资本主义学习并同其斗争的过程中,发展壮大和成熟起来。代替国际垄断资本主义时代的将是社会主义新时代。  相似文献   
102.
情感在德育过程中具有不可忽视的作用,我国高校德育低效与忽视学生的情感体验有关。要从提高教师情感素质、了解当代大学生情感倾向以及在德育认知和实践过程中强化情感体验几方面努力以增强高校德育效果。  相似文献   
103.
在相转移催化剂存在下,以十二醇为主要原料,经过一系列反应,合成了新型表面活性剂添加剂——十二烷基-2-羟乙基亚砜,并研究了溶剂、温度、时间、催化剂及氧化剂对各步反应的影响  相似文献   
104.
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. A parity edge-coloring (respectively, strong parity edge-coloring) is an edge-coloring in which there is no nontrivial parity path (respectively, open parity walk). The parity edge-chromatic number p(G) (respectively, strong parity edge-chromatic number $\widehat{p}(G)$ ) is the least number of colors in a parity edge-coloring (respectively, strong parity edge-coloring) of G. Notice that $\widehat{p}(G) \ge p(G) \ge \chi'(G) \ge \Delta(G)$ for any graph G. In this paper, we determine $\widehat{p}(G)$ and p(G) for some complete bipartite graphs and some products of graphs. For instance, we determine $\widehat{p}(K_{m,n})$ and p(K m,n ) for mn with n≡0,?1,?2 (mod 2?lg?m?).  相似文献   
105.
System characteristics of a redundant repairable system with two primary units and one standby are studied from a Bayesian viewpoint with different types of priors assumed for unknown parameters, in which the coverage factor is the same for an operating unit failure as that for a standby unit failure. Times to failure and times to repair of the operating and standby units are assumed to follow exponential distributions. When times to failure and times to repair with uncertain parameters, a Bayesian approach is adopted to evaluate system characteristics. Monte Carlo simulation is used to derive the posterior distribution for the mean time to system failure and the steady-state availability. Some numerical experiments are performed to illustrate the results derived in this paper.  相似文献   
106.
Cox and Oakes (1984 Cox , D. R. , Oakes , D. ( 1984 ). Analysis of Survival Data . New York : Chapman & Hall . [Google Scholar]) claimed that a model satisfies the accelerated lifetime (AL) model and the proportional hazards (PH) model iff it is Weibull. Doksum and Nabeya (1984 Doksum , K. A. , Nabeya , S. ( 1984 ). Estimation in proportional hazards and log-linear models . J. Statist. Plann. Infer. 9 : 297303 .[Crossref], [Web of Science ®] [Google Scholar]) constructed a family of analytic non Weibull survival functions that satisfies both the PH and AL models. We further study the relationship between the PH, AL, Lehmann, and Weibull models without the restriction of absolute continuity.  相似文献   
107.
There are three types of multiple comparisons: all-pairwise multiple comparisons (MCA), multiple comparisons with the best (MCB), and multiple comparisons with a control (MCC). There are also three levels of multiple comparisons inference: confidence sets, subset comparisons, test of homogeneity. In current practice, MCA procedures dominate. In correct attempts at more efficient comparisons, in the form of employing lower level MCA procedures for higher level inference, account for the most frequent abuses in multiple comparisons. A better strategy is to choose the correct type of inference at the level of inference desired. In particular, very often the simulataneous comparisons of each treatment with the best of the other treatments (MCB) suffice. Hsu (1984b) gave simultaneous confidence intervals for θi ? maxj≠iθj having the simple form [? (Yi ?maxj≠i Yj ? C) (Yi?maxj≠i Yj + C)+]. Those intervals were constrained, sothat even if a treatment is inferred to be the best, no positive bound on how much it is better thatn the rest is given, a somewhat undesirable property. In this article it is shown that by employing a slightly larger critical value, the nonpositivity constraint on the lower bound is removed.  相似文献   
108.
109.
The five steps of the theory of constraints (TOC) emphasize exploiting constraints in order to increase the throughput of a system. The product mix decision is one application of the TOC five steps. However, these steps were considered to be implicit or incomplete, the criticism being that they result in deriving an infeasible solution when a plant has multiple resource constraints. This paper follows the essence of these five steps and presents an explicit algorithm to address the problem. When testing its effectiveness by using a dual-simplex method with bounded variables, this algorithm gives the same result in each iteration.  相似文献   
110.
This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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