User:Lambda1991/sandbox

Haiyang Liu "Polar bear with sulfuric acid" incident 刘海洋伤熊案件
Liu Haiyang, when he was a student in the Mechanical and Electrical Department of Tsinghua University, severely injured five bears with sulfuric acid in the Beijing Zoo. After the incident was exposed, it caused great repercussions in the society. On January 29, February 5 and 23, 2002, Liu Haiyang, a 22-year-old student in the Department of Mechanical and Electrical Engineering of Tsinghua University, injured five bears with sulfuric acid at the Beijing Zoo. In January and February 2002, Liu Haiyang successively threw sodium hydroxide (commonly known as "caustic soda") solution and sulfuric acid solution to the black bears and brown bears in the exhibition area of Xiongshan in Beijing Zoo twice. Feeding and dumping resulted in varying degrees of damage to 3 black bears and 2 brown bears (all of which belong to the second-class national protected animals in China). On the morning of April 29, 2003, the "Liu Haiyang Sulfuric Acid Pollution Bear Case" was held in Beijing and the verdict was pronounced. In the end, the court ruled that the defendant Liu Haiyang committed the crime of intentionally destroying property and exempted him from criminal punishment.

Follow-up: Five bears die

Haiyang Liu is currently working at the Chinese Academy of Sciences.

Personal Resume：

2023/3/8 11:01 刘海洋--中国科学院微电子研究所

1. Chen C, Liu H, Bai B. Finite hyperplane codes: minimum distance and majority-logic decoding. Proc. IEEE International Symposium on Information Theory (ISIT), 2018, 2500-2504.

2. Liu H, LI Ping. Low-rate regular concatenated zigzag codes are capacity-approaching over the BEC. Proc. IEEE Information Theory Workshop (ITW), 2017, 111-115.

3. Liu H, Kim D, Li Y, et al. On the separating redundancy of extended Hamming codes. Proc. IEEE International Symposium on Information Theory (ISIT), 2015, 2406-2410.

1. Liu H, Jiao X. More on the minimum and stopping distances of RS-LDPC codes. IEEE Communications Letters, 2020, 24(3): 482-485.

2. Kong L, Liu Y, Liu H, et al. Protograph QC-LDPC and rate-adaptive polar codes design for MLC NAND flash memories. IEEE Access, 2019, 7: 37131-37140.

3. Liu H, Ma L, Zhang H. On the minimum distance of some improper array codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(12): 2021-2026.

4. Liu H, Ma L. Further results on the separating redundancy of binary linear codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(10): 1420-1425.

5. Liu H, Li Y, Ma L. On the separating redundancy of the duals of first-order generalized Reed-Muller codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019, E102-A(1): 310-315.

6. Liu H, Li Y, Ma L. On the second separating redundancy of LDPC codes from finite planes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018, E101-A(3): 617-622.

7. Liu H, Zhang H, Ma L. On the spark of binary LDPC measurement matrices from complete protographs. IEEE Signal Processing Letters, 2017, 24(11): 1616-1620.

8. Liu H, Zhang H, Ma L. Further results on the minimum and stopping distances of full-length RS-LDPC codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017, E100-A(2): 738-742.

9. Liu H, Ma L. On the minimum distance of full-length RS-LDPC codes. IEEE Communications Letters, 2015, 19(11): 1869-1872.

www.ime.ac.cn/sourcedb_ime_cas/zw/zjrck/201611/t20161125_4702114.html 2/4

文论议会



者与参要主 .21.7102-1.4102 .目项金基学科然自家国 .现实与计设统系知感缩压的码验校偶奇度密低于基 .6

人责负目项 .21.5102-1.3102 .目项金基学科然自家国 .究研法方码译划规性线的码CPDL制进多 .5

人责负目项 .21.8102-1.5102 .目项会进促新创年⻘院学科国中 .4

人责负目项 .4.7102-2.5102 .目项”划计者学江香“.码编络网的中统系OMIM大 .3

人责负目项

.5.0202-6.9102 .题课放开室验实术技成集与件器子电微院学科国中 .究研术技码编错纠的中器储存质介新度密高 .2

人责负目项 .21.2202-1.9102 .目项金基学科然自家国 .究研题问码译然似大最和码译划规性线的码化极 .1



文论刊期

2023/3/8 11:01 刘海洋--中国科学院微电子研究所

10. Liu H, Huang Q, Deng G, et al. Quasi-cyclic representation and vector representation of RS-LDPC codes. IEEE Transactions on Communications, 2015, 63(4): 1033-1042.

11. Liu H, Deng G, Chen J. On the minimum-weight codewords of array LDPC codes with column weight 4. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014, E97-A(11): 2236- 2246.

12. Liu H, Yang S, Deng G, et al. More on the minimum distance of array LDPC codes. IEEE Communications Letters, 2014, 18(9): 1479-1482.

13. Liu H, Li Y, Ma L, et al. On the smallest absorbing sets of LDPC codes from finite planes. IEEE Transactions on Information Theory, 2012, 58(6): 4014-4020.

14. Liu H, He L, Chen J. Further results on the stopping distance of array LDPC matrices. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2012, E95-A(5): 918-926.

15. Liu H, Qu W, Liu B, et al. On the decomposition method for linear programming decoding of LDPC codes. IEEE Transactions on Communications, 2010, 58(12): 3448- 3458.

16. Liu H, Ma L, Chen J. On the number of minimum stopping sets and minimum codewords of array LDPC codes. IEEE Communications Letters, 2010, 14(7): 670-672.

17. Liu H, Qu W, Liu B, et al. Novel modified min-sum decoding algorithm for low-density parity-check codes. The Journal of China Universities of Posts and Telecommunications, 2010, 17(4):1-5.

18. Liu H, Ma L, Chen J. Multistep linear programming approaches for decoding low-density parity-check codes. Tsinghua Science and Technology, 2009, 14(5): 556-560.

19. Liu H, Lin X, Ma L, et al. On the stopping distance and stopping redundancy of finite geometry LDPC codes. IEICE Fundamentals of Electronics, Communications and Computer Sciences, 2008, E91-A(8): 2159-2166.

Reference
http://www.ime.ac.cn/sourcedb_ime_cas/zw/zjrck/201611/t20161125_4702114.html

https://baike.baidu.com/item/%E5%88%98%E6%B5%B7%E6%B4%8B/22341345?fr=aladdin