[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Distance-Regular Graphs

In this review, for a variety of metals and semiconductors, an attempt is made to generalize observations in the literature on the effect of process conditions applied during photodeposition on (i) particle size distributions, (ii) oxidation states of the metals obtained, and (iii) consequences for photocatalytic activities. Process parameters include presence or absence of (organic) sacrificial agents, applied pH, presence or absence of an air/inert atmosphere, metal precursor type and concentration, and temperature. Most intensively reviewed are studies concerning (i) TiO2; (ii) ZnO, focusing on Ag deposition; (iii) WO3, with a strong emphasis on the photodeposition of Pt; and (iv) CdS, again with a focus on deposition of Pt. Furthermore, a detailed overview is given of achievements in structure-directed photodeposition, which could ultimately be employed to obtain highly effective photocatalytic materials. Finally, we provide suggestions for improvements in description of the photodeposition methods applied when included in scientific papers.

Methods, Mechanism, and Applications of Photodeposition in Photocatalysis: A Review.

国際会議開催報告:2013 IEEE International Symposium on Information Theory

In this paper, the hierarchical SnO2 nanostructures (HTNs) were prepared by a facile hydrothermal process. The prepared HTNs were characterized in detail by various analytical techniques that reveal the well-crystallinity with tetragonal rutile structure of SnO2 for the as-prepared material. By detailed experiments, interestingly, it was observed that the shapes and sizes of as-prepared HTNs could be tailored by varying the precursor concentration and reaction time. The synthesized HTNs were used as the efficient photocatalysts for the photocatalytic degradation of methylene blue (MB) under light illumination which showed almost complete degradation (∼99%) of MB dye in 20 min. The observed degradation for MB dye was higher than other commonly used dyes, i.e. methyl orange (MO; 96% in 50 min) and Rhodamine B (RhB; 97% in 40 min.). Further, the prepared HTNs were used as the effective gas sensing material to examine a series of volatile gases, such as ethanol, ammonia, benzene, acetone, toluene, methanol, d...

Hierarchical SnO2 Nanostructures Made of Intermingled Ultrathin Nanosheets for Environmental Remediation, Smart Gas Sensor, and Supercapacitor Applications

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field $${\mathbb {F}}_p$$Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.

Linear codes with two or three weights from quadratic Bent functions

A class of three-weight cyclic codes

Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent functions and determines the weight distributions of these linear codes. It solves an open problem proposed by Ding et al. Furthermore, this paper constructs new linear codes with two or three weights and presents their weight distributions. They contain some optimal codes meeting certain bound on linear codes.

Linear Codes With Two or Three Weights From Weakly Regular Bent Functions

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied. In this paper, we show that for any $K$ -sparse signal ${\boldsymbol{x}}$ , if a sensing matrix $\boldsymbol{A}$ satisfies the restricted isometry property (RIP) with restricted isometry constant $\delta _{K+1} , then under some constraints on the minimum magnitude of nonzero elements of ${\boldsymbol{x}}$ , OMP exactly recovers the support of ${\boldsymbol{x}}$ from its measurements ${\boldsymbol{y}}=\boldsymbol{A}{\boldsymbol{x}}+\boldsymbol{v}$ in $K$ iterations, where $\boldsymbol{v}$ is a noise vector that is $\ell _2$ or $\ell _{\infty }$ bounded. This sufficient condition is sharp in terms of $\delta _{K+1}$ since for any given positive integer $K$ and any $1/\sqrt{K+1}\leq \delta , there always exists a matrix $\boldsymbol{A}$ satisfying the RIP with $\delta _{K+1}=\delta$ for which OMP fails to recover a $K$ -sparse signal ${\boldsymbol{x}}$ in $K$ iterations. Also, our constraints on the minimum magnitude of nonzero elements of ${\boldsymbol{x}}$ are weaker than existing ones. Moreover, we propose worst case necessary conditions for the exact support recovery of ${\boldsymbol{x}}$ , characterized by the minimum magnitude of the nonzero elements of ${\boldsymbol{x}}$ .

Zhengchun Zhou

Papers

Linear codes with two or three weights from quadratic Bent functions

A class of three-weight cyclic codes

Linear Codes With Two or Three Weights From Weakly Regular Bent Functions

A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit

Three-weight cyclic codes and their weight distributions