hk clearing participant & Exchange Participant of SEHK
There are seven types of CCASS Participants: (i) Direct Clearing Participants, (ii) General Clearing Participants, (iii) Clearing Agency Participants, (iv) Custodian Participants, (v) Stock Lender Participants, (vi) Stock Pledgee Participants, and (vii) Investor Participants. (i) Direct Clearing Participants: All Exchange Participants of SEHK can be Direct Clearing Participants (DCPs) of CCASS to clear and settle all their trades concluded on SEHK in eligible securities in CCASS. Before admission, Direct Clearing Participants are, amongst other conditions, required to subscribe for a non-interest bearing admission fee for HK$50,000 per trading right in SEHK and have to make the requisite contributions to the Guarantee Fund (see later). (ii) General Clearing Participants: General Clearing Participants (GCPs) must be either a licensed corporation licensed to carry on Type 1 regulated activity or a registered institution registered to carry on Type 1 regulated activity under the Securities and Futures Ordinance. A GCP must demonstrate its financial and operational capacity to establish and operate clearing business for other corporations. Before admission, GCPs are, amongst other conditions, required to (i) subscribe for a non-interest bearing admission fee of the higher of HK$50,000 and HK$50,000 in respect of each trading right held by itself (if it is also an Exchange Participant of SEHK) and each of its underlying NCP, and (ii) make the requisite contributions to the Guarantee Fund (see later). (iii) Clearing Agency Participants: Clearing Agency Participants (CAPs) are recognised bodies in the business of operating the central securities clearing and settlement system and/or central securities depository system. Clearing Agency Participants are regulated in Hong Kong by the Commission or in an overseas jurisdiction by a governmental body or securities regulatory agency. A Clearing Agency Participant must demonstrate its financial and operational capacity to establish and operate such a system, and the securities dealt with in the system include eligible securities. Clearing Agency Participants are required to subscribe for a non-interest bearing admission fee of HK$1,000,000. (iv) Custodian Participants: Only persons with an established custodian business in SEHK listed securities are to be admitted as Custodian Participants of CCASS. Amongst other conditions, each Custodian Participant is required to subscribe for a non-interest bearing admission fee of HK$1,000,000 prior to admission. (v) Stock Lender Participants: Stock lenders are persons who lend SEHK listed securities to Clearing Participants who may need to borrow shares to meet delivery obligations. At the initial stage of CCASS, stock lending within CCASS is restricted only to Clearing and Custodian Participants. A person other than a Clearing Participant or a Custodian Participant who wishes to join as a Stock Lender Participant will have to subscribe for a non-interest bearing admission fee of HK$200,000.
(vi) Stock Pledgee Participants: Only persons with an established business of lending money to Clearing Participants against the security of SEHK listed securities are admitted as Stock Pledgee Participants. Stock Pledgee Participants must have all requisite authorizations or licences and are only allowed to effect stock pledging transactions in CCASS (in particular, deposits of securities into CCASS by Stock Pledgee Participants will not be entertained). Stock Pledgee Participants are required to subscribe for a non-interest bearing admission fee of HK$200,000 prior to admission. (vii) Investor Participants: There are 3 types of CCASS Investor Participants: individual investor participants, joint individual investor participants and corporate investor participants.
hk clearing participant & Exchange Participant of SEHK的更多相关文章
- 并发编程之 Exchanger 源码分析
前言 JUC 包中除了 CountDownLatch, CyclicBarrier, Semaphore, 还有一个重要的工具,只不过相对而言使用的不多,什么呢? Exchange -- 交换器.用于 ...
- 《Java7并发编程实战手册》读书笔记
一.线程管理 1.线程的创建和运行 创建线程的2种方式: 继承Thread类,并覆盖run()方法 创建一个实现Runnable接口的类.使用带参数的Thread构造器来创建Thread对象 每个Ja ...
- 014-多线程-基础-Exchanger-行线程间的数据交换
一.简介 Exchanger类允许在两个线程之间定义同步点,当两个线程都到达同步点时,它们交换数据.也就是第一个线程的数据进入到第二个线程中,第二线程的数据进入到第一个线程中. Exchanger可以 ...
- Java并发指南9:AQS共享模式与并发工具类的实现
一行一行源码分析清楚 AbstractQueuedSynchronizer (三) 转自:https://javadoop.com/post/AbstractQueuedSynchronizer-3 ...
- Java并发包同步工具之Exchanger
前言 承接上文Java并发包同步工具之Phaser,讲述了同步工具Phaser之后,搬家博客到博客园了,接着未完成的Java并发包源码探索,接下来是Java并发包提供的最后一个同步工具Exchange ...
- Exchanger 源码分析
Exchanger 此类提供对外的操作是同步的: 用于成对出现的线程之间交换数据[主场景]: 可以视作双向的同步队列: 可应用于基因算法.流水线设计.数据校对等场景 创建实例 /** * arena ...
- JUC 常用4大并发工具类
什么是JUC? JUC就是java.util.concurrent包,这个包俗称JUC,里面都是解决并发问题的一些东西 该包的位置位于java下面的rt.jar包下面 4大常用并发工具类: Count ...
- 高并发之Semaphore、Exchanger、LockSupport
本系列研究总结高并发下的几种同步锁的使用以及之间的区别,分别是:ReentrantLock.CountDownLatch.CyclicBarrier.Phaser.ReadWriteLock.Stam ...
- 并发王者课-铂金9:互通有无-Exchanger如何完成线程间的数据交换
欢迎来到<并发王者课>,本文是该系列文章中的第22篇,铂金中的第9篇. 在前面的文章中,我们已经介绍了ReentrantLock,CountDownLatch,CyclicBarrier, ...
随机推荐
- 【Day3】2.re模块使用案例
课程目标 1.提取 2.匹配 3.替换 1.提取 import re ret = re.findall([正则表达式]) # 返回的类型是列表 2.匹配 import re ret = re.matc ...
- 学习elasticsearch(一)linux环境搭建(3)——head插件安装
对于5.x的es,head插件不支持 ./elasticearch-plugin install [plugin_name]方式安装. 进入正文 1.首先确保你的机器安装了python,如果没有,请看 ...
- Java用递归实现全排列,详细
package edu.cqu.algorithmTest; import java.util.Scanner; // 全排列,递归实现 public class Main8 { public sta ...
- vue 01 练习
1.有 红.黄.蓝 三个按钮,以及一个200x200矩形框box,点击不同的按钮,box的颜色会被切换为指定的颜色 <!DOCTYPE html> <html lang=" ...
- 部署lnmp
装包 1.安装依赖包 yum - y install gcc openssl-devel pcre-devel zlib-devel 2.解源码包 .tar.gz 3.切换到解压缩后的目录,配置参数 ...
- 【Python之路】特别篇--抽屉新热榜
登陆与注册 注册功能: 流程: 填写用户名,邮箱,获取邮箱验证码,填入密码 单击<下一步>按钮,完成注册! 1.获取邮箱验证码(具体步骤分析): 1.利用ajax 往后台传入邮箱, 2.后 ...
- php+文件夹上传实例
核心原理: 该项目核心就是文件分块上传.前后端要高度配合,需要双方约定好一些数据,才能完成大文件分块,我们在项目中要重点解决的以下问题. * 如何分片: * 如何合成一个文件: * 中断了从哪个分片开 ...
- BZOJ 1116 [POI2008]CLO-Toll 并查集
如果一个连通块是一个树的形态,则不合法,否则合法. 用并查集判断一下即可. #include <bits/stdc++.h> #define N 100005 #define M 2000 ...
- luogu 2577 [ZJOI2005]午餐 贪心+dp
发现让 $b$ 更大的越靠前越优,然后依次决策将每个人分给哪个窗口. 令 $f[i][j]$ 表示考虑了前 $i$ 个人,且第一个窗口的总等待时间为 $j$ 的最小总时间. 然后转移一下就好了~ #i ...
- 51 Nod 1475 建设国家 (优先队列+贪心)
1475 建设国家 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注 小C现在想建设一个国家.这个国家中有一个首都,然后有若干个中间站,还有若干个城 ...