首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1543篇
  免费   54篇
  国内免费   32篇
管理学   445篇
民族学   3篇
人才学   1篇
人口学   14篇
丛书文集   88篇
理论方法论   20篇
综合类   884篇
社会学   14篇
统计学   160篇
  2024年   7篇
  2023年   18篇
  2022年   32篇
  2021年   24篇
  2020年   31篇
  2019年   37篇
  2018年   34篇
  2017年   42篇
  2016年   43篇
  2015年   72篇
  2014年   75篇
  2013年   112篇
  2012年   105篇
  2011年   109篇
  2010年   90篇
  2009年   112篇
  2008年   95篇
  2007年   93篇
  2006年   83篇
  2005年   67篇
  2004年   73篇
  2003年   51篇
  2002年   49篇
  2001年   35篇
  2000年   33篇
  1999年   21篇
  1998年   15篇
  1997年   18篇
  1996年   11篇
  1995年   10篇
  1994年   8篇
  1993年   3篇
  1992年   5篇
  1991年   5篇
  1990年   3篇
  1989年   3篇
  1988年   2篇
  1987年   3篇
排序方式: 共有1629条查询结果,搜索用时 515 毫秒
31.
历史文化资源是城市特有文化形态的依托和我体。能否挖掘、保护、梳理好历史文化资源,关系到城市优秀历史文化的继承与弘扬,关涉到城市未来的发展与走向。历史文化资源,不但要挖掘、整理、保护,更要优化。优化历史文化资源,就是在文明的大背景下,系统梳理历史文化资源,理清历史发展脉络,理清文明发展足迹,理清优秀历史文化传统,进而树立鲜明的城市文化形象,增强城市文化软实力。  相似文献   
32.
通过对某大型施工企业多个铁路、公路施工项目部的调查,总结了企业当前投标优化方面存在的问题。针对企业以铁路、公路项目为主业的特点,提出了优势项目滚动发展、建立有效激励制度、做好投标准备、优化施工组织设计、应用报价技巧等优化对策。对于施工企业改善市场经营效果,提高中标质量,增加项目盈利有重要的借鉴作用。  相似文献   
33.
As flood risks grow worldwide, a well‐designed insurance program engaging various stakeholders becomes a vital instrument in flood risk management. The main challenge concerns the applicability of standard approaches for calculating insurance premiums of rare catastrophic losses. This article focuses on the design of a flood‐loss‐sharing program involving private insurance based on location‐specific exposures. The analysis is guided by a developed integrated catastrophe risk management (ICRM) model consisting of a GIS‐based flood model and a stochastic optimization procedure with respect to location‐specific risk exposures. To achieve the stability and robustness of the program towards floods with various recurrences, the ICRM uses stochastic optimization procedure, which relies on quantile‐related risk functions of a systemic insolvency involving overpayments and underpayments of the stakeholders. Two alternative ways of calculating insurance premiums are compared: the robust derived with the ICRM and the traditional average annual loss approach. The applicability of the proposed model is illustrated in a case study of a Rotterdam area outside the main flood protection system in the Netherlands. Our numerical experiments demonstrate essential advantages of the robust premiums, namely, that they: (1) guarantee the program's solvency under all relevant flood scenarios rather than one average event; (2) establish a tradeoff between the security of the program and the welfare of locations; and (3) decrease the need for other risk transfer and risk reduction measures.  相似文献   
34.
In this paper, some new algorithms for estimating the biasing parameters of the ridge, Liu and two-parameter estimators are introduced with the help of genetic algorithm (GA). The proposed algorithms are based on minimizing some statistical measures such as mean square error (MSE), mean absolute error (MAE) and mean absolute prediction error (MAPE). At the same time, the new algorithms allow one to keep the condition number and variance inflation factors to be less than or equal to ten by means of the GA. A numerical example is presented to show the utility of the new algorithms. In addition, an extensive Monte Carlo experiment is conducted. The numerical findings prove that the proposed algorithms enable to eliminate the problem of multicollinearity and minimize the MSE, MAE and MAPE.  相似文献   
35.
杨勇  冯霞 《太平洋学报》2012,20(3):30-38
本文根据中国—东盟区域合作发展的政治合作机制的概念及呈现的多维特性,运用政治合作的目标分解和构成要素,对政治合作机制进行综合的结构分析。通过利益泛化(低度)、制度分化(中度)和价值固化(深度)生成的三个阶段性使命目标(和睦共享、和平共处与和谐共荣)合作过程的剖析,对中国—东盟政治合作机制建设的结构性问题进行探讨,以此助推区域政治合作机制的改进和优化。  相似文献   
36.
联运企业的效益受运输路径和运输方式的影响。如何降低联运成本、提高联运企业的效益,已成为学术研究的重中之重。针对集装箱公铁联运路径优化问题,以运输成本、换装成本、储存成本、时间惩罚成本构成的运输总成本为目标函数,建立集装箱公铁联运路径优化模型,考虑运输时间限制、班期限制、节点储存成本,得出使运输总成本最低的运输路径及运输方式,并利用算例验证模型的有效性。  相似文献   
37.
In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.  相似文献   
38.
Abstract

Grubbs and Weaver (1947 Grubbs, F. E., and C. L. Weaver. 1947. The best unbiased estimate of population standard deviation based on group ranges. Journal of the American Statistical Association 42 (238):22441. doi: 10.2307/2280652.[Taylor & Francis Online], [Web of Science ®] [Google Scholar]) suggest a minimum-variance unbiased estimator for the population standard deviation of a normal random variable, where a random sample is drawn and a weighted sum of the ranges of subsamples is calculated. The optimal choice involves using as many subsamples of size eight as possible. They verified their results numerically for samples of size up to 100, and conjectured that their “rule of eights” is valid for all sample sizes. Here we examine the analogous problem where the underlying distribution is exponential and find that a “rule of fours” yields optimality and prove the result rigorously.  相似文献   
39.
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.  相似文献   
40.
This article extends the previous research of consecutive attacks strategy by assuming that an attacker observes the outcome of each attack imperfectly. With given probabilities it may wrongly identify a destroyed target as undestroyed, and wrongly identify an undestroyed target as destroyed. The outcome of each attack is determined by a contest success function that depends on the amount of resources allocated by the defender and the attacker to each attack. The article suggests a probabilistic model of the multiple attacks and analyzes how the target destruction probability and the attacker's relative resource expenditure are impacted by the two probabilities of incorrect observation, the attacker's and defender's resource ratio, the contest intensity, the number of attacks, and the resource distribution across attacks. We analyze how the attacker chooses the number of attacks, the attack stopping rule, and the optimal resource distribution across attacks to maximize its utility.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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