技术模仿的外部障碍与内部障碍

模仿障碍不仅是指知识产权方面的制度性障碍和不可言状的缄默,还指来自利益上的障碍和企业内部配合上的障碍,这些障碍的重要构成因素是技术与管理信息的不可靠性。改革开放以来,中国侨资企业曾经为消除这一障碍做出过贡献。继续发挥侨资企业的模仿优势,需要提高企业模仿创新能力。     

p-Value for two-Sample Linear Rank Tests Using Permutation Simulations and the Normal Approximation Method

Test statistics from the class of two-sample linear rank tests are commonly used to compare a treatment group with a control group. Two independent random samples of sizes m and n are drawn from two populations. As a result, N = m + n observations in total are obtained. The aim is to test the null hypothesis of identical distributions. The alternative hypothesis is that the populations are of the same form but with a different measure of central tendency. This article examines mid p-values from the null permutation distributions of tests based on the class of two-sample linear rank statistics. The results obtained indicate that normal approximation-based computations are very close to the permutation simulations, and they provide p-values that are close to the exact mid p-values for all practical purposes.     

A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling

In the multiprocessor scheduling problem to minimize the total job completion time, an optimal schedule can be obtained by the shortest processing time rule and the completion time of each job in the schedule can be used as a guarantee for scheduling revenue. However, in practice, some jobs will not arrive at the beginning of the schedule but are delayed and their delayed arrival times are given to the decision-maker for possible rescheduling. The decision-maker can choose to reject some jobs in order to minimize the total operational cost that includes three cost components: the total rejection cost of the rejected jobs, the total completion time of the accepted jobs, and the penalty on the maximum tardiness for the accepted jobs, for which their completion times in the planned schedule are their virtual due dates. This novel rescheduling problem generalizes several classic NP-hard scheduling problems. We first design a pseudo-polynomial time dynamic programming exact algorithm and then, when the tardiness can be unbounded, we develop it into a fully polynomial time approximation scheme. The dynamic programming exact algorithm has a space complexity too high for truthful implementation; we propose an alternative to integrate the enumeration and the dynamic programming recurrences, followed by a depth-first-search walk in the reschedule space. We implemented the alternative exact algorithm in C and conducted numerical experiments to demonstrate its promising performance.

     

数字驱动下多元时间知识创造的海洋模型:概念、内涵与理论验证北大核心CSSCI

新时代数字技术发展不断突破原有的时间和空间界限,组织跨境商业模式中的知识创造与异质的社会文化因素相交织,呈现出难以预测的动态模式。由于已有相关理论存在的情境局限性,本研究聚焦于受新现象驱动而提出的多元时间知识创造海洋模型,并对其进行概念、内涵的深入阐述与逻辑推演。同时,本研究以重大公共卫生事件下六个国家的新知识创造作为案例,基于牛津大学COVID-19政府响应追踪系统(OxCGRT)的数据,按照质性研究思路对海洋模型进行理论验证。研究结果证实了海洋模型三阶段在实践层面的有效性。本文的主要贡献在于呼应现象驱动研究,探讨了重大现象和议题背后的基础理论问题;使用结合大数据的系统性分析方法,对知识创造海洋模型进行了首次实证检验;促进了跨文化管理、知识管理、危机管理等学科的交叉与融合发展;为分析和解决跨文化情境的知识创造问题提供理论依据和实践参考。