Since nursing has come of age both as a profession and as a scholarly discipline, there has been increasing concern with delineating its theory base. In 1978 Chinn and Jacobs asserted that “the development of theory is the most crucial task facing nursing today.” The basic building blocks of theories are concepts. Concept formation begins in infancy, for concepts help us to categorize and organize our environmental stimuli. Concepts help us to identify how our experiences are similar or equivalent by categorizing all the things that are alike about them. concepts can be primitive, concrete, or abstract. Concept Analysis is a strategy that examines the attributes or characteristics of a concept. It is a formal, linguistic exercise to determine those defining attributes. It encourages communication. Its basic purpose is to distinguish between the defining and irrelevant attributes of a concept similarities. It is a process of determining the differences between concepts and it is useful for several reasons. It is an excellent way to begin examining information in preparation for research or theory construction and results in an operational definition and a list of defining attributes and antecedents. It provides the scientist with an excellent beginning for a new tool, is an excellent way of evaluating an old one and is useful in evaluating existing instruments. The steps of concept analysis are : 1. Select a concept, 2. Determine the aims or purposes of the analysis, 3. Identify all uses of the concept that you can discover, 4. Determine the defining attributes, 5. Construct a model case, 6. Construct borderline, re-lated, contrary, invented, and illegitimate cases, 7. Identify antecedents and consequences, 8. Define empirical referents. In this paper, the concept selected for analysis was Love. The concept of love is of great interest to nursing because loving care is considered vital to the nursing care of patients. The aims of the concept analysis of love were to clarify the meaning of love, to develop an operational definition for it and to contribute to existing nursing theory. Love influences the quality of life which is the goal of nursing according to Parse in her Human Becoming Theory. Lived experiences are the entities for study in Parse's Research Methodology. Human caring, human understanding, and human becoming are the most important issues in lived experiences. In this research, dictionaries and literature from nursing philosophy and other human disciplines were used to identify the concept of love. As many different instances of the concept as could be found were examinned. The model case was a real life example of the use of the concept. Next borderline, related, invented, and contrary cases were constructed for the purpose of providing examples of “not the concept” and for promoting further understanding of the concept being discussed. The defining attributes of the concept of love were concern, responsibility, respect, understanding and dedication. Love was defined as showing concern and understanding. relating with mutual respect and dedicating oneself responsibly to others. Concept analysis is a highly creative activity and may add significant new information to a given area of interest. It is a strategy for developing a concept based on observation or other forms of empirical evidence. The purpose of concept analysis is to generate new ideas. It provides a method of examining data for new insights that contribute to theoretical development. This concept analysis suggests that a nurse’s love for patients is shown in the process of giving oneself in mutual relationships of responsibility and respect and in continuously providing understanding and quality human care for them.
Kim, Su-Gwan;Kim, Jae-Duk;Kim, Chong-Kwan;Kim, Byung-Ock
Journal of the Korean Association of Oral and Maxillofacial Surgeons
/
v.31
no.3
/
pp.248-254
/
2005
The purpose of this study was to investigate the distribution of stress within the regenerated bone surrounding the implant using three dimensional finite element stress analysis method. Using ANSYS software revision 6.0 (IronCAD LLC, USA), a program was written to generate a model simulating a cylindrical block section of the mandible 20 mm in height and 10 mm in diameter. The $5.0{\times}11.5-mm$ screw implant (3i, USA) was used for this study, and was assumed to be 100% osseointegrated. And it was restored with gold crown with resin filling at the central fossa area. The implant was surrounded by the regenerated type IV bone, with 4 mm in width and 7 mm apical to the platform of implant in length. And the regenerated bone was surrounded by type I, type II, and type III bone, respectively. The present study used a fine grid model incorporating elements between 250,820 and 352,494 and nodal points between 47,978 and 67,471. A load of 200N was applied at the 3 points on occlusal surfaces of the restoration, the central fossa, outside point of the central fossa with resin filling into screw hole, and the functional cusp, at a 0 degree angle to the vertical axis of the implant, respectively. The results were as follows: 1. The stress distribution in the regenerated bone-implant interface was highly dependent on both the density of the native bone surrounding the regenerated bone and the loading point. 2. A load of 200N at the buccal cusp produced 5-fold increase in the stress concentration at the neck of the implant and apex of regenerated bone irrespective of surrounding bone density compared to a load of 200N at the central fossa. 3. It was found that stress was more homogeneously distributed along the side of implant when the implant was surrounded by both regenerated bone and native type III bone. In summary, these data indicate that concentration of stress on the implant-regenerated bone interface depends on both the native bone quality surrounding the regenerated bone adjacent to implant and the load direction applied on the prosthesis.
The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.
Journal of the Korea Society of Computer and Information
/
v.18
no.2
/
pp.117-126
/
2013
Path planning is an essential problem to make virtual characters navigate in many applications including computer games. In many cases, multiple characters move in a group and qualitative aspects of planned paths are emphasized rather than optimality unlike Robotics. In this paper, we propose a two-level path planning algorithm in which the global path is planned for a single character specified as a leader and then the local path is planned to avoid dynamic obstacles while the group following this path. The space for group movement is achieved in the form of square grid array called a grid window. Member characters are located relatively to the leader within a space and moved. The static environment is reduced to the configuration space of this grid window to generate a roadmap on which a grid window can move. In local path planning, only the leader avoids dynamic obstacles by using an artificial potential field and the rest of members are located relatively to the leader in the grid window, which reduces computational load. Efficient algorithms to implement the proposed planning methods are introduced. The simulation results show that a group can handle with dynamic obstacles effectively while moving along the planned path for a static environment.
Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
/
v.36
no.4
/
pp.287-293
/
2018
It is prerequisite to generate epipolar resampled images by reducing the y-parallax for accurate and efficient processing of satellite stereo images. Minimizing y-parallax requires the accurate sensor modeling that is carried out with ground control points. However, the approach is not feasible over inaccessible areas where control points cannot be easily acquired. For the case, a relative orientation can be utilized only with conjugate points, but its accuracy for satellite sensor should be studied because the sensor has different geometry compared to well-known frame type cameras. Therefore, we carried out the bias-compensation of RPCs (Rational Polynomial Coefficients) without any ground control points to study its precision and effects on the y-parallax in epipolar resampled images. The conjugate points were generated with stereo image matching with outlier removals. RPCs compensation was performed based on the affine and polynomial models. We analyzed the reprojection error of the compensated RPCs and the y-parallax in the resampled images. Experimental result showed one-pixel level of y-parallax for Kompsat-3 stereo data.
Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
/
v.38
no.3
/
pp.259-267
/
2020
For real-time precise positioning, N-RTK (Network Real-Time Kinematic) technology is widely used these days. However, the currently operating N-RTK system has a limitation in terms of the number of users. Therefore, if reference points generate correction messages with no limit on the number of users are developed later, it is determined that an appropriate reference point installation interval is required, so that the accuracy of the N-RTK system according to the baseline distance was analyzed. This experiment utilized receivers with varying performance that estimated the rover position, and RTKLIB, an open-source software, is used for processing data. As a result, the rover position was estimated accurately with a high rate of fixed ambiguity for all the receivers. When the reference station with a baseline length of 40 km was used, the vertical RMSE (Root Mean Squared Error) was quite similar to the short baseline case, but only half of the ambiguity fixing rate was achieved. The outlier in the estimated rover position was not observed for the longer baselines in the case of a high-end receiver. It is necessary to analyze the ambiguity fixing and the accuracy of the kinematic positioning with scientific GNSS processing software.
Recently, various researches have been proposed to accelerate GPU-based volume ray-casting. However, those researches may cause several problems such as bottleneck of data transmission between CPU and GPU, requirement of additional video memory for hierarchical structure and increase of processing time whenever opacity transfer function changes. In this paper, we propose an efficient GPU-based empty space skipping technique to solve these problems. We store maximum density in a brick of volume dataset on a vertex element. Then we delete vertices regarded as transparent one by opacity transfer function in geometry shader. Remaining vertices are used to generate bounding boxes of non-transparent area that helps the ray to traverse efficiently. Although these vertices are independent on viewing condition they need to be reproduced when opacity transfer function changes. Our technique provides fast generation of opaque vertices for interactive processing since the generation stage of the opaque vertices is running in GPU pipeline. The rendering results of our algorithm are identical to the that of general GPU ray-casting, but the performance can be up to more than 10 times faster.
As the use of trading systems increases recently, many researchers are interested in developing intelligent trading systems using artificial intelligence techniques. However, most prior studies on trading systems have common limitations. First, they just adopted several technical indicators based on stock indices as independent variables although there are a variety of variables that can be used as independent variables for predicting the market. In addition, most of them focus on developing a model that predicts the direction of the stock market indices rather than one that can generate trading signals for maximizing returns. Thus, in this study, we propose a novel intelligent trading system that mitigates these limitations. It is designed to use both the technical indicators and the other non-price variables on the market. Also, it adopts 'two-threshold mechanism' so that it can transform the outcome of the stock market prediction model based on support vector machines to the trading decision signals like buy, sell or hold. To validate the usefulness of the proposed system, we applied it to the real world data-the KOSPI200 index from May 2004 to December 2009. As a result, we found that the proposed system outperformed other comparative models from the perspective of 'rate of return'.
Journal of the Korea Institute of Information and Communication Engineering
/
v.17
no.8
/
pp.1908-1918
/
2013
Free-view, auto-stereoscopic video service is a next generation broadcasting system which offers a three-dimensional video, images of the various point are needed. This paper proposes a method that parallelizes the algorithm for arbitrary intermediate view-point image fast generation and make it faster using General Propose Graphic Processing Unit(GPGPU) with help of the Compute Unified Device Architecture(CUDA). It uses a parallelized stereo-matching method between the leftmost and the rightmost depth images to obtain disparity information and It use data calculated disparity increment per depth value. The disparity increment is used to find the location in the intermediate view-point image for each depth in the given images. Then, It is eliminate to disocclusions complement each other and remaining holes are filled image using hole-filling method and to get the final intermediate view-point image. The proposed method was implemented and applied to several test sequences. The results revealed that the quality of the generated intermediate view-point image corresponds to 30.47dB of PSNR in average and it takes about 38 frames per second to generate a Full HD intermediate view-point image.
This study aims to analyse the research trend of the participants in Emotional Science in Korea and to suggest a desirable direction of research. I analysed the 1,262 articles published in Korean Journal of the Science of Emotion and Sensibility from 2000 to 2011 according to fields of study and keywords. The findings from the study are as follows. In the fields of study regarding Clothing Design, Psychology, Medicine, Visual Media, Brain Science they are still the top rated categories amongst participants. With the participation of Industrial Engineering and Ergonomics they have shown a meaningful difference depending on governmental support such as G7 Project. The problem with Industrial Design is that the majority of studies have been performed alone, and they have many keywords which are not related with Emotional Science. However, 31 new fields of study have been added to the research making the findings more desirable considering that Emotional Science is typical interdisciplinary filed of study. I hope that this study will provide basic data which can be used to promote the interdisciplinary research between the different fields of study in order to generate significant synergy.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.