• Korean Journal of Digital Imaging in Medicine
• /
• v.14 no.2
• /
• pp.9-14
• /
• 2012

Exposed dose of young child should be managed necessarily. Young child is more sensitive than adult of a Radioactivity, especially, and lives longer than adult. Must reduce exposed dose which follows The ALARA(As Low As Reasonably Achievable)rule is recommended by ICRP(International Commission on Radiological Protection)within diagnostic useful range. Therefore, We have to prepare Pediatric DRL(Diagnostic Reference Level) in Korea as soon as possible. Consequently, in this study, wish to estimate organ dose and effective dose using PCXMC Program(a PC-Based Monte Carlo Program), and measure ESD(Entrance surface dose)and organ dose using Glass dosimeter, and then compare with DRL which follows EC(European Commission)and NRPB(National Radiological Protection Board). Using glass dosimeter and PCXMC programs conforming to the International Committee for Radioactivity Prevention(ICRP)-103 tissue weighting factor based on the item before the organs contained in the Chest, Skull, Pelvis, Abdomen in the organ doses and effective dose and dose measurements were evaluated convenience. In a straightforward way to RANDO phantom inserted glass dosimeter(GD352M)by using the hospital pediatric protocol, and in a indirect way was PCXMC the program through a virtual simulation of organ doses and effective dose were calculated. The ESD in Chest PA is 0.076mGy which is slightly higher than the DRL of NRPB(UK) is 0.07mGy, and is lower than the DRL of EC(Europe) which is 0.1mGy. The ESD in Chest Lateral is 0.130mGy which is lower than the DRL of EC(Europe) is 0.2mGy. The ESD in Skull PA is 0.423mGy which is 40 percent lower than the DRL of NRPB(UK) is 1.1mGy and is 28 percent lower than the DRL of EC(Europe) is 1.5mGy. The ESD in Skull Lateral is 0.478mGy which is half than the DRL of NRPB(UK) is 0.8mGy, is 40 percent lower than the DRL of EC(Europe) is 1mGy. The ESD in Pelvis AP is 0.293mGy which is half than the DRL of NRPB(UK) is 0.60mGy, is 30 percent lower than the DRL of EC(Europe)is 0.9mGy. Finally, the ESD in Abdomen AP is 0.223mGy which is half than the DRL of NRPB(UK) is 0.5mGy, and is 20 percent lower than the DRL of EC is 1.0mGy. The six kind of diagnostic radiological examination is generally lower than the DRL of NRPB(UK)and EC(Europe) except for Chest PA. Shouldn't overlook the age, body, other factors. Radiological technician must realize organ dose, effective dose, ESD when examining young child in hospital. That's why young child is more sensitive than adult of a Radioactivity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.271-280
• /
• 2014

In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.85-96
• /
• 2005

A ' Virtual Private Network (YPN) over Internet' has the benefits of being cost-effective and flexible. However, given the increasing demands for high bandwidth Internet and for reliable services in a 'VPN over Intemet,' an IP/GMPLS over DWDM backbone network is regarded as a very favorable approach for the future 'Optical VPN (OVPN)' due to the benefits of transparency and high data rate. Nevertheless, OVPN still has survivability issues such that a temporary fault can lose a large amount of data in seconds, moreover unauthorized physical attack can also be made on purpose to eavesdrop the network through physical components. Also, logical attacks can manipulate or stop the operation of GMPLS control messages and menace the network survivability of OVPN. Thus, network survivability in OVPN (i.e. fault/attack tolerant recovery mechanism considering physical structure and optical components, and secured transmission of GMPLS control messages) is rising as a critical issue. In this Paper, we propose a new path establishment scheme under shared risk link group (SRLG) constraint for physical network survivability. And we also suggest a new logical survivability management mechanism by extending resource reservation protocol-traffic engineering extension (RSVP-TE+) and link management protocol (LMP). Finally, according to the results of our simulation, the proposed algorithms are revealed more effective in the view point of survivability.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.117-126
• /
• 2013

Path planning is an essential problem to make virtual characters navigate in many applications including computer games. In many cases, multiple characters move in a group and qualitative aspects of planned paths are emphasized rather than optimality unlike Robotics. In this paper, we propose a two-level path planning algorithm in which the global path is planned for a single character specified as a leader and then the local path is planned to avoid dynamic obstacles while the group following this path. The space for group movement is achieved in the form of square grid array called a grid window. Member characters are located relatively to the leader within a space and moved. The static environment is reduced to the configuration space of this grid window to generate a roadmap on which a grid window can move. In local path planning, only the leader avoids dynamic obstacles by using an artificial potential field and the rest of members are located relatively to the leader in the grid window, which reduces computational load. Efficient algorithms to implement the proposed planning methods are introduced. The simulation results show that a group can handle with dynamic obstacles effectively while moving along the planned path for a static environment.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.71-80
• /
• 2007

In this paper, we introduce an efficient GPU-based real-time rendering technique applicable to every kind of game. Our method, without an extra geometry, can represent terrain just with a height map. It makes it possible to freely go around in the air or on the surface, so we can directly apply it to any computer games as well as a virtual reality. Since our method is not based on any geometrical structure, it doesn't need special LOD policy and the precision of geometrical representation and visual quality absolutely depend on the resolution of height map and color map. Moreover, GPU-only technique allows the general CPU to be dedicated to more general work, and as a result, enhances the overall performance of the computer. To date, there have been many researches related to the terrain representation, but most of them rely on CPU or confmed its applications to flight simulation, Improving existing displacement mapping techniques and applying it to our terrain rendering, we completely ruled out the problems, such as cracking, poping etc, which cause in polygon-based techniques, The most important contributions are to efficiently deal with arbitrary LOS(Line Of Sight) and dramatically improve visual quality during walk-through by reconstructing a height field with curved patches. We suggest a simple and useful method for calculating ray-patch intersections. We implemented all these on GPU 100%, and got tens to hundreds of framerates with height maps a variety of resolutions$(256{\times}256\;to\;4096{\times}4096)$.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.889-896
• /
• 2006

ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.4
• /
• pp.274-279
• /
• 2009

The flow of a universal system-level design methodology consists of system specification, system-level hardware/software partitioning, co-design, co-verification using virtual or physical prototype, and system integration. In this paper, verification environments based-on SystemVerilog and SystemC, one is native-code co-verification environment which makes prompt functional verification possible and another is SystemVerilog layered testbench which makes clock-level verification possible, are implemented. In native-code co-verification, HW and SW parts of SoC are respectively designed with SystemVerilog and SystemC after HW/SW partitioning using SystemC, then the functional interaction between HW and SW parts is carried out as one simulation process. SystemVerilog layered testbench is a verification environment including corner case test of DUT through the randomly generated test-vector. We adopt SystemC to design a component of verification environment which has multiple inheritance, and we combine SystemC design unit with the SystemVerilog layered testbench using SystemVerilog DPI and ModelSim macro. As multiple inheritance is useful for creating class types that combine the properties of two or more class types, the design of verification environment adopting SystemC in this paper can increase the code reusability.

• Journal of Korean Society of Transportation
• /
• v.28 no.5
• /
• pp.91-106
• /
• 2010

Recently, interest in supply chain management is rising along with the increasing oil prices and traffic congestion. In particular, people started studying the issue, but realized that advantageous strategies for suppliers and retailers are not always advantageous to a carrier. Therefore, in this study the atuhors set up a simulation scenario to understand delivery vehicle routing problems under various inventory policies, namely Economic Order Quantity (EOQ) and Periodic Order Quantity (POQ) and network configurations. First, the authors made a virtual supply chain. Then they analyzed characteristics of delivery vehicle routing under various inventory policies (EOQ and POQ) and network configurations. As a result, the POQ inventory policy decreases the number of vehicles, the number of drivers, and the service time of vehicles. Also, the centralized network increases the load factor of vehicles and decreases the service time of vehicles. In other words, the centralized network and the POQ inventory policy are better for the carrier. These results show a savings of 15,556,806 won ($13,389.10) in a month: a reduction of 17%.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.722-728
• /
• 2012

Urban sewer systems has a limitation of capacity of rainwater storage and problem of occurrence of untreated sewage, so adopting a storage facility for sewer flooding prevention and urban non-point pollution reduction has a big attention. The Korea Ministry of Environment has recently introduced a new concept of "multi-functional storage facility", which is crucial not only in preventive stormwater management but also in dealing with combined sewer overflow and sanitary sewer discharge, and also has been promoting its adoption. However, reserving a space for a single large-scale storage facility might be difficult especially in urban areas. Thus, decentralized construction of small- and midium-sized storage facilities and its operation have been introduced as an alternative way. In this paper, we propose a model predictive control scheme for an optimized operation of distributed storage facilities and sewer networks. To this aim, we first describe the mathematical model of each component of networks system which enables us to analyze its detailed dynamic behavior. Second, overflow locations and volumes will be predicted based on the developed network model with data on the external inflow occurred at specific locations of the network. MPC scheme based on the introduced particle swarm optimization technique then produces the optimized the gate setting for sewer network flow control, which minimizes sewer flooding and maximizes the potential storage capacity. Finally, the operational efficacy of the proposed control scheme is demonstrated by simulation study with virtual rainstorm event.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.1-9
• /
• 2013

Even though the multiple pages TLB are effective in improving the performance, a conventional method with OS support cannot utilize multiple page sizes in user application. Thus, we propose a new multiple-TLB structure supporting multiple page sizes for high performance and low power consumption without any operating system support. The proposed TLB is organised as two parts of a S-TLB(Small TLB) with a small page size and a L-TLB(Large TLB) with a large page size. Both are designed as fully associative bank structures. The S-TLB stores small pages are evicted from the L-TLB, and the L-TLB stores large pages including a small page generated by the CPU. Each one bank module of S-TLB and L-TLB can be selectively accessed base on particular one and two bits of the virtual address generated from CPU, respectively. Energy savings are achieved by reducing the number of entries accessed at a time. Also, this paper proposed the simple 1-bit LRU policy to improve the performance. The proposed LRU policy can present recently referenced block by using an additional one bit of each entry on TLBs. This method can simply select a least recently used page from the L-TLB. According to the simulation results, the proposed TLB can reduce Energy * Delay by about 76%, 57%, and 6% compared with a fully associative TLB, a ARM TLB, and a Dual TLB, respectively.