Hui Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hui Zhang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Yeow Meng Chee
National University of Singapore, Singapore, Singapore
5 shared publications - Alan Chi Hung Ling
Department of Computer Science, University of Vermont, Burlington, USA
2 shared publications - Eitan Yaakobi
Department of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel
2 shared publications - Han Mao Kiah
School of Physical and Mathematical Sciences Nanyang Technological University Singapore
2 shared publications - Natalia Silberstein
Technion—Israel Institute of Technology
2 shared publications - Tuvi Etzion
Department of Computer Science Technion Haifa Israel
2 shared publications
Latest Publications
- Open Access
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 57910-57920
Robotic Integration of Massage and Real-Time Tissue Assessment: A Technological Framework
Compared with traditional soft tissue assessment devices, the massage robot equipped with a stiffness assessment system that leverages integrated sensors, enables real-time monitoring of soft tissue conditions during massage, thus integrates detection and treatment seamlessly. In this study, we investigate the foundation and applications of the technique for utilizing a massage robot for soft tissue assessment. Specifically, we investigate the technique for stiffness evaluation using finger pressing actions, analogous to the indentation test. Furthermore, machine learning algorithms are employed to classify materials with varying stiffness levels during finger rubbing actions. The results demonstrate the technical superiority of the system in soft tissue assessment and its promising potential for future clinical applications.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 57910-57920
Open AccessRobotic Integration of Massage and Real-Time Tissue Assessment: A Technological Framework
Compared with traditional soft tissue assessment devices, the massage robot equipped with a stiffness assessment system that leverages integrated sensors, enables real-time monitoring of soft tissue conditions during massage, thus integrates detection and treatment seamlessly. In this study, we investigate the foundation and applications of the technique for utilizing a massage robot for soft tissue assessment. Specifically, we investigate the technique for stiffness evaluation using finger pressing actions, analogous to the indentation test. Furthermore, machine learning algorithms are employed to classify materials with varying stiffness levels during finger rubbing actions. The results demonstrate the technical superiority of the system in soft tissue assessment and its promising potential for future clinical applications.
- 30 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6961-6973
Recovery Sets of Subspaces From a Simplex Code
Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question: what is the maximum number of possible pairwise disjoint recovery sets for each recovered element? The recovered elements in this work are d -dimensional subspaces of a k -dimensional vector space over F q . Each server stores one representative for each distinct one-dimensional subspace of the k -dimensional vector space, or equivalently a distinct point of PG( k - 1, q ). As column vectors, the associated vectors of the stored one-dimensional subspaces form the generator matrix of the [( qk - 1)/( q - 1), k , q k-1 ] simplex code over F q . Lower bounds and upper bounds on the maximum number of such recovery sets are provided. It is shown that generally, these bounds are either tight or very close to being tight.
- 30 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6961-6973
Recovery Sets of Subspaces From a Simplex Code
Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question: what is the maximum number of possible pairwise disjoint recovery sets for each recovered element? The recovered elements in this work are d -dimensional subspaces of a k -dimensional vector space over F q . Each server stores one representative for each distinct one-dimensional subspace of the k -dimensional vector space, or equivalently a distinct point of PG( k - 1, q ). As column vectors, the associated vectors of the stored one-dimensional subspaces form the generator matrix of the [( qk - 1)/( q - 1), k , q k-1 ] simplex code over F q . Lower bounds and upper bounds on the maximum number of such recovery sets are provided. It is shown that generally, these bounds are either tight or very close to being tight.
- 3 September 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (12) , 4093-4106
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
- 3 September 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (12) , 4093-4106
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
- 8 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (1) , 255-267
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs), which are replication-based batch codes. The MCBCs allow multiple users to retrieve items in parallel in a distributed storage and a fundamental objective in this study is to determine the minimum total storage given certain requirements. We formulate linear programs so that the optimal solutions provide lower bounds on the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases. Furthermore, for some parameters, we showed that these lower bounds are either tight or asymptotically tight by constructing the corresponding codes.
- 8 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (1) , 255-267
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs), which are replication-based batch codes. The MCBCs allow multiple users to retrieve items in parallel in a distributed storage and a fundamental objective in this study is to determine the minimum total storage given certain requirements. We formulate linear programs so that the optimal solutions provide lower bounds on the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases. Furthermore, for some parameters, we showed that these lower bounds are either tight or asymptotically tight by constructing the corresponding codes.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2364-2368
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs). MCBCs allow multiple users to retrieve items in parallel in a distributed storage system and a fundamental objective in this study is to determine the minimum total storage given certain requirements.We formulate an integer linear programming problem so that its optimal solution provides a lower bound of the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases and also, determine the exact values for some parameters.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2364-2368
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs). MCBCs allow multiple users to retrieve items in parallel in a distributed storage system and a fundamental objective in this study is to determine the minimum total storage given certain requirements.We formulate an integer linear programming problem so that its optimal solution provides a lower bound of the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases and also, determine the exact values for some parameters.
- Open Access
Grassmannian Codes with New Distance Measures for Network Coding
Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet size. The multicast networks which were used for this purpose are generalized combination networks. In both the scalar and the vector network coding solutions, the subspace distance is used as the distance measure for the codes which solve the network coding problem in the generalized combination networks. In this work we show that the subspace distance can be replaced with two other possible distance measures which generalize the subspace distance. These two distance measures are shown to be equivalent under an orthogonal transformation. It is proved that the Grassmannian codes with the new distance measures generalize the Grassmannian codes with the subspace distance and the subspace designs with the strength of the design. Furthermore, optimal Grassmannian codes with the new distance measureshave minimal requirements for network coding solutions of some generalized combination networks. The coding problems related to these two distance measures, especially with respect to network coding, are discussed. Finally, by using these new concepts it is proved that codes in the Hamming scheme form a subfamily of the Grassmannian codes.
Open AccessGrassmannian Codes with New Distance Measures for Network Coding
Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet size. The multicast networks which were used for this purpose are generalized combination networks. In both the scalar and the vector network coding solutions, the subspace distance is used as the distance measure for the codes which solve the network coding problem in the generalized combination networks. In this work we show that the subspace distance can be replaced with two other possible distance measures which generalize the subspace distance. These two distance measures are shown to be equivalent under an orthogonal transformation. It is proved that the Grassmannian codes with the new distance measures generalize the Grassmannian codes with the subspace distance and the subspace designs with the strength of the design. Furthermore, optimal Grassmannian codes with the new distance measureshave minimal requirements for network coding solutions of some generalized combination networks. The coding problems related to these two distance measures, especially with respect to network coding, are discussed. Finally, by using these new concepts it is proved that codes in the Hamming scheme form a subfamily of the Grassmannian codes.
- 23 February 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (11) , 2645-2660
Multiset combinatorial batch codes
- 23 February 2018
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (11) , 2645-2660
Multiset combinatorial batch codes
- Open Access
Multiset Combinatorial Batch Codes
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from each server. Combinatorial batch codes, are replication-based batch codes in which each server stores a subset of the data items. In this paper, we propose a generalization of combinatorial batch codes, called multiset combinatorial batch codes (MCBC), in which $n$ data items are stored in $m$ servers, such that any multiset request of $k$ items, where any item is requested at most $r$ times, can be retrieved by reading at most $t$ items from each server. The setup of this new family of codes is motivated by recent work on codes which enable high availability and parallel reads in distributed storage systems. The main problem under this paradigm is to minimize the number of items stored in the servers, given the values of $n,m,k,r,t$, which is denoted by $N(n,k,m,t;r)$. We first give a necessary and sufficient condition for the existence of MCBCs. Then, we present several bounds on $N(n,k,m,t;r)$ and constructions of MCBCs. In particular, we determine the value of $N(n,k,m,1;r)$ for any $n\geq \left\lfloor\frac{k-1}{r}\right\rfloor{m\choose k-1}-(m-k+1)A(m,4,k-2)$, where $A(m,4,k-2)$ is the maximum size of a binary constant weight code of length $m$, distance four and weight $k-2$. We also determine the exact value of $N(n,k,m,1;r)$ when $r\in\{k,k-1\}$ or $k=m$.Open AccessMultiset Combinatorial Batch Codes
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from each server. Combinatorial batch codes, are replication-based batch codes in which each server stores a subset of the data items. In this paper, we propose a generalization of combinatorial batch codes, called multiset combinatorial batch codes (MCBC), in which $n$ data items are stored in $m$ servers, such that any multiset request of $k$ items, where any item is requested at most $r$ times, can be retrieved by reading at most $t$ items from each server. The setup of this new family of codes is motivated by recent work on codes which enable high availability and parallel reads in distributed storage systems. The main problem under this paradigm is to minimize the number of items stored in the servers, given the values of $n,m,k,r,t$, which is denoted by $N(n,k,m,t;r)$. We first give a necessary and sufficient condition for the existence of MCBCs. Then, we present several bounds on $N(n,k,m,t;r)$ and constructions of MCBCs. In particular, we determine the value of $N(n,k,m,1;r)$ for any $n\geq \left\lfloor\frac{k-1}{r}\right\rfloor{m\choose k-1}-(m-k+1)A(m,4,k-2)$, where $A(m,4,k-2)$ is the maximum size of a binary constant weight code of length $m$, distance four and weight $k-2$. We also determine the exact value of $N(n,k,m,1;r)$ when $r\in\{k,k-1\}$ or $k=m$. - 8 May 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 77 (2-3) , 479-491
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
- 8 May 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 77 (2-3) , 479-491
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
- 9 October 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 24 (2) , 382-406
Optimal Codes in the Enomoto-Katona Space
Coding in a new metric space, called the Enomoto-Katona space, has recently been considered in connection with the study of implication structures of functional dependencies and their generalizations in relational databases. The central problem is the determination ofC(n,k,d), the size of an optimal code of lengthn, weightk, and distancedin the Enomoto-Katona space. The value ofC(n,k,d) was known only for some congruence classes ofnwhen (k,d) ∈ {(2,3),(3,5)}. In this paper, we obtain new infinite families of optimal codes in the Enomoto-Katona space and verify a conjecture of Brightwell and Katona in certain instances. In particular,C(n,k, 2k− 1) is determined for all sufficiently largensatisfying eithern≡ 1 modkandn(n− 1) ≡ 0 mod 2k2, orn≡ 0 modk. We also give complete solutions fork= 2 and determineC(n,3,5) for certain congruence classes ofnwith finite exceptions.
- 9 October 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 24 (2) , 382-406
Optimal Codes in the Enomoto-Katona Space
Coding in a new metric space, called the Enomoto-Katona space, has recently been considered in connection with the study of implication structures of functional dependencies and their generalizations in relational databases. The central problem is the determination ofC(n,k,d), the size of an optimal code of lengthn, weightk, and distancedin the Enomoto-Katona space. The value ofC(n,k,d) was known only for some congruence classes ofnwhen (k,d) ∈ {(2,3),(3,5)}. In this paper, we obtain new infinite families of optimal codes in the Enomoto-Katona space and verify a conjecture of Brightwell and Katona in certain instances. In particular,C(n,k, 2k− 1) is determined for all sufficiently largensatisfying eithern≡ 1 modkandn(n− 1) ≡ 0 mod 2k2, orn≡ 0 modk. We also give complete solutions fork= 2 and determineC(n,3,5) for certain congruence classes ofnwith finite exceptions.