Journal of the Korean Institute of Intelligent Systems
/
v.21
no.3
/
pp.290-295
/
2011
On the basis of DCPA(Distance to Closest Point of Approach) and TCPA(Time to CPA), the conventional algorithms for collision avoidances have a drawback that the '72 CORLEGs(International Regulations for Preventing Collisions at Sea, 1972) has not taken into account to prevent collisions between ships. In this paper, the proposed algorithm decides whether the own ship is a give-way vessel or a stand-on vessel by observing the relative bearing of the encountered ship. To determine the ship position and time for collision avoidance, the proposed algorithm utilizes the ellipse model for ship safety domain. The computer simulation is done to represent the process of adversive behavior. Using the proposed method, the past maritime accident is analyzed. The proposed method can be effectively applied to collision avoidance by CORLEGs even when the target ship's navigational lights is invisible in poor weather and/or in the restricted visibility.
Journal of the Korea Institute of Information and Communication Engineering
/
v.23
no.6
/
pp.637-644
/
2019
In recent years, many public safety systems in the smart city are developed. These systems are taking responsibility to make a safe and comfortable city. In this paper, we propose vehicle tracking systems include a public safety system that enables the policeman to track the stolen vehicles more efficiently by providing the vehicle information in real time. When a vehicle is stolen, the vehicle owner can send a user emergency request. Then, the public safety server which supported by a geospatial query technique will give information such as time, distance, and routes to a policeman who is closest to the location of the vehicle to catch the thief. 300 simulations were performed to evaluate the performance of the system. We found that the average of times required when vehicle owner send a user emergency message on user application until policeman obtain a vehicle tracking request on police application below 1.2 seconds.
Asekova, Sovetgul;Kulkarni, Krishnanand P.;Oh, Ki Won;Lee, Myung-Hee;Oh, Eunyoung;Kim, Jung-In;Yeo, Un-Sang;Pae, Suk-Bok;Ha, Tae Joung;Kim, Sung Up
Plant Breeding and Biotechnology
/
v.6
no.4
/
pp.321-336
/
2018
Sesame (Sesamum indicum L.) is an important oilseed crop grown in tropical and subtropical areas. The objective of this study was to investigate the genetic relationships among 129 sesame landraces and cultivars using simple sequence repeat (SSR) markers. Out of 70 SSRs, 23 were found to be informative and produced 157 alleles. The number of alleles per locus ranged from 3 - 14, whereas polymorphic information content ranged from 0.33 - 0.86. A distance-based phylogenetic analysis revealed two major and six minor clusters. The population structure analysis using a Bayesian model-based program in STRUCTURE 2.3.4 divided 129 sesame accessions into three major populations (K = 3). Based on pairwise comparison estimates, Pop1 was observed to be genetically close to Pop2 with $F_{ST}$ value of 0.15, while Pop2 and Pop3 were genetically closest with $F_{ST}$ value of 0.08. Analysis of molecular variance revealed a high percentage of variability among individuals within populations (85.84%) than among the populations (14.16%). Similarly, a high variance was observed among the individuals within the country of origins (90.45%) than between the countries of origins. The grouping of genotypes in clusters was not related to their geographic origin indicating considerable gene flow among sesame genotypes across the selected geographic regions. The SSR markers used in the present study were able to distinguish closely linked sesame genotypes, thereby showing their usefulness in assessing the potentially important source of genetic variation. These markers can be used for future sesame varietal classification, conservation, and other breeding purposes.
Journal of the Korea institute for structural maintenance and inspection
/
v.23
no.5
/
pp.13-22
/
2019
In order to evaluate the earthquake damage level of small and medium - sized bridges without earthquake monitoring system, we proposed an algorithm for estimating the seismic force at the target bridge location using the ground acceleration data from the earthquake observatories near the structure. In general, response spectrum analysis, which is the most widely used dynamic analysis method to design and evaluate the structural system numerically is required a response spectrum to determine the dynamic loading. In this study, selection methods of the three closest observatories from the target structure and estimation method of ground response spectrum at arbitrary locations are developed. The proposed method can consider the distance and phase between the target bridge and the seismic station and from the relationship between the acceleration amplitudes and the location of the selected seismic station, the earthquake loading of the target bridge can be determined. The proposed algorithm is estimated to be more conservative than the response spectrum evaluated by actual earthquake data.
This experiment was conducted to determine the optimum row width and plant spacing within row under the tropical environment for a leading soybean variety Palmetto and it was carried out at Eakmat Experiment Station in Vietnam. The experiments were arranged in a split plot design with four replications and the test was repeated twice in two years. Variations for seed yield due to the distance between rows were significant at 1 per cent level in 1967 test(dry season growing) and at 5 per cent level in 1968 test. Significant differences for plant height, lodging, maturity, number of branches per plant, and number of pods per plant due to the row width were not found in both tests, while significant differences in difference spacing within row was found in all traits studied. Interaction between width of row and spacing within row for seed yield and plant height were found at five percent level in 1967 test. These results indicate that close planting may increase in seed yield and plant height in both seasons, and decrease in loadging. From these studies, one could be understood that the plant population, particularly in dry season, plays decisive roles on seed yield in soybean culture, and the maximum plant height and minimum value of lodging index were also observed in closest spacing plots. The highest soybean yield in late planting would be expected by a combinations of 30 cm(between rows)${\times}$5cm(between hills) plot, while 40cm ${\times}$ 5cm planting method would be suggested for rainy season growing. Highest seed yield was obtained at closet spacing in both dry and rainy season, and these results led to drilling method in seeding where about 20 seeds per meter of row could be recommended. Besides the seed yield, the close planting may produce some advantages, such as increase plant height and decrease lodging, weeds and erosion of surface soil.
The Journal of Korea Institute of Information, Electronics, and Communication Technology
/
v.17
no.2
/
pp.83-92
/
2024
Currently, various countries are enhancing accessibility by providing bicycle rental services for convenient usage within daily life. This paper introduces the Nubija public bicycle service in Changwon, South Korea, aiming to address the imbalance between demand and supply of Nubija bicycles. We propose a Highest Priority Reallocation Scheme to prevent this disparity. Comparing this scheme with others that randomly visit terminals for redistribution and those that prioritize terminals closest to current locations, we illustrate its superior efficiency. Our proposed Highest Priority Reallocation Scheme prioritizes terminals with the highest demand and shortest distances nearby. Through experiments, our proposed scheme demonstrates superior performance, with the lowest average of 817.44km distance and an average of 6437.45 times, i.e., 88.14% successful rental occurrences. This highlights its superiority over the other two algorithms.
Knowledge of the superficial radial nerve (SRN) relationship and anatomic variations of the first extensor compartment (1st EC) will contribute to a better outcome of de Quervain tenosynovitis treatment. We dissected 87 embalmed cadaveric wrists to determine the relationship of the SRN, the 1st EC length, distance from the proximal and distal 1st EC borders to radial styloid process (RSP), abductor pollicis longus (APL) and extensor pollicis brevis (EPB) tendon slip numbers, and the presence of septum. Our results revealed SRN crossing over the 1st EC in 59.5%. The lateral branch of the superficial radial nerve to the 1st EC midline in most cases (61.9%) except for one specimen, where lateral antebrachial cutaneous nerve was the closest. Distances from proximal and distal 1st EC borders to the RSP were 19.7±4.1 mm and 7.6±1.8 mm, respectively. Extensor retinaculum (ER) width over 1st EC (1st EC length) was 14.8±3.2 mm. Complete and incomplete septa were found in 17.2%, and 42.5%, respectively. The most frequent APL tendon slip number in the compartment was two in overall 47 specimens (54.0%). Almost all compartments (85 specimens; 97.7%) contained one EPB tendon slip. We detected bilateral EPB absence in one cadaver. Moreover, we recorded a tendon slip from extensor pollicis longus traveling into 1st EC bilaterally in one cadaver and observed the EPB muscle belly extension into 1st EC in 9 wrists. Awareness of 1st EC anatomic variations would be essential for successful surgical and nonsurgical outcomes.
Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.
In order to presume the relationships between two species of P. ternata and P. tripartia, and their populations of the Korean Pinellia, RAPD analysis was performed. The length of the amplified DNA fragments ranged from 300 to 2,500bp. Seventy scorable RAPD makers were found from the PCR reactions with 7 random oligoprimers and were analyzed by Nei-Li's genetic coefficient. Also, some regional groups instead of same taxa were clustered from the phenogram of UPGMA analysis and NJ tree. Populations within each species were clustered at low genetic distance, there had the closed relationship. According to the regional individuals, Pinellia ternata was showed the variation pattern of morphological (leaf shape and flower color) and cytological characters(somatic chromosome numbers). So we suggested to difference of characteristic variety based on variety of habitat. According to this study, new species (Pinellia sp.) was affiliated with Pinellia and had the closest relationship with Hallasan and Japan population. The RAPD data was very useful to define the genetic variation and to discuss the relationships among the intraspecific taxa and their populations of the Korean Pinellia.
This study was conducted to establish genetic criteria for phenotypic characteristics of Hanwoo cattle based on allele frequencies and genetic variance analysis using microsatellite markers. Analysis of the genetic diversity among 399 Hanwoo cattle classified according to nose pigmentation and coat color was carried out using 22 microsatellite markers. The results revealed that the INRA035 locus was associated with the highest $F_{is}$ (0.536). Given that the $F_{is}$ value for the Hanwoo INRA035 population ranged from 0.533 (white) to 1.000 (white spotted), this finding was consistent with the loci being fixed in Hanwoo cattle. Expected heterozygosities of the Hanwoo groups classified by coat colors and degree of nose pigmentation ranged from $0.689{\pm}0.023$ (Holstein) to $0.743{\pm}0.021$ (nose pigmentation level of d). Normal Hanwoo and animals with a mixed white coat showed the closest relationship because the lowest $D_A$ value was observed between these groups. However, a pair-wise differentiation test of $F_{st}$ showed no significant difference among the Hanwoo groups classified by coat color and degree of nose pigmentation (p<0.01). Moreover, results of the neighbor-joining tree based on a $D_A$ genetic distance matrix within 399 Hanwoo individuals and principal component analyses confirmed that different groups of cattle with mixed coat color and nose pigmentation formed other specific groups representing Hanwoo genetic and phenotypic characteristics. The results of this study support a relaxation of policies regulating bull selection or animal registration in an effort to minimize financial loss, and could provide basic information that can be used for establishing criteria to classify Hanwoo phenotypes.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.