Huazhong University of Science and Technology

Zhejiang Lab

Samsung Electronics Co., Ltd.

Hai Jin

Xiaofei Liao

Song Wu

Deqing Zou

Jiang Xiao

Long Zheng

Peng Xu

Weiqi Dai

Wei Wang

Xuanhua Shi

Haikun Liu

Tianyang Chen

Yubo Zheng

Shijie Zhang

Xiaohai Dai

Jian Chang

Yu Zhang

Jin Zhao

Feng Zhao

Chen Yu

Fangming Liu

Qinggang Wang

Langjunqing Jin

Minrui Wu

Huichuwu Li

Zhiyuan Shao

Jiajie Zeng

Yinjia Pi

Junpei Ni

Zhen Li

Bo Xu

Kun Wang

Fan Zhang

Yu Huang

Qin Zhang

Lei Zhu

Song Qing Wu

Xiang Hui Zhao

Tao Xu

Chi Zhang

Yicheng Chen

Feng Lu

Feng Cheng

Kai Chen

Fei Chen

Jing Tang

Zhuang Xiong

Xi Li

Long Chen

Chuanming Liang

Duoqiang Wang

Pei Duan

Ran Zheng

Bingcheng Zhao

Zezhao Dong

Fengwei Wang

Qiong Hua Hu

Ruoxue Liu

Li Ping Pang

Hanfeng Qin

Ye Tao

Dong Liang

Weizhong Qiang

Pengcheng Yao

Shengwei Bian

Zhiwei Li

Zhixiang Ke

Qizhi Tang

Xiao Fei Liao

Ziqian Shi

Qingxiang Chen

Xi Ge

Zhiyi Liu

Beibei Si

Miao Li

Wenchao Wu

Ximing Chen

Die Hu

Xuan Peng

Hulin Dai

Yuanyuan Ye

Weiliang Ma

Qian Xiong

Xiaoyao Li

Hao Fan

Shuanghong He

Rui Han

Qiangsheng Hua

Yangyang Li

Dang Yang

Bingru Si

Chengbo Yang

Hanhua Chen

Yuxi Wang

Chao Niu

Mingxuan Ni

Jun Deng

Yan Xia

Yujie Chen

Junjian Guan

A method and system for deleting multi-copy personal data efficiently and securely is provided, wherein the personal data and its subject identifier are signed and uploaded to data domains and stored as personal data copies; the personal data copies along with its source and destination data are circulated among the data domains; the data domain receiving a deletion instruction transmits the deletion instruction to every relevant data domains based on the identifier of the personal data subject and the destination data and then performs deletion; and after completing the deletion, the data domain deposit its domain identifier and feedback data it receives into a log, and feed the log back to its superior data domain. And the system of the present disclosure includes a plurality of data domains that can perform the above operations, thereby realizing association-based storage, association-based deletion and verification of association-based deletion of multi-copy personal data.

Method and system for deleting multi copy personal data efficiently and securely

The present invention relates to a post-exascale graph computing method, and corresponding system, storage medium and electronic device. The invention solves the problems of low computing performance, poor scalability and high communication overhead in the large-scale distributed environment, and improves the performance of the supercomputer when supporting large-scale graph computing.

Post-exascale graph computing method, system, storage medium and electronic device thereof

The present invention relates to a graphic-blockchain-orientated sharding storage apparatus, at least comprising a first sharding module and a second sharding module, wherein the first sharding module shards nodes having different resource capacity levels based on ledger data organized using a DAG structure, and the second sharding module assigns transactions to the shards matching with execution difficulty levels of the transactions, so that each said transaction is processed and stored in the shard corresponding thereto. The present invention incorporates the sharding technology into a graphic blockchain to provide a graphic-blockchain-orientated sharding storage method, so as to reduce pressure in terms of data storage and transaction processing on nodes of the graphic blockchain system. In addition, nodes, transactions, and data are dynamically divided according to resource heterogeneity among nodes, so as to further enhance performance of the graphic blockchain system while achieving efficient use of resources.

Graphic-blockchain-orientated sharding storage apparatus and method thereof

A cache-designing method using cache lines to record cache-miss information is provided, wherein cache lines and cache-miss information are stored in a common storage space by means of shared storage. Tags of cache lines, as well as cache lines and cache-miss information, are stored separately in different static random-access memories, wherein multiple independent memories are used for tags, while a single memory is for cache lines and cache-miss information. A request-processing pipeline and a response-processing pipeline are constructed to be parallelable and used respectively for processing memory-access requests and for processing memory-response data. As compared to existing non-blocking cache designs that support plenty of miss status holding registers, the present disclosure allows storage sharing between cache data and cache-miss information, and leverages dual-port feature of static random-access memories in FPGA, so as to design separate pipelines to achieve memory access respectively for memory-access request processing and for memory-response data processing.

Cache-designing method where cache data and cache-miss information share the same storage space

A sample-difference-based method and system for interpreting a deep-learning model for code classification is provided, wherein the method includes a step of off-line training an interpreter: constructing code transformation for every code sample in a training set to generate difference samples; generating difference samples respectively through feature deletion and code snippets extraction and then calculating feature importance scores accordingly; and inputting the original code samples, the difference samples and the feature importance scores into a neural network to get a trained interpreter; and a step of on-line interpreting the code samples: using the trained interpreter to extract important features from the snippets, then using an influence-function-based method to identify training samples that are most contributive to prediction, comparing the obtained important features and the most contributive training samples, and generating interpretation results for the object samples. The inventive system includes an off-line training module and an on-line interpretation module.

Sample-difference-based method and system for interpreting deep-learning model for code classification

The present invention relates to a blockchain-based system and method for preventing unauthorized deletion of surveillance video, the system at least comprising: a plurality of camera components, for generating surveillance video; at least one video-recording node, for connecting to a blockchain network and randomly generating a key pair, splitting the video file received from the camera components into a plurality of video-file blocks and randomly sending them to participation nodes across the blockchain network for storage, and recording hash values of the stored video files and node information; and a blockchain network device, for updating the hash values of the video files uploaded by the video-recording nodes based on a smart contract. In the present invention, uploading and storing time for camera-videos is recorded by the smart contract as tamper-resistant time reference for law enforcement, protecting video data from malicious deletion at video-recording nodes without the need of redundant space.

Blockchain-based system and method for preventing unauthorized deletion of surveillance video

A method and system for automatic deletion of information based on time synchronization and trusted counting is provided, the method including: defining different data structures including configurations in a normalized manner; setting triggering conditions for automatic information deletion, including conditions for automatic deletion based on time synchronization and/or based on trusted counting; maintaining synchrony of the configurations across different domains; and after satisfying the triggering conditions, making an information source domain and/or an information propagation domain perform the automatic information deletion. Considering that existing data deletion mechanisms cannot delete information according to preset retention periods, the present application employs synchrony across system clocks to perform automatic deletion of authorization information under circulation after a certain time period, and further limits a circulation count for information of interest so as to ensure that the information and its copies are all deleted after reaching a preset maximum permittable circulation count.

Method and system for automatic deletion of information based on time synchronization and trusted counting

The present invention relates to a hardware accelerator for hypergraph processing and its operating method, the hardware accelerator comprising: a data loader: for, in the presence of a data-centric load-trigger-reduce execution model, reading hypergraph partition data from an off-chip memory successively according to hypergraph data structure and an order of hypergraph partitions; an address translator, for deploying the hypergraph data into a private register of a processor and/or into a buffer memory according to a priority level of loaded data, and recording corresponding offset information; a task trigger, for generating computing tasks according to the loaded data, and scheduling the computing tasks into the processor; the processor, for receiving and executing the computing tasks; a reducer, for scheduling intermediate results into a first-priority-data reducer unit or a second-priority-data reducer unit depending on the priority level of the data so as to execute a reducing operation for the intermediate results. In view of the shortcomings of task-centric hardware accelerators, the present invention can prevent any possible data conflict during parallel execution of multiple processing units.

Hardware accelerator for hypergraph processing and operating method thereof

The present invention relates to an activity recognition system balanced between versatility and individuation, comprising a communication framework jointly formed by a data collecting terminal, a computing device, and a cloud computing platform, the activity recognition system uses the communication framework to conduct personnel activity recognition and model updating, and the edge computing device further comprises a model training module and an activity recognition module, and the model training module retrieves a local activity recognition model by continuously verifying user IDs, and uses the first data to train a versatile network structure and an individualized network structure of the local activity recognition model in a way that individuation features of the user and versatility features of the model are fused with each other, so that the personnel activity recognition process conducted by the activity recognition module.

Activity recognition model balanced between versatility and individuation and system thereof

The present invention relates to a container-oriented Linux kernel virtualizing system, at least comprising: a virtual kernel constructing module, being configured to provide a virtual kernel customization template for a user to edit and customize a virtual kernel of a container, and generate the virtual kernel taking a form of a loadable kernel module based on the edited virtual kernel customization template; and a virtual kernel instance module, being configured to reconstruct and isolate a Linux kernel, and operate a virtual kernel instance in a separate address space in response to a kernel request from a corresponding container. The container-oriented Linux kernel virtualizing system of the present invention is based on the use of a loadable module.

Container-oriented Linux kernel virtualizing system and method thereof

The present invention relates to a highly flexible, scalable multi-blockchain, hierarchical data-sharing and data-storing system, at least comprising a third-party blockchain system, a data-sharing blockchain system, and an application-layer client, wherein the data-sharing blockchain system performs data aggregation and hierarchical storage on shared data uploaded by the third-party blockchain system through accessing the data-sharing blockchain system, so as to allow the application-layer client to require the shared data from the data-sharing blockchain system. The disclosure herein creates a single reliable data-sharing blockchain apparatus based on blockchain systems, so as to facilitate aggregation of data coming from different blockchain systems, reduce node complexity and block data redundancy when data are acquired from multiple parties, and define different sharing rules for different data contents, thereby being adaptive to scenarios where data are shared among parties.

Highly flexible, scalable multi blockchain, hierarchical data sharing and data storing system and method thereof

The present invention relates to a dynamic memory management apparatus and method for HLS, the apparatus has several searching and caching modules and several modifying and writing-back modules, the searching and caching modules are in connection with a DRAM storing module and a BRAM buffer, respectively, and the modifying and writing-back modules are in connection with the DRAM storing module and the BRAM buffer, respectively, the BRAM buffer is for caching information about nodes on a search path and registering information about modification made to the nodes. To remedy the defect that the traditional operating system is directly transplanted to the FPGA and has low execution efficiency, the present invention utilizes the advantage of the large capacity of the DRAM on the FPGA to realize efficient dynamic memory allocation and deallocation, and improve the usability and code reusability of HLS.

Dynamic memory management apparatus and method for HLS

The present invention relates to an implementation method for graphic-blockchain-orientated hybrid consensus, at least comprising: calling at least one module to generate a new data block and broadcast it; calling at least one module to check and validate the received new block based on predetermined rules; calling at least one module to generate a void block; and calling at least one module to update a committee member list. The existing graphic blockchain can only achieve probabilistic consensus, yet the present invention achieves deterministic consensus on graphic blockchain for the first time, thereby reaching consensus faster. The present invention decouples generation and consensus of blocks for the first time, so that the two parts can be designed separately in a modularized manner. The present invention provides the first totally decentralized hybrid consensus algorithm in the graphic blockchain. This is unachievable to many existing graphic blockchain such as IOTA and Obyte.

Graphic-blockchain-orientated hybrid consensus implementation apparatus and implementation method thereof

The present invention relates to a network transmission optimization device for a graph-type blockchain, at least comprising a transaction processing module, a node managing module, and a route managing module, wherein the transaction processing module performs compression on a transaction, and transaction data obtained through the compression are transmitted among different clusters through a routing node selected by the route managing module from at least one cluster, wherein the at least one cluster is obtained through dividing plural nodes by the node managing module. The network transmission optimization method provides a transaction coding scheme to the existing graph-type blockchain systems, and improve use efficiency of network bandwidth by means of parallelized broadcast. The structured network topology of the network transmission optimization method is made to address delay among nodes, and is adaptive to dynamic joining and exit of nodes, thereby improving network transmission efficiency.

Network transmission optimization device for graph-type blockchain and method thereof

The present invention provides an anti-trapdoor-leakage on-chain data restoration system, at least comprising: a blockchain node, for broadcasting transaction data of a request-initiating person to blockchain nodes and proposer nodes in other groups, respectively; and a proposer node, for performing computation of a Chameleon-Hash function using a key set that is generated by a key-generating module provided in the proposer node, packaging the transaction data to generate a new block, and distributing the new block to all the blockchain nodes so that the blockchain nodes update their respective underlying ledgers according to the new blocks broadcasted by the proposer. The system of the present invention not only realizes such functions as restoration and editing of the transaction data, but also protects operational security and reliability of blockchains.

Anti-trapdoor-leakage on-chain data restoration system and method thereof

Growing community of inventors

Hubei, China

Hai Jin