相关实验视频

Updated: Jun 25, 2025

Automated 3D Optical Coherence Tomography to Elucidate Biofilm Morphogenesis Over Large Spatial Scales

Automated 3D Optical Coherence Tomography to Elucidate Biofilm Morphogenesis Over Large Spatial Scales

Published on: August 21, 2019

调查银行业绩的时间和空间演变及其在金融技术发展背景下的影响途径

Jing Zhao¹, Haslindar Ibrahim¹, Congqi Wang¹

¹School of Management, Universiti Sains Malaysia, 11800, USM, Penang, Malaysia.

|May 23, 2024

概括

金融技术 (FinTech) 提高了区域银行业绩,尽管其他经济因素也发挥了作用. 空间分析揭示了金融科技.

科学领域:

经济学经济学经济学
金融金融金融金融金融
区域科学地区科学

背景情况:

全球化和数字经济正在加速,改变了企业,影响了银行业绩.
了解金融技术 (FinTech) 与银行业绩之间的相互作用对于经济发展至关重要.
之前的研究强调了金融科技在金融系统中日益重要的意义.

研究的目的:

检查2012年至2021年中国金融科技与银行业绩之间的发展和相互作用.
确定金融科技对银行业绩影响的关键驱动因素和空间特征.
为决策者和金融机构提供基于证据的建议.

主要方法:

用于空间分布分析的标准偏差圆.
核密度估计以可视化密度模式.
莫兰空间自相对应指数.
空间计量经济学模型用于评估影响和溢出效应.

主要成果:

金融技术的发展与区域银行业绩有积极的相关性,与经济发展和城市化等控制变量相结合.
中国的银行业绩最初增长,然后下降,而金融科技显示了不同的轨迹;两者都集中在东部沿海地区.
在金融科技和银行业绩方面观察到显著的空间聚集 (高高,低低).
金融技术和控制变量表现出空间溢出效应,影响邻近地区的银行业绩.

结论:

金融科技是区域银行业绩的重要驱动因素,具有明显的空间模式和溢出效应.
政策干预应考虑区域差异和金融市场的相互联系.
金融技术的战略发展可以提高银行整体业绩和经济增长.

关键词:

银行业绩表现银行业绩表现金融技术是金融技术.核密度估计核密度的估计.标准偏差是圆的.

更多相关视频

The Joint Effect of Social Comparison and Social Distance on Evaluation of Intertemporal Choice Outcomes in Event-related Potential Studies

The Joint Effect of Social Comparison and Social Distance on Evaluation of Intertemporal Choice Outcomes in Event-related Potential Studies

Published on: August 25, 2023

Utilizing Electroencephalography Measurements for Comparison of Task-Specific Neural Efficiencies: Spatial Intelligence Tasks

Utilizing Electroencephalography Measurements for Comparison of Task-Specific Neural Efficiencies: Spatial Intelligence Tasks

Published on: August 9, 2016

相关概念视频

Discrete-time Fourier transform

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

Continuous -time Fourier Transform

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...

Discrete-Time Fourier Series

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...