• Title/Summary/Keyword: 네트워크밀도

Search Result 258, Processing Time 0.026 seconds

A Study on the Measurement of Knowledge Relatedness Density and Technological Complexity in South-east Region (동남권 지역의 지식 간 연관성 밀도와 기술 복합성 측정에 관한 연구)

  • Park, Gi-Woong;Kim, Donghyun
    • Journal of the Korean Regional Science Association
    • /
    • v.37 no.3
    • /
    • pp.3-18
    • /
    • 2021
  • The fourth Industrial Revolution is transforming the industrial structure of the region, and it is necessary to develop new industries and technologies that reflect regional characteristics. The purpose of this study is to measure the knowledge relatedness and technological complexity in Busan, Ulsan, and Gyeongnam, and to identify technologies with potential for regional industrial differentiation strategies. Using patent data from 2015 to 2019, co-occurrence matrices were derived from 652 IPC codes, and the knowledge relatedness density and technology complexity index were calculated. Network analysis was performed using the knowledge relatedness density. As a result of analysis, it was found that mechanical engineering occupied a large proportion, followed by chemistry and electrical engineering. As a result of applying the risk-benefit framework to derive technologies with the potential to differentiate local industries, the technological capabilities of low-risk-high-benefit were different. Among mechanical engineering, technologies such as engine, machine operation, and transportation were included in Busan. In Ulsan, environmental technology in chemical and materials, and heat treatment technology in mechanical engineering were technologies with low-risk and high-benefit capabilities. Gyeongnam showed competence in mechanical engineering, chemistry, and electrical engineering in some areas such as Gimhae, Yangsan, and Changwon. The results of this study are meaningful in that they identified technologies with potential for selecting and deriving strategic industries for regional growth based on latent knowledge in the region.

Effects of Orchard Environments and Landscape Features on the Population Occurrence of Major Lepidopteran Pests in Apple Orchards (과원 환경과 경관 요소가 사과원 주요 나방류 해충 발생에 미치는 영향)

  • Kim, Hyangmi;Jung, Chuleui
    • Korean journal of applied entomology
    • /
    • v.60 no.1
    • /
    • pp.79-90
    • /
    • 2021
  • Landscape composition and structure are important factors determining biological diversity including pests and natural enemires in agricultural ecosystem. This study was conducted to indentify effect of landscape composition on occurrence of lepidopteran pest population in Geochang, Gyoungdnam. For this, orchard characteristics and management practices were surveyed in 80 conventional apple orchards in Geochang, Korea, along with the monitoring of pest population densities. The landscape features of each surveyed orchard also obtained by extracting information from the public-service map. Grapholita molesta was the most dominat and damaging pest followed by Phyllonorycter ringoniella and Carposina sasakii in trap catches. Adoxophyes paraorana occurrences were low. Farmers spray insecticides and fungicides ap. 12.4 times per year respectively while acaricides were sprayed 2.4 times. Major landscape features such as surrounding apple orchard or paddy field did not influence the pest populations but presence of plum, peach, wild peach, graph, and even abandoned orchards significantly resulted in higher pest population mostly on G. molesta. C. sasakii population was higher in orchards with grape, peach, and P. ringoniella with peach, grape, abandoned orchards and jujube. Results highlight the need of landscape management not only for the rural amenity but also for increasing functional diversity of agroecosystem as well as reducing pest population.

Ionomer Binder in Catalyst Layer for Polymer Electrolyte Membrane Fuel Cell and Water Electrolysis: An Updated Review (고분자 전해질 연료전지 및 수전해용 촉매층의 이오노머 바인더)

  • Park, Jong-Hyeok;Akter, Mahamuda;Kim, Beom-Seok;Jeong, Dahye;Lee, Minyoung;Shin, Jiyun;Park, Jin-Soo
    • Journal of the Korean Electrochemical Society
    • /
    • v.25 no.4
    • /
    • pp.174-183
    • /
    • 2022
  • Polymer electrolyte fuel cells and water electrolysis are attracting attention in terms of high energy density and high purity hydrogen production. The catalyst layer for the polymer electrolyte fuel cell and water electrolysis is a porous electrode composed of a precious metal-based electrocatalyst and an ionomer binder. Among them, the ionomer binder plays an important role in the formation of a three-dimensional network for ion conduction in the catalyst layer and the formation of pores for the movement of materials required or generated for the electrode reaction. In terms of the use of commercial perfluorinated ionomers, the content of the ionomer, the physical properties of the ionomer, and the type of the dispersing solvent system greatly determine the performance and durability of the catalyst layer. Until now, many studies have been reported on the method of using an ionomer for the catalyst layer for polymer electrolyte fuel cells. This review summarizes the research results on the use of ionomer binders in the fuel cell aspect reported so far, and aims to provide useful information for the research on the ionomer binder for the catalyst layer, which is one of the key elements of polymer electrolyte water electrolysis to accelerate the hydrogen economy era.

Design and Implementation of Game Server using the Efficient Load Balancing Technology based on CPU Utilization (게임서버의 CPU 사용율 기반 효율적인 부하균등화 기술의 설계 및 구현)

  • Myung, Won-Shig;Han, Jun-Tak
    • Journal of Korea Game Society
    • /
    • v.4 no.4
    • /
    • pp.11-18
    • /
    • 2004
  • The on-line games in the past were played by only two persons exchanging data based on one-to-one connections, whereas recent ones (e.g. MMORPG: Massively Multi-player Online Role-playings Game) enable tens of thousands of people to be connected simultaneously. Specifically, Korea has established an excellent network infrastructure that can't be found anywhere in the world. Almost every household has a high-speed Internet access. What made this possible was, in part, high density of population that has accelerated the formation of good Internet infrastructure. However, this rapid increase in the use of on-line games may lead to surging traffics exceeding the limited Internet communication capacity so that the connection to the games is unstable or the server fails. expanding the servers though this measure is very costly could solve this problem. To deal with this problem, the present study proposes the load distribution technology that connects in the form of local clustering the game servers divided by their contents used in each on-line game reduces the loads of specific servers using the load balancer, and enhances performance of sewer for their efficient operation. In this paper, a cluster system is proposed where each Game server in the system has different contents service and loads are distributed efficiently using the game server resource information such as CPU utilization. Game sewers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 12%, 10% respectively.

  • PDF

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

휨 구조의 압전 마이크로-켄틸레버를 이용한 진동 에너지 수확 소자

  • Na, Ye-Eun;Park, Hyeon-Su;Park, Jong-Cheol
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2014.02a
    • /
    • pp.476-476
    • /
    • 2014
  • 서론: 저 전력 소모를 필요로 하는 무선 센서 네트워크 관련 기술의 급격한 발달과 함께 자체 전력 수급을 위한 진동 에너지 수확 기술에 대한 연구가 활발히 이루어지고 있다. 다양한 구조와 소재를 압전 외팔보에 적용하여 제안하고 있다. 그 중에서도 진동 기반의 에너지 수확 소자는 주변 환경에서 쉽게 진동을 얻을 수 있고, 높은 에너지 밀도와 제작 방법이 간단하다는 장점을 가지고 있어 많은 분야에 응용 및 적용 가능하다. 기존 연구에서는 2차원적으로 진동 에너지 수확을 위한 휜 구조의 압전 외팔보를 제안 하였다. 휜 구조를 갖는 압전 외팔보는 각각의 짧은 두 개의 평평한 외팔보가 일렬로 연결된 것으로 볼 수 있다. 하나의 짧고 평평한 외팔보는 진동이 가해지면 접선 방향으로 응력이 생겨 최대 휨 모멘텀을 갖게 된다. 그러므로 휜 구조를 갖는 외팔보는 진동이 인가됨에 따라 길이 방향과 수직 방향으로 진동한다. 하지만, 이 구조는 수평 방향으로 가해지는 진동에 대한 에너지를 수확하기에는 한계점을 가진다. 즉, 3축 방향에서 임의의 방향에서 진동 에너지를 수확하기는 어렵다. 본 연구에서는 3축 방향에서 에너지를 효율적으로 수확할 수 있도록 헤어-셀 구조의 압전 외팔보 에너지 수확소자를 제안한다. 제안된 소자는 길이 방향과 수직 방향뿐만 아니라 수평 방향으로도 진동하여 임의의 방향에서 진동 에너지를 수확할 수 있다. 구성 및 공정: 제안하는 소자는 3축 방향에서 임의의 진동을 수확하기 위해서 길이를 길게 늘이고 길이 방향을 따라 휘어지는 구조의 헤어-셀 구조로 제작하였다. 외팔보의 구조는 외팔보의 폭 대비 길이의 비가 충분히 클 때, 추가적인 자유도를 얻을 수 있다. 그러므로 헤어-셀 구조의 에너지 수확 소자는 기본적인 길이 방향, 수직방향 그리고 수평방향에 더불어 추가적으로 뒤틀리는 방향을 통해서 3차원적으로 임의의 주변 진동 에너지를 수확하여 전기적인 에너지로 생성시킬 수 있다. 제작된 소자는 높은 종횡비를 갖는 무게 추($500{\times}15{\times}22{\mu}m3$)와 길이 방향으로 길게 휜 압전 외팔보($1000{\times}15{\times}1.7{\mu}m3$)로 구성되어있다. 공정 과정은 다음과 같다. 먼저, 실리콘 웨이퍼 위에 탄성층을 형성하기 위해 LPCVD SiNx를 $0.8{\mu}m$와 LTO $0.2{\mu}m$를 증착 후, 각각 $0.03{\mu}m$$0.12{\mu}m$의 두께를 갖는 Ti와 Pt을 하부 전극으로 스퍼터링한다. 그리고 Pb(Zr0.52Ti0.48)O3 박막을 $0.35{\mu}m$ 두께로 졸겔법을 이용하여 증착하고 상부 Pt층을 두께 $0.1{\mu}m$로 순차적으로 스퍼터링하여 형성한다. 상/하부 전극은 ICP(Inductively Coupled Plasma)를 이용해 건식 식각으로 패턴을 형성한다. PZT 층과 무게 추 사이의 보호막을 씌우기 위해 $0.2{\mu}m$의 Si3N4 박막이 PECVD 공정법으로 증착되고, RIE로 패턴을 형성된다. Ti/Au ($0.03/0.35{\mu}m$)이 E-beam으로 증착되고 lift-off를 통해서 패턴을 형성함으로써 전극 본딩을 위한 패드를 만든다. 초반에 형성한 실리콘 웨이퍼 위의 SiNx/LTO 층은 RIE로 외팔보 구조를 형성한다. 이후에 진행될 도금 공정을 위해서 희생층으로는 감광액이 사용되고, 씨드층으로는 Ti/Cu ($0.03/0.15{\mu}m$) 박막이 스퍼터링 된다. 도금 형성층을 위해 감광액을 패턴화하고, Ni0.8Fe0.2 ($22{\mu}m$)층으로 도금함으로써 외팔보 끝에 무게 추를 만든다. 마지막으로, 압전 외팔보 소자는 XeF2 식각법을 통해 제작된다. 제작된 소자는 소자의 여러 층 사이의 고유한 응력 차에 의해 휨 변형이 생긴다. 실험 방법 및 측정 결과: 제작된 소자의 성능을 확인하기 위하여 일정한 가속도 50 m/s2로 3축 방향에 따라 입력 주파수를 변화시키면서 출력 전압을 측정하였다. 먼저, 소자의 기본적인 공진 주파수를 얻기 위하여 수직 방향으로 진동을 인가하여 주파수를 변화시켰다. 그 때에 공진 주파수는 116 Hz를 가지며, 최대 출력 전압은 15 mV로 측정되었다. 3축 방향에서 진동 에너지 수확이 가능하다는 것을 확인하기 위하여 제작된 소자를 길이 방향과 수평 방향으로 가진기에 장착한 후, 기본 공진 주파수에서의 출력 전압을 측정하였다. 진동이 길이방향으로 가해졌을 때에는 33 mV, 수평방향으로 진동이 인가되는 경우에는 10 mV의 최대 출력 전압을 갖는다. 제안하는 소자가 수 mV의 적은 전압은 출력해내더라도 소자는 진동이 인가되는 각도에 영향 받지 않고, 3축 방향에서 진동 에너지를 수확하여 전기에너지로 얻을 수 있다. 결론: 제안된 소자는 3축 방향에서 진동 에너지를 수확할 수 있는 에너지 수확 소자를 제안하였다. 외팔보의 구조를 헤어-셀 구조로 길고 휘어지게 제작함으로써 기본적인 길이 방향, 수직방향 그리고 수평방향에 더불어 추가적으로 뒤틀리는 방향에서 출력 전압을 얻을 수 있다. 미소 전력원으로 실용적인 사용을 위해서 무게추가 더 무거워지고, PZT 박막이 더 두꺼워진다면 소자의 성능이 향상되어 높은 출력 전압을 얻을 수 있을 것이라 기대한다.

  • PDF

Development of JPEG2000 Viewer for Mobile Image System (이동형 의료영상 장치를 위한 JPEG2000 영상 뷰어 개발)

  • 김새롬;정해조;강원석;이재훈;이상호;신성범;유선국;김희중
    • Progress in Medical Physics
    • /
    • v.14 no.2
    • /
    • pp.124-130
    • /
    • 2003
  • Currently, as a consequence of PACS (Picture Archiving Communication System) implementation many hospitals are replacing conventional film-type interpretations of diagnostic medical images with new digital-format interpretations that can also be saved, and retrieve However, the big limitation in PACS is considered to be the lack of mobility. The purpose of this study is to determine the optimal communication packet size. This was done by considering the terms occurred in the wireless communication. After encoding medical image using JPGE2000 image compression method, This method embodied auto-error correction technique preventing the loss of packets occurred during wireless communication. A PC class server, with capabilities to load, collect data, save images, and connect with other network, was installed. Image data were compressed using JPEG2000 algorithm which supports the capability of high energy density and compression ratio, to communicate through a wireless network. Image data were also transmitted in block units coeded by JPEG2000 to prevent the loss of the packets in a wireless network. When JPGE2000 image data were decoded in a PUA (Personal Digital Assistant), it was instantaneous for a MR (Magnetic Resonance) head image of 256${\times}$256 pixels, while it took approximately 5 seconds to decode a CR (Computed Radiography) chest image of 800${\times}$790 pixels. In the transmission of the image data using a CDMA 1X module (Code-Division Multiple Access 1st Generation), 256 byte/sec was considered a stable transmission rate, but packets were lost in the intervals at the transmission rate of 1Kbyte/sec. However, even with a transmission rate above 1 Kbyte/sec, packets were not lost in wireless LAN. Current PACS are not compatible with wireless networks. because it does not have an interface between wired and wireless. Thus, the mobile JPEG2000 image viewing system was developed in order to complement mobility-a limitation in PACS. Moreover, the weak-connections of the wireless network was enhanced by re-transmitting image data within a limitations The results of this study are expected to play an interface role between the current wired-networks PACS and the mobile devices.

  • PDF

Longest First Binary Search on Prefix Length for IP Address Lookup (최장 길이 우선 검색에 기초한 프리픽스 길이에 따른 이진 IP 검색 구조)

  • Chu Ha-Neul;Lim Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.691-700
    • /
    • 2006
  • Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.