• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.724-739
• /
• 2009

This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.227-234
• /
• 2009

OSGi technology has applied to Home Network, but now it is loaded into even heterogeneous devices in various domains. Therefore, it is necessary to cooperate with each other framework for offering effective services in distributed OSGi frameworks. However until now, OSGi specification doesn't provide any methodthat can share the services registered on remote OSGi frameworks. In order to solve this problem, there have been several researches that used existing distributed middleware technologies such as JXTA and Web Services. However these technologies have some weakness, that is, they consume lots of computing resources and need additional process to transform the services. A middleware called R-OSGi uses only OSGi technology for sharing remote OSGi services, but R-OSGi may have a communication bottleneck and SPOF (Single Point of Failure) problem, because it has a central service registry. In this paper we present RSP (Remote Service Provider), which is a P2P-based effective service sharing scheme on distributed OSGi framework. RSP doesn't need to install additional software nor have the additional transformation process of the service representation, because it uses only OSGi technology. In addition it doesn't have any bottleneck problem and improves scalability by providing the service discovery mechanism using P2P. RSP can also access remote services transparently and it can guarantee reliability by sending an immediate notice about changes of the remote services.

• Nuclear Engineering and Technology
• /
• v.46 no.2
• /
• pp.263-272
• /
• 2014

Scattering source calculations using conventional spherical harmonic expansion may require lots of computation time to treat full-coupled three-dimensional photon-electron transport in a highly anisotropic scattering medium where their scattering cross sections should be expanded with very high order (e.g., $P_7$ or higher) Legendre expansions. In this paper, we introduce a modified scattering kernel approach to avoid the unnecessarily repeated calculations involved with the scattering source calculation, and used it with parallel computing to effectively reduce the computation time. Its computational efficiency was tested for three-dimensional full-coupled photon-electron transport problems using our computer program which solves the multi-group discrete ordinates transport equation by using the discontinuous finite element method with unstructured tetrahedral meshes for complicated geometrical problems. The numerical tests show that we can improve speed up to 17~42 times for the elapsed time per iteration using the modified scattering kernel, not only in the single CPU calculation but also in the parallel computing with several CPUs.

• Annual Conference on Human and Language Technology
• /
• 2023.10a
• /
• pp.203-208
• /
• 2023

본 논문에서는 대규모 언어 모델의 인컨텍스트 러닝과 프롬프팅을 활용하여 수치 추론 태스크 데이터셋을 효과적으로 증강시킬 수 있는 방법론을 제안한다. 또한 모델로 하여금 수치 추론 데이터의 이해를 도울 수 있는 전처리와 요구사항을 만족하지 못하는 결과물을 필터링 하는 검증 단계를 추가하여 생성되는 데이터의 퀄리티를 보장하고자 하였다. 이렇게 얻어진 증강 절차를 거쳐 증강을 진행한 뒤 추론용 모델 학습을 통해 다른 증강 방법론보다 우리의 방법론으로 증강된 데이터셋으로 학습된 모델이 더 높은 성능을 낼 수 있음을 보였다. 실험 결과 우리의 증강 데이터로 학습된 모델은 원본 데이터로 학습된 모델보다 모든 지표에서 2%p 이상의 성능 향상을 보였으며 다양한 케이스를 통해 우리의 모델이 수치 추론 학습 데이터의 다양성을 크게 향상시킬 수 있음을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.764-767
• /
• 2021

While Generative Adversarial Networks (GANs) have seen huge success in image synthesis tasks, synthesizing high-quality images from text descriptions is a challenging problem in computer vision. This paper proposes a method named Text-to-Face Generation Using Multi-Scale Gradients for Conditional Generative Adversarial Networks (T2F-MSGGANs) that combines GANs and a natural language processing model to create human faces has features found in the input text. The proposed method addresses two problems of GANs: model collapse and training instability by investigating how gradients at multiple scales can be used to generate high-resolution images. We show that T2F-MSGGANs converge stably and generate good-quality images.

• Kyungpook Mathematical Journal
• /
• v.49 no.2
• /
• pp.265-281
• /
• 2009

In the present paper, we introduce and investigate a new subclass of multivalent functions associated with the Cho-Kwon-Srivastava operator $\tau^{\lambda}_p(a,c)$. Such results as inclusion relationships, convolution properties and criteria for starlikeness are proved. Relevant connections of the results presented here with those obtained in earlier works are also pointed out.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.105-113
• /
• 2004

If the protocol has fast operations and short key length, it can be efficient user authentication protocol Lenstra and Verheul proposed XTR. XTR have short key length and fast computing speed. Therefore, this can be used usefully in complex arithmetic. In this paper, to design efficient user authentication protocol we used a subgroup of Galois Field to problem domain. Proposed protocol does not use GF($p^6$) that is existent finite field, and uses GF($p^2$) that is subgroup and solves problem. XTR-ElGamal based user authentication protocol reduced bit number that is required when exchange key by doing with upside. Also, Proposed protocol provided easy calculation and execution by reducing required overhead when calculate. In this paper, we designed authentication protocol that is required to do user authentication.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.349-352
• /
• 2006

The conventional segregated finite element formulation produces a small and simple matrix at each step than in an integrated formulation. And the memory and cost requirements of computations are significantly reduced because the pressure equation for the mass conservation of the Navier-Stokes equations is constructed only once if the mesh is fixed. However, segregated finite element formulation solves Poisson equation of elliptic type so that it always needs a pressure boundary condition along a boundary even when physical information on pressure is not provided. On the other hand, the conventional integrated finite element formulation in which the governing equations are simultaneously treated has an advantage over a segregated formulation in the sense that it can give a more robust convergence behavior because all variables are implicitly combined. Further it needs a very small number of iterations to achieve convergence. However, the saddle-paint-type matrix (SPTM) in the integrated formulation is assembled and preconditioned every time step, so that it needs a large memory and computing time. Therefore, we newly proposed the P2PI semi-segregation formulation. In order to utilize the fact that the pressure equation is assembled and preconditioned only once in the segregated finite element formulation, a fixed symmetric SPTM has been obtained for the continuity constraint of the present semi-segregation finite element formulation. The momentum equation in the semi-segregation finite element formulation will be separated from the continuity equation so that the saddle-point-type matrix is assembled and preconditioned only once during the whole computation as long as the mesh does not change. For a comparison of the CPU time, accuracy and condition number between the two methods, they have been applied to the well-known benchmark problem. It is shown that the newly proposed semi-segregation finite element formulation performs better than the conventional integrated finite element formulation in terms of the computation time.

• Journal of Internet Computing and Services
• /
• v.16 no.4
• /
• pp.101-110
• /
• 2015

$21^{st}$ century has seen a tremendous advancement in the field of Information and Communication Technology. The commercial utilization of Internet tools and technologies has brought change in the traditional working environment. The functioning in an electronic environment is far more complicated than working in traditional environment and this brings many challenges, threats and potential problems. In this paper we analyze the challenges, threats and potential problems in the working environment of Pokhara University due to application of Internet tools and technology. We have chosen four basic areas on the basis of use that include web resources, electronic mails, social sites and P2P technologies. The main focus is to analyze the impact on work place productivity, social interaction, use and abuse of technology and legal issues associated with them. We, finally summarize the findings and offer solutions and recommendations from the observed data based on direct survey conducted in Pokhara University, Nepal.

• Journal of Computing Science and Engineering
• /
• v.5 no.1
• /
• pp.19-31
• /
• 2011

In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.