China 
Africa 
Explore chapters and articles related to this topic
Blockchain-Based Medical Records for the Health Care Industry
Published in Vineet Kansal, Raju Ranjan, Sapna Sinha, Rajdev Tiwari, Nilmini Wickramasinghe, Healthcare and Knowledge Management for Society 5.0, 2021
Vidha Sharma, Rajiva Ranjan Divivedi
For verification purposes, all the nodes in the network have a copy of the entire blockchain to refer to the transaction history or credibility of the users. The transaction gets verified and validated by all of the nodes once they complete the proof of work (using complex algorithms) and find the correct answer for the given target. This proof of work is basically a proof that a particular node has put in effort to verify the legitimacy of the given transaction. Once the transaction is validated by other nodes on the network and consensus is reached, the transaction is combined with other verified transactions to form a block, which is then added to the existing blockchain. When putting the newly created block in the existing blockchain, few things that are required to be added are the block hash, previous block hash, list of transactions, timestamp, etc. After adding this block in the blockchain, the transaction is said to be complete, and miners get rewarded for verifying the transaction.
Electrolytes for High-Voltage Lithium-Ion Battery
Published in Ming-Fa Lin, Wen-Dung Hsu, Jow-Lay Huang, Lithium-Ion Batteries and Solar Cells, 2021
Ming-Hsiu Wu, Chih-Ao Liao, Ngoc Thanh Thuy Tran, Wen-Dung Hsu
The ECFP is a topological fingerprint that is originally used for the analysis of molecular characterization, substructure, and similarity. Nowadays, it is also adopted to perform the machine learning and statistical analysis of molecules. It basically has four steps: (a) assign each atom with an identifier, (b) atom identifiers are augmented with information from the atom neighborhood, (c) delete the duplicated substructure, and (d) hash list of identifiers into a fixed-length bit vector. It does not have the attribute of invertibility. Divided molecular substructure cannot be recombined together into the original molecule exactly. Furthermore, due to the fixed-length bit vector, each bit may represent multiple substructures, which often leads to the difficulty of the analysis. It is worth mentioning that initially each binary bit represents whether the substructure exists in a molecule or not, but here in this study, the bit is replaced with the number of the substructure in the molecule, as a so-called ECFPNUM. The ECFPNUM is further used for molecular representation since it is more suitable for property prediction than ECFP.
Technological Overview
Published in Peng Liu, Wang Chao, Computational Advertising, 2020
Redis is also a NoSQL database. It mainly provides high-performance key/value store and adopts the method of in-memory data set. The key values of Redis can include data types such as string, hash, list, set, and sorted set, so they are also called a data structure server. Redis periodically writes updated data to disk or changes to an appended record file. On this basis, it implements master–slave synchronization with very fast non-blocking first synchronization, automatic reconnection of network disconnection and other functions. Redis also has a number of other features, including a simple check-and-set mechanism, pub/sub, and configuration Settings that allow it to behave more like a cache. Redis also provides a rich client that supports most of the popular programming languages at this stage and is easy to use.
Lightweight MapReduce Application Service Integrity Auditing on the Cloud
Published in IETE Journal of Research, 2022
Panpan Li, Zhengxia Xie, Zengkai Wang, Zhigang Zhou
Upon the application result returns to the master, the encrypted auditing list is also returned to TPA. It is essential to check auditing list correctness and decode it into plaintext form as follows. TPA receives an auditing list from all the workers, and , … , . Note that workers do not have to send TPA a complete copy of the auditing list, but it must send TPA all entries starting from to some one by one.TPA receives auditing lists from all the workers, and travels through those hash lists from auditing list entries (the values), to check whether or not each entry in the hash list is correct.Then, the master decodes all the auditing points from to one by one to get if all the auditing points are correct.
An efficient attribute-based encryption scheme based on SM9 encryption algorithm for dispatching and control cloud
Published in Connection Science, 2021
Honghan Ji, Hongjie Zhang, Lisong Shao, Debiao He, Min Luo
Phase 1. The adversary makes queries of secret key for any attribute (). In order to response the queries of secret keys of with the attributes set Att, the challenger chooses a random variable , and sets . Thus implicitly it sets since: For each attribute , has to calculate two parts as the secret key components. first selects a random and sets . Thus implicitly it sets since: where can be retrieved from the hash list L. Then, .
Energy-efficient distributed password hash computation on heterogeneous embedded system
Published in Automatika, 2022
Branimir Pervan, Josip Knezović, Emanuel Guberović
While all nodes participated in the hash computation (except the Pynq hosted ZTEX board), one node also acted as the master, while the remaining nodes acted as workers. The master node is responsible for: job orchestration through MPI, i.e. starting, stopping, and distributing work packages between worker nodes; The work packages are basically the set of password candidates from the dictionary residing on the shared file which will be used for hash calculation. If the node exhausts its password candidates without computing the hash that is being under cracking, the node can repeat the process for the next hash in the list of hashes to be cracked, also residing in the shared file;synchronization of in-job events. This is necessary because, although distributing the password candidates from the dictionary, and guessing with the different passwords, all nodes attack the same set of hashes to be cracked. To avoid unnecessary guessing, when one of the nodes successfully cracks a bcrypt hash (finds out the password that resulted in the hash), the other nodes are notified so that they do not need to repeated password guessing (hash computation) for that particular hash;hosting the NFS (network file system) used to exchange wordlists with hashes to be cracked and dictionaries of password candidates. In essence, the nodes share the dictionary (exhaustive list of password candidates), the hash list (the list of hashes to be guessed), and passwords list (list of cracked passwords).