首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   637篇
  免费   20篇
  国内免费   1篇
管理学   86篇
民族学   4篇
人口学   48篇
丛书文集   2篇
理论方法论   70篇
综合类   5篇
社会学   353篇
统计学   90篇
  2021年   2篇
  2020年   12篇
  2019年   10篇
  2018年   19篇
  2017年   17篇
  2016年   22篇
  2015年   8篇
  2014年   11篇
  2013年   116篇
  2012年   17篇
  2011年   24篇
  2010年   13篇
  2009年   12篇
  2008年   15篇
  2007年   23篇
  2006年   20篇
  2005年   13篇
  2004年   16篇
  2003年   17篇
  2002年   22篇
  2001年   16篇
  2000年   14篇
  1999年   12篇
  1998年   7篇
  1997年   10篇
  1996年   15篇
  1995年   7篇
  1994年   7篇
  1993年   8篇
  1992年   14篇
  1991年   9篇
  1990年   7篇
  1989年   7篇
  1988年   8篇
  1987年   10篇
  1986年   6篇
  1985年   11篇
  1984年   6篇
  1983年   13篇
  1982年   11篇
  1981年   9篇
  1980年   4篇
  1979年   6篇
  1978年   4篇
  1977年   3篇
  1976年   7篇
  1975年   4篇
  1974年   3篇
  1971年   3篇
  1969年   3篇
排序方式: 共有658条查询结果,搜索用时 15 毫秒
651.
A bookmaker takes bets on a two-horse race, attempting to minimize expected loss over all possible outcomes of the race. Profits are controlled by manipulation of customer' betting behavior; in order to do this, we need some information about the probability distribution which describes how the customers will bet. We examine what information initial customer' betting behavior provides about this probability distribution, and consider how to use this to estimate the probability distribution for remaining customers.  相似文献   
652.
653.
This article considers a discrete-time Markov chain for modeling transition probabilities when multiple successive observations are missing at random between two observed outcomes using three methods: a na\"?ve analog of complete-case analysis using the observed one-step transitions alone, a non data-augmentation method (NL) by solving nonlinear equations, and a data-augmentation method, the Expectation-Maximization (EM) algorithm. The explicit form of the conditional log-likelihood given the observed information as required by the E step is provided, and the iterative formula in the M step is expressed in a closed form. An empirical study was performed to examine the accuracy and precision of the estimates obtained in the three methods under ignorable missing mechanisms of missing completely at random and missing at random. A dataset from the mental health arena was used for illustration. It was found that both data-augmentation and nonaugmentation methods provide accurate and precise point estimation, and that the na\"?ve method resulted in estimates of the transition probabilities with similar bias but larger MSE. The NL method and the EM algorithm in general provide similar results whereas the latter provides conditional expected row margins leading to smaller standard errors.  相似文献   
654.
655.
656.
657.
Many observers are dissatisfied with the accounting profession's ability to warn the public of upcoming bankruptcy filings. Since regulators and users tend to treat an unmodified audit opinion as a “clean bill of health,” they do not expect the business to fail in the near future. Research has shown that more often than not, auditors end up letting users down when it comes to predicting bankruptcy filings with audit opinions. Although auditors assert they are not responsible for predicting future events, it is very clear that their opinion decision is evaluated, at least in part, based on events that occur after the audit report date. The interesting and logical next step is to find out how companies exit bankruptcy. Do they liquidate or reorganize? Successful reorganization may, in the end, exonerate auditors and preserve their role as an early warning device. The opinion prediction model developed in the paper introduces a new bankruptcy resolution variable that proxies for the auditor's prognosis of the ultimate disposition of the soon‐to‐be‐bankrupt company. Using a sample of bankruptcy filings between 1982 and 1992, we find that auditors do not seem to be able to predict filings or resolution. Our tests of bankruptcy resolution support what auditors have been arguing for years: that they are not clairvoyant with respect to a client's future.  相似文献   
658.
Expert critiquing systems are a rapidly growing class of intelligent decision support systems that apply artificial intelligence techniques to criticize a user's proposed solution to a problem. Critic programs now exist in the medical, engineering, programming, knowledge acquisition, word processing, and other domains. Critic refinement is a nontrivial activity that, even when done well, consumes a sizable fraction of the complete effort to build and deploy a critiquing system. To ease that effort, it is important to adopt a rigorous approach that allows one to reproducibly measure the degree of success of the current critic version and to predict which refinements will improve the critic further. The current article presents one such approach with actual case studies that illustrate its usage and elaborate selected aspects of the refinement process.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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