Journal of Korean Society of Coastal and Ocean Engineers
/
v.35
no.6
/
pp.109-120
/
2023
The High-Frequency Radar (HFR) is an equipment designed to measure real-time surface ocean currents in broad maritime areas.It emits radio waves at a specific frequency (HF) towards the sea surface and analyzes the backscattered waves to measure surface current vectors (Crombie, 1955; Barrick, 1972).The Seasonde HF Radar from Codar, utilized in this study, determines the speed and location of radial currents by analyzing the Bragg peak intensity of transmitted and received waves from an omnidirectional antenna and employing the Multiple Signal Classification (MUSIC) algorithm. The generated currents are initially considered ideal patterns without taking into account the characteristics of the observed electromagnetic wave propagation environment. To correct this, Antenna Pattern Measurement (APM) is performed, measuring the strength of signals at various positions received by the antenna and calculating the corrected measured vector to radial currents.The APM principle involves modifying the position and phase information of the currents based on the measured signal strength at each location. Typically, experiments are conducted by installing an antenna on a ship (Kim et al., 2022). However, using a ship introduces various environmental constraints, such as weather conditions and maritime situations. To reduce dependence on maritime conditions and enhance economic efficiency, this study explores the possibility of using unmanned aerial vehicles (drones) for APM. The research conducted APM experiments using a high-frequency radar installed at Dangsa Lighthouse in Dangsa-ri, Wando County, Jeollanam-do. The study compared and analyzed the results of APM experiments using ships and drones, utilizing the calculated radial currents and surface current fields obtained from each experiment.
The Tamar rift valley runs through the City of Launceston, Tasmania. Damage has occurred to city buildings due to earthquake activity in Bass Strait. The presence of the ancient valley, the Tamar valley, in-filled with soft sediments that vary rapidly in thickness from 0 to 250mover a few hundreds metres, is thought to induce a 2D resonance pattern, amplifying the surface motions over the valley and in Launceston. Spatially averaged coherency (SPAC), frequency-wavenumber (FK) and horizontal to vertical spectrum ratio (HVSR) microtremor survey methods are combined to identify and characterise site effects over the Tamar valley. Passive seismic array measurements acquired at seven selected sites were analysed with SPAC to estimate shear wave velocity (slowness) depth profiles. SPAC was then combined with HVSR to improve the resolution of these profiles in the sediments to an approximate depth of 125 m. Results show that sediments thicknesses vary significantly throughout Launceston. The top layer is composed of as much as 20m of very soft Quaternary alluvial sediments with a velocity from 50 m/s to 125 m/s. Shear-wave velocities in the deeper Tertiary sediment fill of the Tamar valley, with thicknesses from 0 to 250m vary from 400 m/s to 750 m/s. Results obtained using SPAC are presented at two selected sites (GUN and KPK) that agree well with dispersion curves interpreted with FK analysis. FK interpretation is, however, limited to a narrower range of frequencies than SPAC and seems to overestimate the shear wave velocity at lower frequencies. Observed HVSR are also compared with the results obtained by SPAC, assuming a layered earth model, and provide additional constraints on the shear wave slowness profiles at these sites. The combined SPAC and HVSR analysis confirms the hypothesis of a layered geology at the GUN site and indicates the presence of a 2D resonance pattern across the Tamar valley at the KPK site.
The building process of any geological map involves linking sparse lithological outcrop information with equally sparse geometrical measurements, all in a single entity which is the preferred interpretation of the field geologist. The actual veracity of this interpretative map is partially dependent upon the frequency and distribution of geological outcrops compounded by the complexity of the local geology. Geophysics is commonly used as a tool to augment the distribution of data points, however it normally does not have sufficient geometrical constraints due to: a) all geophysical inversion models being inherently non-unique; and b) the lack of knowledge of the physical property contrasts associated with specific lithologies. This contribution proposes the combined use of geophysical edge detection routines and 'three point' solutions from topographic data as a possible approach to obtaining geological contact geometry information (strike and dip), which can be used in the construction of a preliminary geological model. This derived geological information should first be assessed for its compatibility with the scale of the problem, and any directly observed geological data. Once verified it can be used to help constrain the preferred geological map interpretation being developed by the field geologist. The method models the contacts as planar surfaces. Therefore, it must be ensured that this assumption fits the scale and geometry of the problem. Two examples are shown from folded sequences at the Bathurst Mining Camp, New Brunswick, Canada.
Proceedings of the Korean Society for Bioinformatics Conference
/
2005.09a
/
pp.267-271
/
2005
The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.
The purpose of this study was to examine how parental stress coming from breeding children with disabilities affected their leisure constraints. The participants of this study were parents with mentally retarded children who were involved in physical activities in 6 places; 4 special schools for the children in Seoul and Kyunggi province, a physical education class in a university, a physical education class with a university and a private physical education class. We surveyed the parents selected through purposive sampling and data from total 355 participants involved in the survey were analysed. For this, frequency analysis, exploratory factor analysis, reliability analysis, one-way ANOVA and multiple regression analysis were used. The outcome of this study showed that there was not meaningful difference in breeding stress depending on the types of the disabilities. However the result presented meaningful difference in stress from children adaptation according to the degree of the disabilities. Moreover, the difference were found in some factors such as children's sex and family income. As a result, the finding indicated that parental stress had an effect on the limitation of parents' leisure ability.
Journal of Korean Library and Information Science Society
/
v.8
/
pp.127-154
/
1981
Today's complicated society with a rapid change needs more objective and accurate data for the better managerical decisions and the prospect for the future other than the intuition or subjective experience by men themselves. These data can't be extracted without the analysis of actual data by a n.0, pplying any of mathematical techniques. One of these mathematical techniques, called bibliometrics has been newly developed in the field of library and information science to extract the objective data for the better services through the library operations. The Beadford's Law, one important law in bibliometrics has provided rather scientific and objective basis on the more valid building of library collection within the constraints of budget. The purpose of the study is to investigate the theory of the Bradford's Law, to clarify the possible areas of its a n.0, pplication, and to discern some problems in doing so. The results of the study can be summarized as follows; (1) There is certain difference between the graphical formulation and verbal formulation of Bradford's Law. But this law is very useful for the field of library and information science, owing to the flexibility of the a n.0, pplication of the law in the field. (2) The minimal nucleus can consist of a single periodical only if j, the number of relevant papers in the most productive journals is greater than Z/2. On the other hand, if j is less than or equal to Z/2, then the minimal nucleus will consist of 2 or more periodicals. (3) It is possible to design the most compact selection of scientific periodicals covering any specified percentage P among the total periodicals by using the formulation, log n=Plog N+(1-P)logs, or Nlog N/s=P center dot N log N/s. (4) If there is need to provide all the articles needed by users the given budget, the library can purchase the proper number of journals, by using the formulation, f center dot AN=An+PN (log N/s-logn/s). (5) In the building of the library collection based on the decreasing ratio of use, the library can subscribe to the proper number of journals according to the satisfactory degree of the need, by using the formulation, f=Nu+uNlogN/S-uNlogn/s / nNlogN/s = 1+logN/m /logN/s (6) If the order of valuable journals is decided according to the frequency of being cited, the order can't always represent the value. (7) The evaluation criteria for the journals with high value, but less cited should be made a further study.
Journal of the Korean Institute of Telematics and Electronics C
/
v.36C
no.5
/
pp.27-37
/
1999
A CMOS ReadOut Integrated Circuit (ROlC) for InfraRed Focal Plane Array (IRFPA) detector is presented, which is a key component in uncooled thermal imaging systems. The ROIC reads out signals from $64\times64$ Barium Strontium Titanate (BST) infrared detector array, then outputs pixel signals sequentially after amplifying and noise filtering. Various design requirements and constraints have been considered including impedance matching, low noise, low power dissipation and small detector pitch. For impedance matching between detector and pre~amplifier, a new circuit based on MOS diode structure is devised, which can be easily implemented using standard CMOS process. Also, tunable low pass filter with single~pole is used to suppress high frequency noise. In additions, a clamping circuit is adopted to enhance the signal~to-noise ratio of the readout output signals. The $64\times64$ IRFPA ROIC is designed using $0.65-\mu\textrm{m}$ 2P3M (double poly, tripple metal) N~Well CMOS process. The core part of the chip contains 62,000 devices including transistors, capacitors and resistors on an area of about $6.3-mm\times6.7-mm$.
The objective of this study was to research the health status of the elderly population and their perception and compliance to cook medicated juk. The results from this research will be used as basic data for medicated juk development. In addition, the purpose of this study was to find a way to popularize the juk and improve their usage as medicated juk in communal feeding and convalescent hospital for elderly. The study surveyed 300 elderly residents of age over 65, in Daejeon. The following data were collected: general characteristic, health status, perception of medicated juk, and preferred kind of juk for cooking. Moreover, the study researched the constraints in cooking the juk. Data were analyzed by SPSS Windows V. 18.0 and t-test verified the differences among the questions, according to frequency analysis of each item and characteristics of the aged. You might want to specify this characteristic. Within the surveyed elderly population, 80.6% had various existing diseases with circulatory diseases being the most prevalent with 68.9%. This emphasizes on the significance of proper diet, but this recognition is not put into practice. The survey also showed that as the individuals age, they tend to care less about the necessity of proper diet. Despite of this lack of perception, 84.5% of the elderly population responded positively to the question, "Would you like to have medicated juk for curing diseases, if such juk is available?" In addition, the elderly population was in favor of developing the juk that helps to prevent and cure diseases, and many were willing to cook them. The reasons behind their will to cook are arranged in the following order: higher efficacy in curing disease than regular juk, excellence in nutrition, and unavailability of the medicated juk in the stores that requires them to cook. The sources constraining the elderly population in cooking are arranged in the following order: not knowing how to cook the juk, lack of physical strength, financial burden, and lack of information order. Please clarify this part. Suggested change: not knowing what medicated juk is. Furthermore, the main obstacle in cooking the juk is lack of cooking technique, followed by inaccessibility to the ingredients and the financial burden to purchase the ingredients.
Journal of the Korea Society of Computer and Information
/
v.16
no.9
/
pp.1-10
/
2011
Unfortunately, in current microprocessors, increasing the frequency causes increased power consumption and reduced reliability whereas it improves the performance. To overcome the power and thermal problems in the singlecore processors, multicore processors has been widely used. For 2D multicore processors, interconnection is regarded as one of the major constraints in performance and power efficiency. To reduce the performance degradation and the power consumption in 2D multicore processors, 3D integrated design technique has been studied by many researchers. Compared to 2D multicore processors, 3D multicore processors get the benefits of performance improvement and reduced power consumption by reducing the wire length significantly. However, 3D multicore processors have serious thermal problems due to high power density, resulting in reliability degradation. Detailed thermal analysis for multicore processors can be useful in designing thermal-aware processors. In this paper, we analyze the impact of workload distribution, distance to the heat sink, and number of stacked dies on the processor temperature. We also analyze the effects of the temperature on overall system performance. Especially, this paper presents the guideline for thermal-aware multicore processor design by analyzing the thermal problems in 2D multicore processors and 3D multicore processors.
Journal of the Korea Academia-Industrial cooperation Society
/
v.20
no.12
/
pp.772-779
/
2019
This study identified the relationship between leisure attitudes, leisure promotion, leisure drugs, leisure satisfaction, and the intention to rejoin maritime sports by the participants of this study. The researchers selected 542 adult men and women who live in Seoul and the Incheon, Gyeonggi and Chungcheong provinces, and who were currently engaged in marine sports activities. Data processing was performed using SPSS 21.0 and AMOS 18.0 for the frequency analysis, reliability analysis, confirmatory factor analysis, correlation analysis and structural equation model analysis. The results of this study were as follows. First, the leisure attitudes of marine sports participants did not affect the promotion of leisure (p>.05). Second, the attitude towards leisure of the marine sports participants had a negative effect on using leisure pharmaceuticals (p<.05). Third, the leisure attitudes of marine sports participants affected their leisure satisfaction (p<.05). Fourth, the promotion of leisure activities of the marine sports participants did not affect their leisure satisfaction (p>.05). Fifth, the leisure restrictions of marine sports participants did not affect their leisure satisfaction (p>.05). Sixth, the leisure activities of marine sports participants affected the intention of rejoining (p<.05).
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.