• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.3
• /
• pp.543-552
• /
• 2012

In this paper, we will show that if ${\mu}$ is a Borel measure on the unit disk D such that ${\int}_{D}\frac{d{\mu}(z)}{(1-\left|z\right|^2)^{p\alpha}}$ < ${\infty}$ where 0 < ${\alpha},{\rho}$ < ${\infty}$, then a bounded sequence of functions {$f_n$} in the $\alpha$-Bloch space $\mathcal{B}{\alpha}$ has a convergent subsequence in the space $D_p({\mu})$ of analytic functions f on D satisfying $f^{\prime}\;{\in}\;L^p(D,{\mu})$. Also, we will find some conditions such that ${\int}_D\frac{d\mu(z)}{(1-\left|z\right|^2)^p$.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.155-157
• /
• 2024

Internet of Things (IoT) integrated with the Blockchain is the state of the art for keen cultivation and agriculture. Recently the interest in agribusiness information is enlarging owing to the fact of commercializing the smart farming technology. Agribusiness information are known to be untidy, and experts are worried about the legitimacy of information. The blockchain can be a potential answer for the expert's concern on the uncertainty of the agriculture data. This paper proposes an Agri-Banana plant system using Blockchain integrated with IoT. The system is designed by employing IoT sensors incorporated with Hyperledger fabric network, aims to provide farmers with secure storage for preserving the large amounts of IoT and agriculture data that cannot be tampered with. A banana smart contract is implemented between farmer peer and buyer peer of two different organizations under the Hyperledger fabric network setup aids in secure transaction of transferring banana from farmer to buyer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2882-2903
• /
• 2022

Image super-resolution (SR) processing is of great value in the fields of digital image processing, intelligent security, film and television production and so on. This paper proposed a densely connected deep learning network based on cascade architecture, which can be used to solve the problem of super-resolution in the field of image quality enhancement. We proposed a more efficient residual scaling dense block (RSDB) and the multi-channel cascade architecture to realize more efficient feature reuse. Also we proposed a hybrid loss function based on L₁ error and L_∞ error to achieve better L_∞ error performance. The experimental results show that the overall performance of the network is effectively improved on cascade architecture and residual scaling. Compared with the residual dense net (RDN), the PSNR / SSIM of the new method is improved by 2.24% / 1.44% respectively, and the L_∞ performance is improved by 3.64%. It shows that the cascade connection and residual scaling method can effectively realize feature reuse, improving the residual convergence speed and learning efficiency of our network. The L_∞ performance is improved by 11.09% with only a minimal loses of 1.14% / 0.60% on PSNR / SSIM performance after adopting the new loss function. That is to say, the L_∞ performance can be improved greatly on the new loss function with a minor loss of PSNR / SSIM performance, which is of great value in L_∞ error sensitive tasks.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.177-182
• /
• 2013

In this paper, printed antenna which can be applied to a built-in wireless module of the security controller operating at global positioning system(GPS) L1 frequency band(1.575GHz) is proposed. The proposed antenna is basically composed of a microstrip patch antenna with inserting feed. In particular left and right slots which are respectively asymmetric are used for impedance matching, whereas slot with one open-end and shorting point are used on the bottom plane to set operating frequency and enhance bandwidth. It is observed at the desired GPS L1 frequency band that the radiation efficiency and gain of the proposed antenna are 90% and more than 4.8dBi respectively.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.697-705
• /
• 2014

For a complex measure ${\mu}$ on B and $f{\in}L^2_a(B)$, the Toeplitz operator $T_{\mu}$ on $L^2_a(B,dv)$ with symbol ${\mu}$ is formally defined by $T_{\mu}(f)(w)=\int_{B}f(w)\bar{K(z,w)}d{\mu}(w)$. We will investigate properties of the Toeplitz operator $T_{\mu}$ with symbol ${\mu}$. We define the Toeplitz type operator $T^r_{\psi}$ with symbol ${\psi}$, $$T^r_{\psi}f(z)=c_r\int_{B}\frac{(1-{\parallel}w{\parallel}^2)^r}{(1-{\langle}z,w{\rangle})^{n+r+1}}{\psi}(w)f(w)d{\nu}(w)$$. We will also investigate properties of the Toeplitz type operator with symbol ${\psi}$.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.694-695
• /
• 2011

The recent concerns over the threat of global climate change and the requirements of national reduction of $CO_2$ emission have led to the diversification of energy resources and a large scale integration of renewable resources. In these circumstances, the policy decision currently made by the government sector includes several programs to promote the equipment of large scale generating assets to use wind energy. However, the power systems and wind farms need such innovative operation scheme schemes that maintain an adequate level of system security for continuing growth of renewable resources. This paper presents a method for determining optimal operating points for wind farms by making use of a nonlinear interior point method.

• Communications of the Korean Mathematical Society
• /
• v.22 no.1
• /
• pp.65-74
• /
• 2007

Suppose that $\mu$ is a finite positive Borel measure on bounded symmetric domain $\Omega{\subset}\mathbb{C}^n\;and\;\nu$ is the Euclidean volume measure such that $\nu(\Omega)=1$. Suppose 1 < p < $\infty$ and r > 0. In this paper, we will show that the norms $sup\{\int_\Omega{\mid}k_z(w)\mid^2d\mu(w)\;:\;z\in\Omega\}$, $sup\{\int_\Omega{\mid}h(w)\mid^pd\mu(w)/\int_\Omega{\mid}h(w)^pd\nu(w)\;:\;h{\in}L_a^p(\Omega,d\nu),\;h\neq0\}$ and $$sup\{\frac{\mu(E(z,r))}{\nu(E(z,r))}\;:\;z\in\Omega\}$$ are are all equivalent. We will also show that the inclusion mapping $ip\;:\;L_a^p(\Omega,d\nu){\rightarrow}L^p(\Omega,d\mu)$ is compact if and only if lim $w\rightarrow\partial\Omega\frac{\mu(E(w,r))}{\nu(E(w,r))}=0$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.393-398
• /
• 2007

데이터의 양이 급격히 커지면서, 그에 따라 요구되는 스토리지의 확장 비용 및 관리의 어려움을 해결하기 위하여 네트워크 스토리지에 대한 관심이 증대되고 있다. 네트워크 스토리지는 다수의 사용자가 접근하여 하기 때문에 보안에 대한 심각한 고려가 필요하다. 보안을 강화하기 위하여 페어 키를 이용한 인증 방식을 사용하고 있는데, 이러한 소프트웨어적인 보안 방식은 시스템 보안의 결함 혹은 취약성에 의하여 키의 외부 유출이 가능하다 [11]. 본 연구에서는 L4 마이크로커널[1]과 하드웨어적 보안 방식인 TPM (Trusted Platform Module)[2]을 사용하여 네트워크 스토리지 보안을 강화 시 방법을 제안하고자 한다. 본 연구를 이용할 경우 authenticated boot 기법[3]을 이용하여 네트워크 스토리지에서 동작할 이미지를 검증하고, 하드웨어적으로 암호화 키 값을 관리함으로써 데이터 패킷의 전송 과정에서 발생할 수 있는 소프트웨어적인 보안 방식의 취약점을 보완할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1035-1038
• /
• 2004

스테가노그라피는 비밀 정보를 이미지나 오디오, 비디오 또는 텍스트 등 커버(cover) 라고 불리는 다른 미디어에 숨겨서 전송하는 방법으로 제 3자는 정보가 숨겨져 있다는 사실 자체를 알지 못하도록 하는 것이다. 대부분 영상 데이터를 이용하고 있으나, 제한된 색으로만 구성된 이진 영상 및 다치 영상의 경우 비시각적으로 비밀 정보를 숨기는 것이 일반 컬러 또는 그레이 영상에 비해 어려움이 있다. 본 논문에서는 가중치 테이블을 사용하여 영상의 한 블록에 최대 2비트만을 변경시키면서 많은 양의 정보를 숨기는 방법을 제안한다.

• Journal of Internet of Things and Convergence
• /
• v.6 no.2
• /
• pp.25-29
• /
• 2020

The elliptic curve crypto-algorithm is widely used in authentication for IoT environment, since it has small key size and low communication overhead compare to the RSA public key algorithm. If the scalar multiplication, a core operation of the elliptic curve crypto-algorithm, is not implemented securely, attackers can find the secret key to use simple power analysis or differential power analysis. In this paper, an elliptic curve scalar multiplication algorithm using a randomized scalar and an elliptic curve point blinding is suggested. It is resistant to power analysis but does not significantly reduce efficiency. Given a random r and an elliptic curve random point R, the elliptic scalar multiplication kP = u(P+R)-vR is calculated by using the regular variant Shamir's double ladder algorithm, where l+20-bit u≡rn+k(modn) and v≡rn-k(modn) using 2^lP=∓cP for the case of the order n=2^l±c.