技术嵌入与数字化商业模式创新——基于飞贷金融科技的案例研究

随着数字技术的快速发展,数字化商业模式创新成为企业竞争的利器,而技术嵌入是企业内化数字技术支撑数字化商业模式创新的重要策略.本文基于飞贷金融科技的创新实践开展纵向案例研究,探究技术嵌入对数字化商业模式创新的影响.研究发现:技术嵌入包含技术整合和技术开发,两种策略在企业发展过程中经历了不同形式的演变.其中,拼凑式技术整合更有利于商业模式要素创新,而协奏式技术整合更有利于商业模式架构创新.利用式技术开发更有利于商业模式渐进创新,而探索式技术开发更有利于商业模式颠覆创新.最终,案例企业的数字化商业模式呈现出一条"流程信息化→渠道平台化→产品数字化→技术产品化"的进阶式演化路径,数字化程度相应呈现"类抛物线"的演变规律.本研究丰富了数字化商业模式创新的相关理论,并为科技型企业构建数字化商业模式提供了实践启示.     

CIO自身技能、需求方领导力与数字化创新

现有研究强调数字化创新对企业的战略价值,但学术界对企业如何进行数字化创新的认识却较为有限.借鉴变革型领导理论,本文提出CIO需求方领导力正向影响企业数字化创新水平,同时,CIO结构权力可以增强CIO需求方领导力与企业数字化创新水平的正向关系.此外,从CIO自身技能方面识别出CIO需求方领导力的三个重要前因:战略IT知识、政治悟性以及网络能力.通过采集179份CIO-TMT的企业配对问卷数据进行实证分析,实证结果较好地支持了研究假设.本文提出的假设模型为企业发挥CIO在推进数字化创新中的主导作用提供了理论基础和实践启示.     

Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

This paper studies the large-scale stochastic job shop scheduling problem with general number of similar jobs, where the processing times of the same step are independently drawn from a known probability distribution, and the objective is to minimize the makespan. For the stochastic problem, we introduce the fluid relaxation of its deterministic counterpart, and define a fluid schedule for the fluid relaxation. By tracking the fluid schedule, a policy is proposed for the stochastic job shop scheduling problem. The expected value of the gap between the solution produced by the policy and the optimal solution is proved to be O(1), which indicates the policy is asymptotically optimal in expectation.     

Approximation strategy-proof mechanisms for obnoxious facility location on a line

In the facility location game on a line, there are some agents who have fixed locations on the line where an obnoxious facility will be placed. The objective is to maximize the social welfare, e.g., the sum of distances from the facility to all agents. On collecting location information, agents may misreport the locations so as to stay far away from the obnoxious facility. In this paper, strategy-proof mechanisms are designed and the approximation ratio is used to measure the performances of the strategy-proof mechanisms. Two objective functions, maximizing the sum of squares of distances (maxSOS) and maximizing the sum of distances (maxSum), have been considered. For maxSOS, a randomized 5/3-approximated strategy-proof mechanism is proposed, and the lower bound of the approximation ratio is proved to be at least 1.042. For maxSum, the lower bound of the approximation ratio of the randomized strategy-proof mechanism is proved to be 1.077. Moreover, a general model is considered that each agent may have multiple locations on the line. For the objective functions maxSum and maxSOS, both deterministic and randomized strategy-proof mechanisms are investigated, and the deterministic mechanisms are shown to be best possible.     

政府奖惩机制下药品安全质量监管三方演化博弈及仿真分析

药品安全关乎人民群众生命健康、经济发展、社会稳定和国家安全，一直以来都是政府和全社会关注的热点问题之一。但是，近年来频发的各类药品安全事件，揭露了政府监管缺失、药品检测机制不完善、公众投诉失效等诸多问题。本文考虑了药品检测中存在寻租现象，构建了药品生产企业、第三方药品检测机构和政府监管部门之间的三方演化博弈模型，分析了各参与方策略选择的演化稳定性，探讨了各要素对三方策略选择的影响关系，进一步分析了三方博弈系统中均衡点的稳定性。研究结果表明：1)政府增强奖励、惩罚力度均有助于促进企业生产高药效药品、第三方药品检测机构拒绝寻租的规范行为，但是增大奖励力度将不利于政府自身履行监管职责；2)政府设定合理的奖惩机制必须符合对各方的奖惩之和大于其投机收益的条件，才能保障演化稳定市场环境下的药品安全；3)上级政府对监管部门失职的问责对增强企业生产高药效药品的稳健性具有重要意义；4)提升企业的药品销售收益、增加企业寻租成本也是避免企业生产低药效药品的有效途径。最后，利用Matlab 2020b进行了仿真分析，为政府完善药品监管机制提出了对策与建议。     

A continuous characterization of the maximum vertex-weighted clique in hypergraphs

For a simple graph G on n vertices with adjacency matrix A, Motzkin and Strauss established a remarkable connection between the clique number and the global maximum value of the quadratic programm: \(\textit{max}\{ \mathbf {x}^T A \mathbf {x}\}\) on the standard simplex: \(\{\sum _{i=1}^{n} x_i =1, x_i \ge 0 \}\). In Gibbons et al. (Math Oper Res 122:754–768, 1997), an extension of the Motzkin–Straus formulation was provided for the vertex-weighted clique number of a graph. In this paper, we provide a continuous characterization of the maximum vertex-weighted clique problem for vertex-weighted uniform hypergraphs.     

外汇储备与金融脆弱性关系研究--基于金砖五国的实证分析

外汇储备通过传导机制对国内金融部门产生影响,研究外汇储备变化对金融稳定的影响是国家金融安全的重要内容。本文选取中国、巴西、俄罗斯、印度和南非五个"金砖国家"作为新兴市场国家的典型代表,采用Johansen协整检验和Bayesian向量自回归建模方法,实证研究外汇储备变化与金融脆弱性的关系。研究表明,不管从长期还是短期来看,外汇储备变化量增加会提高金融脆弱性指数,帮助国家应对短期经济波动,因此,增加外汇储备有助于国内金融部门稳定,抵御经济危机。     

Assessing Major Accident Risks to Support Land‐Use Planning Using a Severity‐Vulnerability Combination Method: A Case Study in Dagushan Peninsula,China

Major accident risks posed by chemical hazards have raised major social concerns in today's China. Land‐use planning has been adopted by many countries as one of the essential elements for accident prevention. This article aims at proposing a method to assess major accident risks to support land‐use planning in the vicinity of chemical installations. This method is based on the definition of risk by the Accidental Risk Assessment Methodology for IndustrieS (ARAMIS) project and it is an expansion application of severity and vulnerability assessment tools. The severity and vulnerability indexes from the ARAMIS methodology are employed to assess both the severity and vulnerability levels, respectively. A risk matrix is devised to support risk ranking and compatibility checking. The method consists of four main steps and is presented in geographical information‐system‐based maps. As an illustration, the proposed method is applied in Dagushan Peninsula, China. The case study indicated that the method could not only aid risk regulations on existing land‐use planning, but also support future land‐use planning by offering alternatives or influencing the plans at the development stage, and thus further enhance the roles and influence of land‐use planning in the accident prevention activities in China.     

A simpler PTAS for connected <Emphasis Type="Italic">k</Emphasis>-path vertex cover in homogeneous wireless sensor network

Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount.