全文获取类型
收费全文 | 1399篇 |
免费 | 36篇 |
国内免费 | 20篇 |
专业分类
管理学 | 79篇 |
民族学 | 8篇 |
人口学 | 8篇 |
丛书文集 | 172篇 |
理论方法论 | 31篇 |
综合类 | 999篇 |
社会学 | 18篇 |
统计学 | 140篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 16篇 |
2019年 | 11篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 12篇 |
2015年 | 29篇 |
2014年 | 57篇 |
2013年 | 88篇 |
2012年 | 93篇 |
2011年 | 79篇 |
2010年 | 69篇 |
2009年 | 72篇 |
2008年 | 73篇 |
2007年 | 89篇 |
2006年 | 105篇 |
2005年 | 115篇 |
2004年 | 103篇 |
2003年 | 118篇 |
2002年 | 87篇 |
2001年 | 76篇 |
2000年 | 39篇 |
1999年 | 22篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有1455条查询结果,搜索用时 15 毫秒
21.
目前学术界关于作业成本动因选择与合并的研究,缺乏对动因留选与留选个数的探讨,而关于对成本动因选择合并的评价的研究未见。可以通过聚类分析建立模型,得到成本动因的相关类,再结合主成分分析指导留选动因的个数,最终确定留选动因,并首次建立评价动因选择与合并优劣性的主成分分析模型。实证分析表明,此系统方法更好地解决了成本动因选择与合并的问题,相同数据下该方法比矩阵理论与距离聚类分析结果更优,作业成本管理系统的复杂性与信息成本显著降低。本文为作业成本动因的选择与合并以及评价提供了一套系统方法。 相似文献
22.
23.
Tagged Probe Interval Graphs 总被引:1,自引:0,他引:1
A generalization of interval graph is introduced for cosmid contig mapping of DNA. A graph is a tagged probe interval graph if its vertex set can be partitioned into two subsets of probes and nonprobes, and a closed interval can be assigned to each vertex such that two vertices are adjacent if and only if at least one of them is a probe and one end of its corresponding interval is contained in the interval corresponding to the other vertex. We show that tagged probe interval graphs are weakly triangulated graphs, hence are perfect graphs. For a tagged probe interval graph with a given partition, we give a chordal completion that is consistent to any interval completions with respect to the same vertex partition. 相似文献
24.
25.
As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l
1 or l
norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l
1 and l
norms. It has been proved that the inverse maximum-weight perfect matching under l
norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l
1 norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l
1 and l
norms are solvable in polynomial time. 相似文献
26.
27.
《Long Range Planning》2023,56(1):102249
How a successful business model (BM) is designed is a key question in the business model innovation (BMI) literature. Delving on the shared concept of BM as a configuration of components and interdependencies, we take a cognitive perspective to study the conceptual combination as a central process in BMI. We investigate the complexity of conceiving a new BM configuration, through a longitudinal study of the emergence of “The Huffington Post” which combined newspaper and blog in a disruptive and successful BM. With our research we theoretically frame the dynamic interplay between the three cognitive mechanisms of conceptual combination and the system of interdependent components of an emerging BM. Our findings unveil how the overall process unfolds and specifically delves into the dynamic iteration of composing and experimenting with the new configuration until the overall coherence is reached. Hence, we advance the literature by showing how the conceptual combination of a new BM is a complex effort and comprises some iterative cycles, vital to reach a coherent configuration which could secure a superior performance. 相似文献
28.
基于模糊逻辑系统的非线性组合预测方法研究 总被引:8,自引:1,他引:8
针对线性组合预测方法的局限性,本文提出了一种基于高斯型模糊逻辑系统的非线性组合预测新方法,并给出了相应的反向传播学习算法确定模糊系统的参数及模糊子集的划分.理论分析和应用实例表明:该方法具有很强的学习与泛化能力,在处理诸如非线性系统中时间序列的组合建模与预测方面都良好的应用价值. 相似文献
29.
Takeover and acquisition of corporations is awell-researched area and has been becomingincreasingly important. Much less research emphasishas been devoted to takeover activity within thegeneral area of financial services with thisparticularly the case for the building society sector.The building societies being mutual companies havespecial characteristics. The building societies andother financial mutuals like the corporations doencounter an acute agency problem. This opens up apotential application of Grossman and Hart theory oftakeovers bids as the individuals have option to freeride, securing knowledge that the regulatory processrenders their deposits de facto risk-free investment.This free-rider problem, like the corporations can beovercome by inducing hostile takeover.Some empirical studies of mergers activities withinthe building society sector have dealt with onlyintra-sectoral mergers. However, they have not lookedat inter-sectoral mergers and have not addressedefficiency issues in a general equilibrium frameworkusing game theory.In this paper I suggest a mechanism for merger at parwith sales of stocks of a corporation to organisebuilding societies' takeovers. I develop a two-stagegame between the members of building societies and theraider. Analysis of non-cooperative voting behaviourof members of Cheltenham and Gloucester buildingsociety shows that the actions of the members of thebuilding society may also give rise to less thanoptimal results as they may not be acting in their bestinterests. The members of the building society cangain if a hostile takeover is induced rather than afriendly takeover. The paper also examines the freerider problem and ex-ante efficiency in a generalequilibrium framework. 相似文献
30.
《Journal of Statistical Computation and Simulation》2012,82(18):3608-3619
ABSTRACTQuite an important problem usually occurs in several multi-dimensional hypotheses testing problems when variables are correlated. In this framework the non-parametric combination (NPC) of a finite number of dependent permutation tests is suitable to cover almost all real situations of practical interest since the dependence relations among partial tests are implicitly captured by the combining procedure itself without the need to specify them [Pesarin F, Salmaso L. Permutation tests for complex data: theory, applications and software. Chichester: Wiley; 2010a]. An open problem related to NPC-based tests is the impact of the dependency structure on combined tests, especially in the presence of categorical variables. This paper’s goal is firstly to investigate the impact of the dependency structure on the possible significance of combined tests in cases of ordered categorical responses using Monte Carlo simulations, then to propose some specific procedures aimed at improving the power of multivariate combination-based permutation tests. The results show that an increasing level of correlation/association among responses negatively affects the power of combination-based multivariate permutation tests. The application of special forms of combination functions based on the truncated product method [Zaykin DV, Zhivotovsky LA, Westfall PH, Weir BS. Truncated product method for combining p-values. Genet Epidemiol. 2002;22:170–185; Dudbridge F, Koeleman BPC. Rank truncated product of p-values, with application to genomewide association scans. Genet Epidemiol. 2003;25:360–366] or on Liptak combination allowed us, using Monte Carlo simulations, to demonstrate the possibility of mitigating the negative effect on power of combination-based multivariate permutation tests produced by an increasing level of correlation/association among responses. 相似文献