New concepts and ideas often result from extensive recombination of existing concepts or ideas. Both researchers and developers build on existing concepts and ideas in published papers or registered patents to develop new theories and technologies that in turn serve as a basis for further development. As the importance of patent increases, so does that of patent analysis. Patent analysis is largely divided into network-based and keyword-based analyses. The former lacks its ability to analyze information technology in details while the letter is unable to identify the relationship between such technologies. In order to overcome the limitations of network-based and keyword-based analyses, this study, which blends those two methods, suggests the keyword network based analysis methodology. In this study, we collected significant technology information in each patent that is related to Light Emitting Diode (LED) through text mining, built a keyword network, and then executed a community network analysis on the collected data. The results of analysis are as the following. First, the patent keyword network indicated very low density and exceptionally high clustering coefficient. Technically, density is obtained by dividing the number of ties in a network by the number of all possible ties. The value ranges between 0 and 1, with higher values indicating denser networks and lower values indicating sparser networks. In real-world networks, the density varies depending on the size of a network; increasing the size of a network generally leads to a decrease in the density. The clustering coefficient is a network-level measure that illustrates the tendency of nodes to cluster in densely interconnected modules. This measure is to show the small-world property in which a network can be highly clustered even though it has a small average distance between nodes in spite of the large number of nodes. Therefore, high density in patent keyword network means that nodes in the patent keyword network are connected sporadically, and high clustering coefficient shows that nodes in the network are closely connected one another. Second, the cumulative degree distribution of the patent keyword network, as any other knowledge network like citation network or collaboration network, followed a clear power-law distribution. A well-known mechanism of this pattern is the preferential attachment mechanism, whereby a node with more links is likely to attain further new links in the evolution of the corresponding network. Unlike general normal distributions, the power-law distribution does not have a representative scale. This means that one cannot pick a representative or an average because there is always a considerable probability of finding much larger values. Networks with power-law distributions are therefore often referred to as scale-free networks. The presence of heavy-tailed scale-free distribution represents the fundamental signature of an emergent collective behavior of the actors who contribute to forming the network. In our context, the more frequently a patent keyword is used, the more often it is selected by researchers and is associated with other keywords or concepts to constitute and convey new patents or technologies. The evidence of power-law distribution implies that the preferential attachment mechanism suggests the origin of heavy-tailed distributions in a wide range of growing patent keyword network. Third, we found that among keywords that flew into a particular field, the vast majority of keywords with new links join existing keywords in the associated community in forming the concept of a new patent. This finding resulted in the same outcomes for both the short-term period (4-year) and long-term period (10-year) analyses. Furthermore, using the keyword combination information that was derived from the methodology suggested by our study enables one to forecast which concepts combine to form a new patent dimension and refer to those concepts when developing a new patent.
Kim, Injai;Choi, Jaewon;Kim, Kihwan;Min, Geumyoung
Journal of Information Technology Services
/
v.13
no.1
/
pp.181-196
/
2014
Many studies have been studied in the Information Technology (IT) area such as Information Systems, Business, Industrial Engineering, Computer Science, Data Analytics and so on. Although various fields for IT exist, searching experts and reviewers in IT journals are subjective. The related journals have made efforts to assign experts for the qualified review. This study conducted developing the framework for understanding and evaluating the experts among co-authors and reviewers through social network analysis. To explore the findings, we collected data of the co-authored network and the reviewer network of the Korea Society of IT Services Journal. Totally, 545 authors for submissions and 314 co-authors were used for analyzing the co-authored network. To analyze the network, we divided two networks as a network for 545 papers and a network of 316 papers excluded 229 single authored-papers. In the findings, we found out various researchers published their papers with collaborations. Also, authors who have high scores of centrality can be said as experts for specific fields. In addition, we analyzed 358 data of reviewers from 2005 to 2011. About 50 reviewers have reviewed the submitted papers based on their expertise since 2005. Peculiarly, the expertise and the qualified review in Korea Society of IT Services Journal were identified in that almost reviewers do not review various papers at a time based on low degree measures and network density.
Won Dae-Heui;Yang Gwang-Woong;Choi Moo-Sung;Park Sang-Deok;Lee Ho-Gil
Proceedings of the Korean Society of Precision Engineering Conference
/
2005.06a
/
pp.1034-1039
/
2005
SALM(Simultaneous localization and mapping) and AI(Artificial intelligence) have been active research areas in robotics for two decades. In particular, localization is one of the most important tasks in mobile robot research. Until now expensive sensors such as a laser sensor have been used for mobile robot localization. Currently, the proliferation of RFID technology is advancing rapidly, while RFID reader devices, antennas and tags are becoming increasingly smaller and cheaper. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used for identifying location of the mobile robot in the smart floor. We discuss a number of challenges related to this approach, such as tag distribution (density and structure), typing and clustering. In the smart floor using RFID tags, the localization error results from the sensing area of the RFID reader, because the reader just knows whether the tag is in the sensing range of the sensor and, until now, there is no study to estimate the heading of mobile robot using RFID tags. So, in this paper, two algorithms are suggested to. The Markov localization method is used to reduce the location(X,Y) error and the Kalman Filter method is used to estimate the heading($\theta$) of mobile robot. The algorithms which are based on Markov localization require high computing power, so we suggest fast Markov localization algorithm. Finally we applied these algorithms our personal robot CMR-P3. And we show the possibility of our probability approach using the cheap sensors such as odometers and RFID tags for mobile robot localization in the smart floor
Seo, Dae-Sung;Won, Dae-Heui;Yang, Gwang-Woong;Choi, Moo-Sung;Kwon, Sang-Ju;Park, Joon-Woo
제어로봇시스템학회:학술대회논문집
/
2005.06a
/
pp.1797-1801
/
2005
SLAM(Simultaneous localization and mapping) and AI(Artificial intelligence) have been active research areas in robotics for two decades. In particular, localization is one of the most important issues in mobile robot research. Until now expensive sensors like a laser sensor have been used for the mobile robot's localization. Currently, as the RFID reader devices like antennas and RFID tags become increasingly smaller and cheaper, the proliferation of RFID technology is advancing rapidly. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used to identify the mobile robot's location on the smart floor. We discuss a number of challenges related to this approach, such as RFID tag distribution (density and structure), typing and clustering. In the smart floor using RFID tags, because the reader just can senses whether a RFID tag is in its sensing area, the localization error occurs as much as the sensing area of the RFID reader. And, until now, there is no study to estimate the pose of mobile robot using RFID tags. So, in this paper, two algorithms are suggested to. We use the Markov localization algorithm to reduce the location(X,Y) error and the Kalman Filter algorithm to estimate the pose(q) of a mobile robot. We applied these algorithms in our experiment with our personal robot CMR-P3. And we show the possibility of our probability approach using the cheap sensors like odometers and RFID tags for the mobile robot's localization on the smart floor.
Journal of the Korean Society for Precision Engineering
/
v.15
no.8
/
pp.17-25
/
1998
Aluminum alloys have low density, relatively high strength and yield strength, good plasticity, good machinability, and high corrosion and acid resistance. Therefore, they are suitable for large containers for the food, chemical and other industries. Large containers are often bodies of revolution consisting of shell courses, stiffening rings, heads and other elements joined by annular welds. Larger containers have longer welds and require greater leak-tightness and higher weld mechanical properties. The LNG tank consists of aluminum plates with various sizes, so its construction should by divided by several sections. Moreover, each section has its own sub-section consisted of several aluminum plates. To guarantee the quality of huge LNG tank, therefore, the precise control of plate dimension should by urgently needed in conjunction with the appropriate selection of process parameters such as cutting speed, depth of cut, rotational speed and so on. In this paper, a manufacturing system was developed to implement automatic circular tracking in height direction and automatic circular interpolation in depth of cut direction. Also, the neural network based on the backpropagation algorithm was used to predict the cutting quality and motor load related with the life time of the developed system. It was revealed that the manufacturing system and the neural network could be effectively applied to the bevelling process and to predict the quality of machined area and the motor load.
In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of pheromone on incoming arcs to a node. The node pheromone can be regarded as a relative density measure in a local region. After a finite number of ants' hopping, we remove nodes with a small amount of node pheromone from the directed graph, and obtain a group of strongly connected components as clusters. We iteratively do this removing process from a low value of threshold to a high value, yielding a hierarchy of clusters. We demonstrate the performance of the proposed algorithm with synthetic and real data sets, comparing with traditional clustering methods. Experimental results show the superiority of the proposed method to the traditional methods.
Pumps are essential machinery in the various industries. With the development of high-speed and large-scale pumps, especially high energy density, high requirements have been imposed on the vibration and noise performance of pumps, and cavitation is an important source of vibration and noise excitation in pumps, so it is necessary to improve pumps cavitation performance. The modern pump optimization design method mainly adopts parameterization and artificial intelligence coupling optimization, which requires direct correlation between geometric parameters and pump performance. The existing cavitation performance calculation method is difficult to be integrated into multi-objective automatic coupling optimization. Therefore, a fast prediction method for pump cavitation performance is urgently needed. This paper proposes a novel cavitation prediction method based on impeller pressure isosurface at single-phase media. When the cavitation occurs, the area of pressure isosurface Siso increases linearly with the NPSHa decrease. This demonstrates that with the development of cavitation, the variation law of the head with the NPSHa and the variation law of the head with the area of pressure isosurface are consistent. Therefore, the area of pressure isosurface Siso can be used to predict cavitation performance. For a certain impeller blade, since the area ratio Rs is proportional to the area of pressure isosurface Siso, the cavitation performance can be predicted by the Rs. In this paper, a new cavitation performance prediction method is proposed, and the feasibility of this method is demonstrated in combination with experiments, which will greatly accelerate the pump hydraulic optimization design.
Spatial data mining is a process to discover interesting relationships and characteristics those exist implicitly in a spatial database. Many spatial clustering algorithms have been developed. But, there are few approaches that focus simultaneously on clustering spatial data and assigning weight to non-spatial attributes of objects. In this paper, we propose a new spatial clustering algorithm, called DBSCAN-W, which is an extension of the existing density-based clustering algorithm DBSCAN. DBSCAN algorithm considers only the location of objects for clustering objects, whereas DBSCAN-W considers not only the location of each object but also its non-spatial attributes relevant to a given application. In DBSCAN-W, each datum has a region represented as a circle of various radius, where the radius means the degree of the importance of the object in the application. We showed that DBSCAN-W is effective in generating clusters reflecting the users requirements through experiments.
Recently as ubiquitous environment comes to the fore, information density is raised and enterprise is being able to capture and utilize customer-related information at the same time when the customer purchases a product. In this environment, a need for the recommender systems which can deliver proper information to the customer at the right time and right situation is highly increased. Therefore, the research on recommender systems continued actively in a variety of fields. Until now, most of recommender systems deal with item recommendation. However, in the market in ubiquitous environment where the same item can be purchased at several stores, it is highly desirable to recommend store to the customer based on his/her contextual situation and preference such as store location, store atmosphere, product quality and price, etc. In this line of research, we proposed the store recommender system using customer's contextual situation and preference in the market in ubiquitous environment. This system is based on collaborative filtering and Apriori algorithms. It will be able to provide customer-centric service to the customer, enhance shopping experiences and contribute in revitalizing market in the long term.
With the convergence of the information and communication technologies, a new age of technological civilization has arrived. This is the age of intelligent revolution, known as the 4th industrial revolution. The 4th industrial revolution is based on technological innovations, such as robots, big data analysis, artificial intelligence, and unmanned transportation facilities. This revolution would interconnect all the people, things, and economy, and hence will lead to the expansion of the industry. A high-density, high-capacity energy technology is required to maintain this interconnection. As a next-generation energy source, lithium-ion batteries are in the spotlight today. However, lithium-ion batteries can cause thermal runaway and fire because of electrical, thermal, and mechanical abuse. In this study, thermal runaway was induced in 72.5 Ah NCM pouch-type lithium-ion batteries because of thermal abuse. The surface of the pouch-type lithium-ion batteries was heated by the hot plate heating method, and the effect of the rate of increase in the surface temperature on the thermal runaway trigger time was analyzed using Minitab 19, a statistical analysis program. The correlation analysis results confirmed that there existed a strong negative relationship between each variable, while the regression analysis demonstrated that the thermal runaway trigger time of lithium-ion batteries can be predicted from the rate of increase in their surface temperature.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.