• Journal of the HCI Society of Korea
• /
• v.11 no.1
• /
• pp.21-28
• /
• 2016

This study investigated the usefulness of the wraparound function that are usually employed in information displays of list types within diverse digital devices. The wraparound function indicates the cursor movement jumping to the last/first item when users move up/down the cursor at the first/last item in a list. This study performed two experiments on different kinds and lengths of lists with or without the wraparound function. The experimental results showed that the usefulness of the wraparound depended on the kinds and lengths of the list. In a long list, the wraparound helped to reduce the number of cursor movements, but made the moving speed of the cursor slow. The reason why the moving speed became slow might be because the participants needed the time to decide cognitively on whether they did the wraparound or not. In a more longer list, the increased time required for the decision making could be complemented by the decreased time owing to the reduced number of cursor movements with the effectiveness of the wraparound, thereby reducing total task completion time. Moreover, the participants admitted that the wraparound became more strongly necessary in the case of more long lists.

• The Journal of the Korea Contents Association
• /
• v.16 no.3
• /
• pp.476-487
• /
• 2016

Although the number of adolescents with complicated problems and needs has increased, there has been a limited service for this population. In addition, a traditional social service could not alleviate the problems. In order to provide an alternative to a traditional social service to this population, the wraparound model is reviewed and explored. The study presents a review of literature on wraparound and social work via EBSOCO. By reviewing 12 articles on the subject, the study discovers 3 topics, such as (1) youth with various problems, (2) general characteristics of wraparound, and (3) evidence-based practice and wraparound. Based on 3 topics, the study also discusses the feasibility of wraparound service in Korea.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.670-672
• /
• 2002

본 논문에서는 2개의 랩어라운드 에지를 갖는 m$\times$n(m 2, n$\geq$3, n 흘수) 그리드 그래프에서의 해밀톤 성질을 고려한다. 먼저 그리드 그래프가 해밀톤 연결된(hamiltonian-connected)그래프가 되기 위해 추가로 필요한 에지의 수가 2개 이상임을 보인다. 그리고 m$\times$n 그리드 그래프의 첫 행에 랩어라운드 에지를 추가한 그래프의 해밀톤 성질을 보인 후, m$\times$n 그리드 그래프의 첫 행과 마지막 행에 램어라운드 에지를 추가한 그래프가 해밀톤 연결된 그래프임을 보인다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.2
• /
• pp.234-244
• /
• 2001

다양한 지형정보를 제공하는 SAR 인터페로메트리 기법은 레이다의 위상정보를 이용하여 정밀 고도정보를 추출하는 첨단기술이다. SAR 데이터 주파수 aliasing 현상은 도플러 중심 주파수가 중심에 위치하지 않으므로 발생된느 것으로 주요 잡음요인으로 작용된다. 따라서 본 논문에서는 SAR 인터페로메드리 전체 프로세싱 과정의 주요 모듈중 하나인 주파수 aliasing 제거 모듈의 구현 방안을 연구하였다. 본 논문에서 사용된 aliasing 제거 기법은 랩어라운드교정기법으로서 실험결과 매우 효과적으로 작용하였음을 알 수 있었으며, 제안된 구현방안은 차후 실제 적용이 가능함을 제시하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.434-444
• /
• 2003

In this paper, we consider the hamiltonian properties of m$\times$n (m$\geq$2, n$\geq$3) mesh networks with two wraparound edges on the first row and last row, called M$_2$(m, n), in the presence of a faulty node or link. We prove that M$_2$(m, n) with odd n is hamiltonian-connected and 1-fault hamiltonian. In addition, we prove that M$_2$(m, n) with even n is strongly hamiltonian laceable and 1-vertex fault tolerant strongly hamiltonian laceable.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.63-66
• /
• 2002

In this paper, we consider the hamiltonian properties of m ${\times}$ n mesh networks with two wrap-around edges. We describe sufficient condition that at least two edges should be added to a mesh to make it hamiltonian-connected. We propose two graphs, M1(ｍ,n) and M2(ｍ,n). These are obtained by adding one and two edges respectively in the ｍ${\times}$ｎ mesh. We show the hamiltonian properties of M1(ｍ,n) and prove that M2(m, n) is hamiltonian-connected using the hamiltonian properties of M1(ｍ,n).

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.10
• /
• pp.1305-1313
• /
• 2013

In this study, a method to apply feature-based simplification to boundary representation models is proposed. For feature-based simplification, a volume decomposition tree is created from a boundary representation model. The volume decomposition tree is represented by regularized Boolean operations of additive volumes, subtractive volumes, and fillet/round/chamfer volumes, and it is generated by stepwise volume decomposition, which consists of fillet/round/chamfer decomposition, wrap-around decomposition, volume split decomposition, and cell-based decomposition. After the volume decomposition tree is transformed to an infix expression, the CAD model can be simplified by reordering the volumes. To verify the proposed method, a prototype system was implemented, and experiments on test cases were conducted. From the results of the experiments, it is verified that the proposed method is useful for simplifying CAD models based on boundary representation.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.189-198
• /
• 2004

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.