全文获取类型
收费全文 | 440篇 |
免费 | 8篇 |
国内免费 | 2篇 |
专业分类
管理学 | 172篇 |
民族学 | 2篇 |
人口学 | 7篇 |
丛书文集 | 6篇 |
理论方法论 | 5篇 |
综合类 | 97篇 |
社会学 | 13篇 |
统计学 | 148篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 11篇 |
2018年 | 4篇 |
2017年 | 16篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 68篇 |
2012年 | 25篇 |
2011年 | 18篇 |
2010年 | 20篇 |
2009年 | 24篇 |
2008年 | 33篇 |
2007年 | 26篇 |
2006年 | 20篇 |
2005年 | 16篇 |
2004年 | 17篇 |
2003年 | 20篇 |
2002年 | 16篇 |
2001年 | 13篇 |
2000年 | 16篇 |
1999年 | 12篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1987年 | 3篇 |
1983年 | 1篇 |
排序方式: 共有450条查询结果,搜索用时 15 毫秒
11.
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. 相似文献
12.
This paper presents a genetic algorithm (GA) for parallel redundancy optimization in series-parallel power systems exhibiting
multi-state behavior, optimizing the reliability subject to constraints. The components are binary and chosen from a list
of products available in the market, and are being characterized by their feeding capacity, reliability, cost and weight.
System reliability is defined as the ability to satisfy consumer demand and is presented as a piecewise cumulative load curve.
In GA, to handle infeasible solutions penalty strategies are used. Penalty technique keep a certain amount of infeasible solutions
in each generation so as to enforce genetic search towards an optimal solution from sides of, both, feasible and infeasible
regions. We here present a dynamic adaptive penalty function which helps the algorithm to search efficiently for optimal/near
optimal solution. To evaluate system reliability, a fast procedure, based on universal generating function, is used. An example
considering a multi-state series-parallel power system is solved considering both homogeneous and heterogeneous types of redundancy.
Also an example considering price discounts is solved. The effectiveness of the penalty function and the proposed algorithm
is studied and shown graphically. 相似文献
13.
通过查慎行对《瀛奎律髓》中陆游诗歌的评点可以看出,他在章法、用典、字法、句法、对仗等方面对陆游诗歌多有称赏,对陆游学古不化及艺术上的瑕疵亦多有批评,总体上体现出较为客观的批评态度。在查慎行的诗学理论体系中,陆游的地位经历了一个由高到低的过程。查慎行对自己青年时期偶像的批评与颠覆,体现出其晚年诗学理论的转变与成熟。 相似文献
14.
《Omega》2017
This paper investigates an integrated production and transportation scheduling problem in an MTO supply chain. A harmony search-based memetic optimization model is developed to handle this problem, in which certain heuristic procedures are proposed to convert the investigated problem into an order assignment problem. A novel improvisation process is also proposed to improve the optimum-seeking performance. The effectiveness of the proposed model is validated by numerical experiments. The experimental results show that (1) the proposed model can solve the investigated problem effectively and that (2) the proposed memetic optimization process exhibits better optimum-seeking performance than genetic algorithm-based and traditional memetic optimization processes. 相似文献
15.
《Journal of Statistical Computation and Simulation》2012,82(2-3):87-92
The standard frequency domain approximation to the Gaussian likelihood of a sample from an ARMA process is considered. The Newton-Raphson and Gauss-Newton numerical maximisation algorithms are evaluated for this approximate likelihood and the relationships between these algorithms and those of Akaike and Hannan explored. In particular it is shown that Hannan's method has certain computational advantages compared to the other spectral estimation methods considered 相似文献
16.
《Journal of Statistical Computation and Simulation》2012,82(18):3331-3353
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. 相似文献
17.
This study develops a robust automatic algorithm for clustering probability density functions based on the previous research. Unlike other existing methods that often pre-determine the number of clusters, this method can self-organize data groups based on the original data structure. The proposed clustering method is also robust in regards to noise. Three examples of synthetic data and a real-world COREL dataset are utilized to illustrate the accurateness and effectiveness of the proposed approach. 相似文献
18.
《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. 相似文献
19.
《Journal of Statistical Computation and Simulation》2012,82(1-2):63-68
A number of efficient computer codes are available for the simple linear L 1 regression problem. However, a number of these codes can be made more efficient by utilizing the least squares solution. In fact, a couple of available computer programs already do so. We report the results of a computational study comparing several openly available computer programs for solving the simple linear L 1 regression problem with and without computing and utilizing a least squares solution. 相似文献
20.
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. 相似文献