• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1037-1050
• /
• 2000

A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch. A goal of a BISDN network is to provided integrated transport for a wide range of applications such as teleconferencing, Video On Demand etc. There require multipoint communications in addition to conventional point-to-point connections. Therefore multicast capabilities are very essential in multimedia communications. In this paper, we propose a new multicast cell scheduling method on the Parallel Multicast Packet Switch with Ring network: PMRN which are based on separated HOL. In this method, we place two different HOLs, one for unicast cells and the other for multicast cells. Then using non-FIFO scheduling, we can schedule both unicast cells and multicast cells which are available at the time in the input buffer. The simulation result shows that this method reduces the delay in the input buffer and increases the efficiency of both point-to-point network and ring network and finally enhances the bandwidth of the overall packet switch.

• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.1
• /
• pp.37-46
• /
• 2017

Recently, disaster caused by social factors is frequently occurring in Korea. Prediction about what crisis could happen is difficult, raising the citizen's concern. In this study, we developed a program to acquire tweet data by applying Python language based Tweepy plug-in, regarding social disasters such as 'Nonspecific motive crimes' and 'Oxy' products. These data were used to evaluate psychological trauma and anxiety of citizens through the text clustering analysis and the opinion mining analysis of the R Studio program after natural language processing. In the analysis of the 'Oxy' case, the accident of Sewol ferry, the continual sale of Oxy products of the Oxy had the highest similarity and 'Nonspecific motive crimes', the coping measures of the government against unexpected incidents such as the 'incident' of the screen door, the accident of Sewol ferry and 'Nonspecific motive crime' due to misogyny in Busan, had the highest similarity. In addition, the average index of the Citizens sentiment score in Nonspecific motive crimes was more negative than that in the Oxy case by 11.61%p. Therefore, it is expected that the findings will be utilized to predict the mental health of citizens to prevent future accidents.

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1994.11a
• /
• pp.27-30
• /
• 1994

잠재적으로 항감염 약제로 사용될 가능성이 있는 약제들의 초기 연구과정에서 주된 관심사는 이들이 미생물(세균, 바이러스, 기타 기생충)에 대한 작용들이 있는가 하는 점이다. 이러한 작용들이 실험적으로 충분히 연구가 된 후에야 실험동물에서 그 효과를 연구한다. 항 바이러스 제제의 경우에는 세포배양을 통한 연구가 그 약제의 독성과 효용성을 나타내는데 필수적인 것이 된다. 여러 종류의 동물을 이용한 생체실험에서 약제의 일반적인 흡수와 배설, 분포 등에 관한 정보와 약제 자체와 동물 내에서의 대사적 변화에 대한 정보가 제공된다. 여러 가지 미생물로 감염을 시킨 적합한 동물과 여러 가지 용량으로 치료하는 실험을 통하여 약제의 항 감염 능력이 알려지게 된다. 동물에서의 생체실험과 실험관내에서 실험을 하고 나서야 사람에서의 연구가 이루어지게 된다. 소위 전임상시험에서 대표적 병원성 미생물에 대한 생물학적효과, 약리학적 효과와 독성 그리고 동물실험모델에서의 가능한 효과가 결정된 후에 임상시험에 들어가기 마련이다. 항균제의 임상시험에는 각각의 감염질환에 대한 진단 및 치료기준을 반영하는 것이 기본이다. 새로운 항균제의 임상시험에서는 안전성과 효과가 반드시 밝혀져야 한다. 1상에서는 인체에서의 약리효과, 안전성이 주목적이며, 2상과 3상은 겹쳐지는 점도 있으나 하나 또는 그 이상의 적응증에 대한 항균제의 효과와 단기간의 부작용은 2상에서 관찰하여야하며, 다수의 환자에서 제안된 적응질환의 무작위임상시험과 다수에서의 안전성도 3상에서 관찰하여야 한다. 4상에서는 이상에서의 자료로 시판된 후에도 계속해서 감시하는 것으로 지속적으로 안전성을 관찰하는 것이다. 이러한 기본사항외에도 소아, 임산부, 고령자등에서의 임상시험도 넓은 의미에서 포함되어야 할 것이며 또한 질적인 면에서 조절하는 Quality Assurance도 중요하다.양상은 세 용량군 간 차이가 없었으나, 시험기에서 발열의 발현율이 낮았으며, 발열일 수와 항생제 사용일 수가 짧았다. 결론: 골수억제 조절 효과는 용량에 따른 혈액소견에 미치는 영향, 부작용, 감염의 빈도, 감염발생에 따른 항생제 사용기간 등을 고려하여 그 임상 유효성 평가시, 제 3상 시험에 사용할 권장량 (recommended dose) 은 250 ug/$m^2$/d $\times$ 10d 으로 관찰되었다.5주에 부검한 랫드의 간에서 c-myc 종양단백의 발현은 모든 처리군들이 대조군에 비하여 높게 발현되는. 것이 관찰되었으나 시험개시후 26주에 부검한 랫드의 간에서 c-myc 종양단백의 발현은 대조군에 비하여 차이가 거의 없었다. 따라서 랫드에서 화학적으로 유도한 간암발생 과정에서 NK 세포활성이 현저하게 억제되는 것으로 생각되며, c-myc 종양단백의 발현은 시험개시후 15주에 그 발현이 확실한 것으로 사료되어 진다.에 영향을 주는 성분이 있음을 제시하였다.1과 항우울약들의 항혈소판작용은 PKC-기질인 41-43 kD와 20 kD의 인산화를 억제함에 기인되는 것으로 사료된다.다. 것으로 사료된다.다.바와 같이 MCl에서 작은 Dv 값을 갖는데, 이것은 CdCl$_{4}$$^{2-}$ 착이온을 형성하거나 ZnCl$_{4}$$^{2-}$ , ZnCl$_{3}$$^{-}$같은 이온과 MgCl$^{+}$, MgCl$_{2}$같은 이온종을 형성하기 때문인것 같다. 한편 어떠한 용리액에서던지 NH$_{4}$$^{+}$의 경우 Dv값이 제일 작았다. 바. 본 연구의 목적중의 하나인 인체유

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.103-116
• /
• 2008

This paper proposes quay crane (QC) scheduling algorithms that determine the working sequence of QCs over ship bays in a container vessel in automated container terminals. We propose two scheduling algorithms that examine the distribution of export containers in the stacking yard and determine the sequence of ship bays to balance the workload distribution among the yard blocks. One of the algorithms is a simple heuristic algorithm which dynamically selects the next ship bay based on the entropy of workloads among yard blocks whenever a QC finishes loading containers at a ship bay and the other uses genetic algorithm to search the optimal sequence of ship bays. To evaluate the fitness of each chromosome in the genetic algorithm, we have devised a method that is able to calculate an approximation of loading time of container vessels considering the workloads among yard blocks. Simulation experiments have been carried out to compare the efficiency of the proposed algorithms. The results show that our QC scheduling algorithms are efficient in reducing the turn-around time of container vessels.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.85-97
• /
• 2011

Wireless sensor networks have emerged as one of the key enabling technologies for ubiquitous computing since wireless intelligent sensor nodes connected by short range communication media serve as a smart intermediary between physical objects and people in ubiquitous computing environment. We recognize the wireless sensor network as a massively distributed and deeply embedded system. Such systems require concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. Since the operating environment and architecture of wireless sensor networks, with the seemingly conflicting requirements, poses unique design challenges and constraints to developers, we propose a very new operating system for sensor nodes based on finite state machine. In this paper, we clarify the design goals reflected from the characteristics of sensor networks, and then present the heart of the design and implementation of a compact and efficient state-driven operating system, SenOS. We describe how SenOS can operate in an extremely resource constrained sensor node while providing the required reactivity and dynamic reconfigurability with low update cost. We also compare our experimental results after executing some benchmark programs on SenOS with those on TinyOS.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.29-37
• /
• 1999

In general, the information processing capability of a neural network is determined by its architecture and efficient training patterns. However, there is no systematic method for designing neural network and selecting effective training patterns. Evolutionary Algorithms(EAs) are referred to as the methods of population-based optimization. Therefore, EAs are considered as very efficient methods of optimal system design because they can provide much opportunity for obtaining the global optimal solution. In this paper, we propose a new method for finding the optimal structure of neural networks based on competitive co-evolution, which has two different populations. Each population is called the primary population and the secondary population respectively. The former is composed of the architecture of neural network and the latter is composed of training patterns. These two populations co-evolve competitively each other, that is, the training patterns will evolve to become more difficult for learning of neural networks and the architecture of neural networks will evolve to learn this patterns. This method prevents the system from the limitation of the performance by random design of neural networks and inadequate selection of training patterns. In co-evolutionary method, it is difficult to monitor the progress of co-evolution because the fitness of individuals varies dynamically. So, we also introduce the measurement method. The validity and effectiveness of the proposed method are inspected by applying it to the visual servoing of robot manipulators.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.95-102
• /
• 2012

In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.43-56
• /
• 2012

Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.