• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.227-240
• /
• 2011

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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2395-2402
• /
• 2013

An active-RC channel selection filter (CSF) with the bandwidth of 40MHz and the improved linearity is proposed in this paper. The proposed CSF is the fifth butterworth filter which consists of a first order low pass filter, two second order low pass filters of a biquad architecture, and DC feedback circuit for cancellation of DC offset. To improve the linearity of the CSF, a body node of a MOSFET for a switch is connected to its source node. The bandwidth of the designed CSF is selected to be 10MHz, 20MHz and 40MHz and its voltage gain is controlled by 6 dB from 0 dB to 24 dB. The proposed CSF is designed by using 40nm 1-poly 8-metal CMOS process with a 1.2V. When the designed CSF operates at the bandwidth of 40 MHz and voltage gain of 0 dB, the simulation results of OIP3, in-band ripple, and IRN are 31.33dBm, 1.046dB, and 39.81nV/sqrt(Hz), respectively. The power consumption and layout area are $450{\times}210{\mu}m^2$ and 6.71mW.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.91-102
• /
• 2005

When it comes to the process of information storage, people are likely to organize individual information into the forms of groups rather than independent attributes, and put them together in their brains. Likewise, in case of finding the shortest path, this study suggests that a Hierarchical Road Network(HRN) model should be selected to browse the most desirable route, since the HRN model takes the process mentioned above into account. Moreover, most of drivers make a decision to select a route from origin to destination by road hierarchy. It says that the drivers feel difference between the link travel tine which was measured by driving and the theoretical link travel time. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Stochastic Process model uses the historical patterns of travel time conditions on links. The HRN model has compared favorably with the conventional shortest path finding model in tern of calculated speeds. Even more, the result of the shortest path using the HRN model has more similar to the survey results which was conducted to the taxi drivers. Taxi drivers have a strong knowledge of road conditions on the road networks and they are more likely to select a shortest path according to the real common sense.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.3
• /
• pp.175-190
• /
• 2006

For the recent several years, there has been much interest in lexical semantic network However it seems to be very difficult to evaluate the effectiveness and correctness of it and invent the methods for applying it into various problem domains. In order to offer the fundamental ideas about how to evaluate and utilize lexical semantic networks, we developed two automatic vol·d clustering systems, which are called system A and system B respectively. 68.455.856 words were used to learn both systems. We compared the clustering results of system A to those of system B which is extended by the lexical-semantic network. The system B is extended by reconstructing the feature vectors which are used the elements of the lexical-semantic network of 3.656 '-ha' verbs. The target data is the 'multilingual Word Net-CoroNet'. When we compared the accuracy of the system A and system B, we found that system B showed the accuracy of 46.6% which is better than that of system A. 45.3%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.9
• /
• pp.4234-4243
• /
• 2012

USN(Ubiquitous Sensor Network) application S/W has a complex characteristic that it controls various kind of sensor nodes organically based on the core modules of various target operating systems. Currently, various researches for efficient S/W development are being performed in USN application field. In order to increase S/W productivity, the method such as product line development approach to specify core common functions of applications according to the domain and develop applications with the core common functions and variant functions selected according to the workflow of applications is efficient. To apply this approach to the USN domain, characteristics of USN application S/W and product line development should be specified with one consistent view. However, it is difficult to efficiently specify the characteristics using general UML notations. In order to solve the problem, this paper proposes a method to effectively specify the characteristics of USN applications and product line development using UML profile which is the extension mechanism of UML. The proposed UML profile for produce line based USN application development enables developers to effectively develop product line based USN applications using existing UML and UML support tools without new design methods or tools which are specified for USN or product line development.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.3
• /
• pp.68-76
• /
• 2000

The stabilization control of Inverted Pendulum(IP) system is difficult because of its nonlinearity and structural unstability. Futhermore, a series of conventional techniques such as the pole placement and the optimal control based on the local linearizations have narrow stabilizable regions. At the same time, the fine tunings of their gain parameters are also troublesome. Thus, in this paper, an Evolving Neural Network Controller(ENNC) which its structure and its connection weights are optimized simultaneously by Real Variable Elitist Genetic Algorithm(RVEGA) was presented for stabilization of an IP system with nonlinearity. This proposed ENNC was described by a simple genetic chromosome. And the deletion of neuron, the according to the various flag types. Therefore, the connection weights, its structure and the neuron types in the given ENNC can be optimized by the proposed evolution strategy. And the proposed ENNC was implemented successfully on the ADA-2310 data acquisition board and the 80586 microprocessor in order to stabilize the IP system. Through the simulation and experimental results, we showed that the finally acquired optimal ENNC was very useful in the stabilization control of IP system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.724-739
• /
• 2009

This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.25-33
• /
• 2010

Multi-media service has been changed into user based audio services, which service supports actively user's preference and interaction with the users. In the market, multi-media products which can support the highest audio-quality by using lossless audio technology have been released and object audio music which user can select the objects has been serviced. In this paper, we design user's preference information based object audio file format and audio scene description for storage and transmission media. The designed file format is designed based on MPEG-4 file format because high-quality audio codecs in MPEG-4 audio can be easily used and the track of file format can be flexibly controlled depend on the number of the instrument in music. The encoded audio data of each objects and encoded audio scene description by binary encoding that has independent track are packed in a file. The scene description for storage media is consist of full and object scene description, the scene description for transmission media has an essential description for object audio operation and a specific description for real audio sound. The designed file format based simulator is developed and it generates an object audio file with several scene descriptions. Also, the real audio sound is serviced by the interaction with user and the unpacked scene description.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.2 s.14
• /
• pp.123-132
• /
• 1999

With the rapid increases of the amount of data and computing, the parallelization of the computing algorithm becomes necessary more than ever. However the parallelization had been conducted mostly in a super-computer until the rod 1990s, it was not for the general users due to the high price, the complexity of usage, and etc. A new concept for the parallel processing has been emerged in the form of K-clustering form the late 1990s, it becomes an excellent alternative for the applications need high computer power with a relative low cost although the installation and the usage are still difficult to the general users. The mapping algorithms (cut, join, resizing, warping, conversion from raster to vector and vice versa, etc) in GIS are well suited for the parallelization due to the characteristics of the data structure. If those algorithms are manipulated using PC-clustering, the result will be satisfiable in terms of cost and performance since they are processed in real flu with a low cos4 In this paper the tools and the libraries for the parallel processing and PC-clustering we introduced and how those tools and libraries are applied to mapping algorithms in GIS are showed. Parallel programs are developed for the mapping algorithms and the result of the experiments shows that the performance in most algorithms increases almost linearly according to the number of node.