高层管理团队中客观存在的各种类型的权威对团队决策过程的质量会有怎样影响这一黑箱问题目前尚未探明.该文利用200多名 MBA 学员展开权威类型、决策程序对高层管理团队的决策效率和过程满意度的影响效应实验研究,结果表明高层管理团队...高层管理团队中客观存在的各种类型的权威对团队决策过程的质量会有怎样影响这一黑箱问题目前尚未探明.该文利用200多名 MBA 学员展开权威类型、决策程序对高层管理团队的决策效率和过程满意度的影响效应实验研究,结果表明高层管理团队权威的存在显著地提高了决策过程的效率和满意度,并且,决策过程满意度的提高主要依赖于知识权威和复合权威,决策效率的提高主要依赖于权力权威的作用等.结论为企业高层管理团队决策水平的提高提供了有益的参考.展开更多
Symbolic bisimulation avoids the infinite branching problem causedby instantiating input names with all names in the standard definition of bisimulation in л-calculus. However, it does not automatically lead to an ef...Symbolic bisimulation avoids the infinite branching problem causedby instantiating input names with all names in the standard definition of bisimulation in л-calculus. However, it does not automatically lead to an efficient algorithm,because symbolic bisimulation is indexed by conditions on names,and directly manipulating such conditions can be computationally costly. In this paper a new notionof bisimulation is introduced, in which the manipulation of maximally consistent conditions is replaced with a systematic employment of schematic names. It is shownthat the new notion captures symbolic bisimulation in a precise sense. Based on thenew definition an efficient algorithm, which instantiates input names 'on-the-fly', ispresented to check bisimulations for finite-control л-calculus.展开更多
在 n 个逐个出现的随机数据α<sub>1</sub>,α<sub>2</sub>,…,α<sub>n</sub> 中选取某个数据,求该数据为最优值的概率.设计的决策程序是:对前 r<sup>*</sup>-1个数据不认为有最优值...在 n 个逐个出现的随机数据α<sub>1</sub>,α<sub>2</sub>,…,α<sub>n</sub> 中选取某个数据,求该数据为最优值的概率.设计的决策程序是:对前 r<sup>*</sup>-1个数据不认为有最优值,当出现相对最优值α<sub>i</sub>（r<sup>*</sup>≤i≤n）决策取α<sub>i</sub> 为最优值,则求得决策成功（取到最优值）的概率。展开更多
文摘高层管理团队中客观存在的各种类型的权威对团队决策过程的质量会有怎样影响这一黑箱问题目前尚未探明.该文利用200多名 MBA 学员展开权威类型、决策程序对高层管理团队的决策效率和过程满意度的影响效应实验研究,结果表明高层管理团队权威的存在显著地提高了决策过程的效率和满意度,并且,决策过程满意度的提高主要依赖于知识权威和复合权威,决策效率的提高主要依赖于权力权威的作用等.结论为企业高层管理团队决策水平的提高提供了有益的参考.
文摘Symbolic bisimulation avoids the infinite branching problem causedby instantiating input names with all names in the standard definition of bisimulation in л-calculus. However, it does not automatically lead to an efficient algorithm,because symbolic bisimulation is indexed by conditions on names,and directly manipulating such conditions can be computationally costly. In this paper a new notionof bisimulation is introduced, in which the manipulation of maximally consistent conditions is replaced with a systematic employment of schematic names. It is shownthat the new notion captures symbolic bisimulation in a precise sense. Based on thenew definition an efficient algorithm, which instantiates input names 'on-the-fly', ispresented to check bisimulations for finite-control л-calculus.
