全文获取类型
收费全文 | 342篇 |
免费 | 5篇 |
国内免费 | 3篇 |
专业分类
管理学 | 119篇 |
人口学 | 3篇 |
丛书文集 | 7篇 |
理论方法论 | 3篇 |
综合类 | 98篇 |
社会学 | 9篇 |
统计学 | 111篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 14篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 6篇 |
2013年 | 34篇 |
2012年 | 20篇 |
2011年 | 10篇 |
2010年 | 18篇 |
2009年 | 25篇 |
2008年 | 23篇 |
2007年 | 21篇 |
2006年 | 18篇 |
2005年 | 15篇 |
2004年 | 14篇 |
2003年 | 18篇 |
2002年 | 17篇 |
2001年 | 13篇 |
2000年 | 14篇 |
1999年 | 9篇 |
1998年 | 3篇 |
1997年 | 7篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1987年 | 3篇 |
排序方式: 共有350条查询结果,搜索用时 15 毫秒
1.
H. Haario M. Laine M. Lehtinen E. Saksman J. Tamminen 《Journal of the Royal Statistical Society. Series B, Statistical methodology》2004,66(3):591-607
Summary. We discuss the inversion of the gas profiles (ozone, NO3 , NO2 , aerosols and neutral density) in the upper atmosphere from the spectral occultation measurements. The data are produced by the 'Global ozone monitoring of occultation of stars' instrument on board the Envisat satellite that was launched in March 2002. The instrument measures the attenuation of light spectra at various horizontal paths from about 100 km down to 10–20 km. The new feature is that these data allow the inversion of the gas concentration height profiles. A short introduction is given to the present operational data management procedure with examples of the first real data inversion. Several solution options for a more comprehensive statistical inversion are presented. A direct inversion leads to a non-linear model with hundreds of parameters to be estimated. The problem is solved with an adaptive single-step Markov chain Monte Carlo algorithm. Another approach is to divide the problem into several non-linear smaller dimensional problems, to run parallel adaptive Markov chain Monte Carlo chains for them and to solve the gas profiles in repetitive linear steps. The effect of grid size is discussed, and we present how the prior regularization takes the grid size into account in a way that effectively leads to a grid-independent inversion. 相似文献
2.
通过适当地选择参数改进了推广的Paillier(G-Paillier)加密体制,减少运算量,提高了加密体制的效率;证明了改进后加密体制的安全性(单向性、语意安全性)与G-Paillier加密体制的安全性是等价的。 相似文献
3.
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivation is to bring some uniformity to the proposal, comparison, and knowledge exchange among the traditionally opposite kinds of serial and parallel GAs. We comparatively analyze the properties of steady-state, generational, and cellular genetic algorithms. Afterwards, this study is extended to consider a distributed model consisting in a ring of GA islands. The analyzed features are the time complexity, selection pressure, schema processing rates, efficacy in finding an optimum, efficiency, speedup, and resistance to scalability. Besides that, we briefly discuss how the migration policy affects the search. Also, some of the search properties of cellular GAs are investigated. The selected benchmark is a representative subset of problems containing real world difficulties. We often conclude that parallel GAs are numerically better and faster than equivalent sequential GAs. Our aim is to shed some light on the advantages and drawbacks of various sequential and parallel GAs to help researchers using them in the very diverse application fields of the evolutionary computation. 相似文献
4.
SONET (Synchronous Optical NETworks) add-drop multiplexers (ADMs) are the dominant cost factor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Previous works took as input the traffic streams with routings given a priori and developed various heuristics for wavelength assignment to minimize the SONET ADM costs. However, little was known about the performance guarantees of these heuristics. This paper contributes mainly in two aspects. First, in addition to the traffic streams with pre-specified routing, this paper also studies minimizing the ADM requirement by traffic streams without given routings, a problem which is shown to be NP-hard. Several heuristics for integrated routing and wavelength assignment are proposed to minimize the SONET ADM costs. Second, the approximation ratios of those heuristics for wavelength assignment only and those heuristics for integrated routing and wavelength assignment are analyzed. The new Preprocessed Iterative Matching heuristic has the best approximation ratio: at most 3/2. 相似文献
5.
James P. McDermott G. Jogesh Babu John C. Liechty Dennis K. J. Lin 《Statistics and Computing》2007,17(4):311-321
We consider the problem of density estimation when the data is in the form of a continuous stream with no fixed length. In
this setting, implementations of the usual methods of density estimation such as kernel density estimation are problematic.
We propose a method of density estimation for massive datasets that is based upon taking the derivative of a smooth curve
that has been fit through a set of quantile estimates. To achieve this, a low-storage, single-pass, sequential method is proposed
for simultaneous estimation of multiple quantiles for massive datasets that form the basis of this method of density estimation.
For comparison, we also consider a sequential kernel density estimator. The proposed methods are shown through simulation
study to perform well and to have several distinct advantages over existing methods. 相似文献
6.
7.
This paper deals with techniques for obtaining random point samples from spatial databases. We seek random points from a continuous domain (usually 2) which satisfy a spatial predicate that is represented in the database as a collection of polygons. Several applications of spatial sampling (e.g. environmental monitoring, agronomy, forestry, etc) are described. Sampling problems are characterized in terms of two key parameters: coverage (selectivity), and expected stabbing number (overlap). We discuss two fundamental approaches to sampling with spatial predicates, depending on whether we sample first or evaluate the predicate first. The approaches are described in the context of both quadtrees and R-trees, detailing the sample first, acceptance/rejection tree, and partial area tree algorithms. A sequential algorithm, the one-pass spatial reservoir algorithm is also described. The relative performance of the various sampling algorithms is compared and choice of preferred algorithms is suggested. We conclude with a short discussion of possible extensions. 相似文献
8.
资源约束型项目调度的优化是一个NP-hard问题,其求解难度随着资源约束项的增多呈指数方式增长,传统的基于Excel表的手工优化方法不能及时计算出有效的资源配置方式,从而影响项目管理人员的资源调度.针对多资源约束型项目调度的优化问题提出基于遗传算法的资源约束型项目调度的优化方法,该算法采用基于活动优先权的十进制编码方式,结合活动的存储邻接矩阵,有效地解决活动调度违例现象;运用优先抢占模式的资源分配方式安排活动资源,避免资源分配中的冲突问题;并为该算法设计了启发式遗传算法的C语言程序,通过计算机的多次迭代运算得出满足资源约束的最优工期.实践结果表明,遗传算法可以快速有效地解决企业项目调度的优化问题,适合在企业项目进度管理中推广运用. 相似文献
9.
提出一种将遗传算法与启发式规则、模拟退火法等搜索方法结合在一起的杂合遗传算法,用于求解工艺路线可变的JobShop调度问题。通过对某双极型集成电路封装企业的JobShop调度仿真,结果表明算法是有效和可行的。 相似文献
10.
通过分析ERP项目的特点,将学习曲线引入到ERP实施的研究中,基于学习曲线理论刻画企业的工作效率随项目时间变化的规律.在此基础上,将ERP项目抽象为前期的培训和后期的具体实施两个阶段,以项目实施周期和咨询成本最小为目标,建立ERP实施培训时间决策模型,通过培训时间控制并预测ERP项目的整体周期,进一步利用遗传算法对模型进行优化求解.为区分信息化基础不同的企业在项目初期工作效率的差异,在模型中加入初始工作效率这一变量,通过企业的信息化基础水平间接地测算企业的初始工作效率;结合行为导向的实证研究结果,在模型中限定培训时间的取值范围,解决多个近似解之间的取舍问题.案例研究表明,模型在实际应用中可以起到较好的优化和预测效果,能够为企业制定ERP项目计划和投资预算提供决策支持. 相似文献