• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.281-290
• /
• 1996

In this paper we suggest an OFDM star network based on carrier distribution and homodyne detection in which all optical carriers generated and stabilized in a specific node are distributed to each node. We studied ASK and PSK modulation schemes and calculated rspective SNRs and BERs for this network. We also discussed on the optical power requirement on the light sources for 200 Mb/s transmission speed. As a result, we found tht ASK and PSK respectively require 13 dBm and 10 dBm for 32 nodes and the nmber of nodes can be expanded to 73 with only 0 dBm of power and minimum insertion losses of components. The proposed network is more reliable than the conventional ones due to the centralized carrier maintenance andthe network is suitable for the adverse environment of the nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.267-271
• /
• 2000

Traffic analysis during past years used the Poisson distribution or Markov model, assuming an exponential distribution of packet queue arrival. Recent studies, however, have shown aperiodic and burst characteristics of network traffics. Such characteristics of data traffic enable the scalability of network, QoS, optimized design, when we analyze new traffic model having a self-similar characteristic. This paper analyzes the self-similar characteristics of a small-scale mixed traffic in a network simulation, the real network Traffic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.263-267
• /
• 2000

Traffic analysis during past years used the Poisson distribution or Markov model, assuming an exponential distribution of packet queue arrival. Recent studies, however, have shown aperiodic and burst characteristics of network traffics Such characteristics of data traffic enable the scalability of network, QoS, optimized design, when we analyze new traffic model having a self-similar characteristic. This paper analyzes the self-similar characteristics of a small-scale mixed traffic in a network simulation, the real WAN delay time, TCP packet size, and the total network usage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.289-295
• /
• 2000

Traffic analysis during past years used the Poisson distribution or Markov model, assuming an exponential distribution of packet queue arrival. Recent studies, however, have shown aperiodic and burst characteristics of network traffics. Such characteristics of data traffic enable the scalability of network, QoS, optimized design, when we analyze new traffic model having a self-similar characteristic. This paper analyzes the self-similar characteristics of a small-scale mixed traffic in a network simulation, the real WAN delay time, TCP packet size, and the total network usage.

• 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 Safety Management & Science
• /
• v.11 no.4
• /
• pp.193-199
• /
• 2009

Recently, an industrial production-distribution planning problem has been widely investigated in Supply Chain Management(SCM). One of the key issues in the current SCM research area is reverse logistics network. This study have developed a simulation model for the reverse logistics network. The simulation model analysis reverse logistics network issues such as inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment. Computational experiments using commercial simulation tool ARENA show that the real problems. The model can be used to decide an appropriate production-distribution planning problem in the research area.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.31-34
• /
• 2004

This research proposes the lateral transshipment policy that can deal efficiently with stockout in the two-echelon distribution network in supply chain. The lateral transshipment policy can be expected for retailers to response the change of customers' demands efficiently. Because of various factors, such as demand fluctuation, replenishment quantity, lead time, and so on, it is very difficult to decide optimal lateral transshipment time and quantity. We suggest the new lateral transshipment policy based on the service level in this research. The efficiency of this policy is proved by simulation experiments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.10
• /
• pp.1460-1465
• /
• 2017

Outage areas can be transferred to adjacent feeders to restore power supply in case of the fault on the distribution system. Feeders in the small island or mountain area may not have backup feeders due to the low density of load. In this weakly meshed open loop system, BESS can be used as a backup feeder to improve reliability of power supply. This paper proposes a new network reconfiguration method for BESS based service restoration. Fuzzy decision making technique is adopted to deal with fuzziness of service restoration planning rules. Case studies using KEPCO real distribution system have been performed to verify feasibility of the proposed method.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.21-34
• /
• 2012

This paper addresses a network design problem in a supply chain system that involves locating both plants and distribution centers, and determining the best strategy for distributing products from the suppliers to the plants, from the plants to the distribution centers and from the distribution centers to the customers. This paper suggests a cooperative coevolutionary algorithm (CCEA) approach to solve the model. First, the problem is decomposed into three subproblems for each of which the chromosome population is created correspondingly. Each chromosome in each population is represented as a permutation denoting the priority. Then an algorithm generating a solution from the combined set of chromosomes from each population is suggested. Also an algorithm evaluating the performance of a solution is suggested. An experimental study is carried out. The results show that our CCEA tends to generate better solutions than the previous CCEA as the problem size gets larger and that the permutation representation for chromosome used here is better than other representation.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.519-521
• /
• 2000

Network reconfiguration is an operation task, and consists in the determination of the switching operations such to reach the minimum loss conditions of the distribution network. In this paper, an effective heuristic based switch scheme for loss minimization is given for the optimization of distribution loss reduction and a solution approach is presented. The solution algorithm for loss minimization has been developed based on the two stage solution methodology. The first stage of this solution algorithm sets up a decision tree which represent the various switching operations available, the second stage applies a proposed technique called cyclic best first search. Therefore, the solution algorithm of proposed method can determine on-off switch statuses for loss reduction, with a minimum computational effort.