• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.17-26
• /
• 2014

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of genus 3 hyperelliptic curves of type $y^2=x^7+ax$ over finite prime fields. The problem of determining the group order of the Jacobian varieties of algebraic curves defined over finite fields is important not only arithmetic geometry but also curve-based cryptosystems in order to find a secure curve. Based on this, we provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian variety of hyperelliptic curve $y^2=x^7+ax$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ modulo 12. Moreover, we also introduce some implementation results by using our algorithm.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.5
• /
• pp.471-482
• /
• 2016

In this study, we focused on a speed-up of KIESSI-3D program, which is based on FE-IE techniques, by introducing a p-version dynamic infinite element method. In order to evaluate performance of the KIESSI-3D, numerical analyses for eight real-scale SSI problems are carried out. We considered three types of KIESSI-3D numerical models whose radii of near-field soil region($r_0$)are 1.2, 1.5, and 3.0 times of basemat radius of structure(R). In addition, SSI analyses using the SASSI2010 program are carried out used for comparison of accuracy and runtime against those of the KIESSI-3D. Numerical results show that the KIESSI-3D model of $r_0=1.2R$ is enough to give accurate solution. In view of the computing speed, the new KIESSI-3D was up to 25 times faster than the old KIESSI-3D.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.304-309
• /
• 2007

What is important in ubiquitous computing is collecting users' context information from various sensors and providing services suitable for use's current situation. Particularly in mobile environment, each area has different context awareness structure and this makes it difficult to share information with other areas. As a result, context resources for recognizing users' context ate insufficient. Moreover, because mobile devices have a limited processing capacity, there are difficulties in the real time analysis of users' context. This paper proposed a context awareness and integration model for analyzing users' context actively and providing adaptive services using mobile devices. The proposed model distinguishes users' context between dynamic and static structure to analyze the context, and obtains context resources by sharing context information of users within an area.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.540-542
• /
• 2014

The Universal Plug and Play (UPnP) specification permits networked devices to discover each other and to provide diverse services in the home network environment. Recently, new paradigms such as mobile connected computing, cloud-based service delivery, smart device content sharing, and Internet of Things (IoT) have emerged, but the home network based UPnP shows functional limitations in supporting such paradigms. To support them, the UPnP Forum has recently extended the capabilities of the existing UPnP, calling it UPnP+. In this paper, the UPnP Device Architecture V2.0 (UDA 2.0), which forms the basis of UPnP+, is presented. We present how UDA 2.0 enables the expansion of the home network to wide-area networks and non-IP device domains.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3960-3975
• /
• 2022

To analyze and compare the most influencing factors on cloud computing adoption (CCA) in the healthcare organization, a systematic review and meta-analyses of studies was performed using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and Cochrane collaboration recommendations. A search of PubMed, ScienceDirect, Springer, Wiley Online, and Taylor & Francis Online digital libraries (From inception to January 19, 2022) was performed. A total of 17 studies met the defined studies' inclusion and exclusion criteria. Statistical significance difference favoring most influencing factors on CCA were (MD 0.76, 95% CI -1.48 - 3.01, p <0.00001, I² = 90%), (MD 1.40, 95% CI -4.76 - 7.55, p < 0.00007, I² = 97%) (MD 0.17, 95% CI -2.69 - 3.03, p<0.00001, I² = 96%) for technology vs. organizational, technology vs. environmental and business vs. human factors, respectively. Organizational and environmental factors had greater impacts on CCA compared with technological factors. Moreover, business factors were more influential than the human factors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.433-435
• /
• 2006

P2P 그리드 컴퓨팅 환경에서 자원제공자가 수행한 연산 결과의 정확성을 보장하는 것은 중요한 고려사항이다. 기존의 연산 결과 검사에 대한 연구들은 중앙 서버가 연산 결과를 관리하는 중앙집중형 환경에서 이루어졌다. 그러나 중앙집중형 환경에서 중앙 서버의 부하로 인한 확장성 문제로 최근에는 분산형 환경에서 많은 연구가 진행 중이나 연산 결과 검사에 대한 연구는 없는 실정이다. 게다가 분산형 환경은 연산 결과를 관리하는 중앙 서버의 부재로 연산 결과를 신뢰하기 어렵고, 또한 검사하기도 어렵다. 이에 본 논문에서는 분산형 P2P 그리드 컴퓨팅 환경에서 자원제공자의 평판도 기반연산 결과 검사 기법을 제안한다. 제안 기법은 자원제공자의 가용성과 평판도를 기반으로 작업 트리를 구성한 후, 트리의 단계별 특징에 따라 차별화 된 연산 결과 검사와 스케줄링을 수행하여, 기존 연산 결과 검사 기법을 분산형 환경에 그대로 적용할 때보다 연산 결과의 정확성은 보장하면서 연산 결과 검사로 인한 부하는 감소시킨다.

• Journal of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1431-1443
• /
• 2016

Let k be a global field of characteristic unequal to two. Let $C:y^2=f(x)$ be a nonsingular projective curve over k, where f(x) is a quartic polynomial over k with nonzero discriminant, and K = k(C) be the function field of C. For each prime spot p on k, let ${\hat{k}}_p$ denote the corresponding completion of k and ${\hat{k}}_p(C)$ the function field of $C{\times}_k{\hat{k}}_p$. Consider the map $$h:Br(K){\rightarrow}{\prod\limits_{\mathfrak{p}}}Br({\hat{k}}_p(C))$$, where p ranges over all the prime spots of k. In this paper, we explicitly describe all the constant classes (coming from Br(k)) lying in the kernel of the map h, which is an obstruction to the Hasse principle for the Brauer groups of the curve. The kernel of h can be expressed in terms of quaternion algebras with their prime spots. We also provide specific examples over ${\mathbb{Q}}$, the rationals, for this kernel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.73-85
• /
• 2004

SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.31-39
• /
• 2007

To perform on-line cyber education, it is indispensable to delivery contents file to participant users. When users' requests occur simultaneously in a shot period, server falls into overload phase. A common to avoid overload is a software solution based on P2P, which does no cost any additional expense. But, in this solution, it yields many problems such as service delay and system failure because of peer self-control. In this paper we propose an efficient load balancing policy based on P2P system. which is the contents delivery system for cyber education system using idle computing power in the proposed solution, we present server selection scheme called P2P-Pattern method, which results in minimum service delay. we can see that our scheme outperforms previous scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.401-407
• /
• 2016

We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).