全文获取类型
收费全文 | 309篇 |
免费 | 12篇 |
国内免费 | 8篇 |
学科分类
社会科学 | 329篇 |
出版年
2023年 | 5篇 |
2022年 | 26篇 |
2021年 | 13篇 |
2020年 | 15篇 |
2019年 | 4篇 |
2018年 | 12篇 |
2017年 | 14篇 |
2016年 | 7篇 |
2015年 | 17篇 |
2014年 | 24篇 |
2013年 | 13篇 |
2012年 | 25篇 |
2011年 | 24篇 |
2010年 | 16篇 |
2009年 | 20篇 |
2008年 | 21篇 |
2007年 | 7篇 |
2006年 | 14篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1997年 | 2篇 |
1996年 | 1篇 |
排序方式: 共有329条查询结果,搜索用时 16 毫秒
1.
In the current investigation, idiosyncratic deals (i-deals; individualized work arrangements) are modeled as differentiated resources that shape leader-member exchange (LMX) relationships in workgroups. We integrate literature on leader-member exchange (LMX) with research on i-deals to argue that employee evaluations of i-deals received from the grantor –typically the leader- enhance employee perceptions of LMX, which in turn become instrumental in generating positive performance outcomes. Furthermore, because workgroup characteristics have potential implications on the relationship between a deal grantor and the deal recipient, drawing upon social identity theory of leadership, we reason that the i-deals-LMX relationship is affected by the overall value congruence among the group members. Cross-level moderated mediation analyses on multi source data obtained from 289 employees nested in 60 workgroups showed that the mediational role of LMX in the i-deals to performance outcomes relationship was weaker in high value congruence groups. 相似文献
2.
本文运用对比案例分析法,选取Steemit论坛和知乎论坛作为分析对象,探究了使用数字货币与否对同一行业组织的商业模式及其创新有什么影响。本文以商业模式画布为蓝本,通过对比数字货币背景下商业模式在价值主张、价值创造、价值传递、价值网络和价值实现五个方面的差异,探究数字货币时代下商业模式的创新影响,以及商业模式不同价值元素间新的构成秩序。本研究分析了选取案例商业模式中的不同对应元素,并给出了以下三个针对数字货币和商业模式的新命题:第一,数字货币在价值创造过程中联结利益主体;第二,数字货币起到了模糊价值网络边界的作用,从而促进构成新的治理模式;第三,使用数字货币可以在价值实现过程中完成利润重新分配。最后,文章认为数字货币情景下商业模式中不同价值元素的交互关系,呈现出以客户关系为核心的共同价值创造和共同价值实现的新秩序。 相似文献
3.
本文建立一种改进的非参数期权定价模型,称为单指标非参数期权定价模型。相比现有非参数回归期权定价模型是期权价格关于各个因素的多元回归函数,本模型通过变量变换把期权价格多个因素指标转换为一个综合变量——单指标,得到期权价格关于单指标的一元非参数回归方程。改进的模型实现了多元非参数期权定价模型的降维和简化了模型计算;还通过多个期限期权的单指标组合解决了非参数估计的样本数量问题;以及通过期限平滑解决了现有非参数定价模型中的日历效应问题。选取上证50ETF期权数据实证分析表明,无论是样本内的估计结果还是样本外的预测结果都比传统的Black-Scholes模型、半参数Black-Scholes模型和多元非参数回归期权定价模型估计效果有提高。 相似文献
4.
5.
考虑多种安全设置策略的物流网络的选址-库存问题,不仅是选址、订货、运输和库存的集成优化,还需要考虑多种不同的安全库存设置和转运策略。因此,本文深入讨论了二级物流网络中的六种安全库存设置策略,构建了六种考虑不同安全库存设置的选址-库存模型。在考虑集中设置安全库存时,集中安全库存需要通过转载运输实现,因此需要将转载运输成本引入选址-库存模型之中,使新的选址-库存模型更加科学合理。另外,针对六种新的选址-库存模型,提出了基于个体成本差异分配的遗传算法,迭代搜索选址、分配、库存设置策略的优化组合。最后,通过数据实验验证了模型的有效性:(1)安全库存与转载运输之间存在此消彼长的背反关系;(2)安全库存设置和转载运输策略对总成本的影响取决于两种费率权重情况。本文的研究可以为二级物流网络的选址、订货和安全库存策略集成优化决策提供参考依据。 相似文献
6.
7.
Neighbor sum distinguishing index of 2-degenerate graphs 总被引:1,自引:1,他引:0
Xiaolan Hu Yaojun Chen Rong Luo Zhengke Miao 《Journal of Combinatorial Optimization》2017,34(3):798-809
We consider proper edge colorings of a graph G using colors in \(\{1,\ldots ,k\}\). Such a coloring is called neighbor sum distinguishing if for each pair of adjacent vertices u and v, the sum of the colors of the edges incident with u is different from the sum of the colors of the edges incident with v. The smallest value of k in such a coloring of G is denoted by \({\mathrm ndi}_{\Sigma }(G)\). In this paper we show that if G is a 2-degenerate graph without isolated edges, then \({\mathrm ndi}_{\Sigma }(G)\le \max \{\Delta (G)+2,7\}\). 相似文献
8.
Jueliang Hu Yiwei Jiang Ping Zhou An Zhang Qinghui Zhang 《Journal of Combinatorial Optimization》2017,33(3):866-881
This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \). 相似文献
9.
AbstractCloud computing is changing the way industries and enterprises run their businesses. Cloud manufacturing is emerging as an approach to transform the traditional manufacturing business model, while helping the manufacturer to align production efficiency with its business strategy, and creating intelligent factory networks that enable collaboration across the whole enterprise. Many production planning and control (PPC) problems are essentially optimisation problems, where the objective is to develop a plan that meets the demand at minimum cost or maximum profit. Because the underlying optimisation problem will vary in the different business and operation phases, it is important to think about optimisation in a dynamic mechanism and in a number of interlinked sub-problems at the same time. Cloud manufacturing has the potential to offer decision support as a service and medium of communication in PPC. To solve these problems and produce collaboration across the supply chain, this paper provides an overview of the state of the art in cloud manufacturing and presents a model of cloud-based production planning and production system for sheet metal processing. 相似文献
10.
A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of D, denoted by \(\gamma (D)\), is the minimum cardinality of a dominating set of D. The Slater number \(s\ell (D)\) is the smallest integer t such that t added to the sum of the first t terms of the non-increasing out-degree sequence of D is at least as large as the order of D. For any digraph D of order n with maximum out-degree \(\Delta ^+\), it is known that \(\gamma (D)\ge \lceil n/(\Delta ^++1)\rceil \). We show that \(\gamma (D)\ge s\ell (D)\ge \lceil n/(\Delta ^++1)\rceil \) and the difference between \(s\ell (D)\) and \(\lceil n/(\Delta ^++1)\rceil \) can be arbitrarily large. In particular, for an oriented tree T of order n with \(n_0\) vertices of out-degree 0, we show that \((n-n_0+1)/2\le s\ell (T)\le \gamma (T)\le 2s\ell (T)-1\) and moreover, each value between the lower bound \(s\ell (T)\) and the upper bound \(2s\ell (T)-1\) is attainable by \(\gamma (T)\) for some oriented trees. Further, we characterize the oriented trees T for which \(s\ell (T)=(n-n_0+1)/2\) hold and show that the difference between \(s\ell (T)\) and \((n-n_0+1)/2\) can be arbitrarily large. Some other elementary properties involving the Slater number are also presented. 相似文献