• Investigative Magnetic Resonance Imaging
• /
• v.11 no.1
• /
• pp.10-19
• /
• 2007

Conventional MRI methods using T1-, T2-, diffusion-, perfusion-weighting, and functional imaging rely on characterizing the physical and functional properties of the tissue. In this review, we introduce an imaging modality based on measured the mechanical properties of soft tissue, namely magnetic resonance elastography (MRE). The use of palpation to identify the stiffness of tissue remains a fundamental diagnostic tool. MRE can quantify the stiffness of the tissue thereby providing a objective means to measure the mechanical properties. To accomplish a successful clinical setting using MRE, hardware and software techniques in the area of transducer, pulse sequence, and imaging processing algorithm need to be developed. Transducer, a mechanical vibrator, is the core of MRE application to make wave propagate invivo. For this reason, considerations of the frame of human body, pressure and friction of the interface, and high magnetic field of a MRI system needs to be taken into account when designing a transducer. Given that the wave propagates through human body effectively, developing an appropriate pulse sequence is another important issue in obtaining an optimal image. In this review paper, we introduce the technical aspects needed for MRE experiments and introduce several applications of this new field.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.673-680
• /
• 2003

In this paper, we study the enhancement of VQ (Vector Quantization) design for text independent speaker recognition. In a concrete way, we present a non-iterative method which makes a vector quantization codebook and this method performs non-iterative learning so that the computational complexity is epochally reduced The proposed Classified Space VQ (CSVQ) design method for text Independent speaker recognition is generalized from Semi-noniterative VQ design method for text dependent speaker recognition. CSVQ contrasts with the existing desiEn method which uses the iterative learninE algorithm for every traininE speaker. The characteristics of a CSVQ design is as follows. First, the proposed method performs the non-iterative learning by using a Classified Space Codebook. Second, a quantization region of each speaker is equivalent for the quantization region of a Classified Space Codebook. And the quantization point of each speaker is the optimal point for the statistical distribution of each speaker in a quantization region of a Classified Space Codebook. Third, Classified Space Codebook (CSC) is constructed through Sample Vector Formation Method (CSVQ1, 2) and Hyper-Lattice Formation Method (CSVQ 3). In the numerical experiment, we use the 12th met-cepstrum feature vectors of 10 speakers and compare it with the existing method, changing the codebook size from 16 to 128 for each Classified Space Codebook. The recognition rate of the proposed method is 100% for CSVQ1, 2. It is equal to the recognition rate of the existing method. Therefore the proposed CSVQ design method is, reducing computational complexity and maintaining the recognition rate, new alternative proposal and CSVQ with CSC can be applied to a general purpose recognition.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.93-100
• /
• 2007

Since Koblitz and Miller suggested the use of elliptic curves in cryptography, there has been an extensive literature on elliptic curve cryptosystem (ECC). The use of ECC is based on the observation that the points on an elliptic curve form an additive group under point addition operation. To realize secure cryptosystems using these groups, it is very important to find an elliptic curve whose group order is divisible by a large prime, and also to find a base point whose order equals this prime. While there have been many dramatic improvements on finding an elliptic curve and computing its group order efficiently, there are not many results on finding an adequate base point for a given curve. In this paper, we propose an efficient method to find a random base point on an elliptic curve defined over $GF(p^m)$. We first show that the critical operation in finding a base point is exponentiation. Then we present efficient algorithms to accelerate exponentiation in $GF(p^m)$. Finally, we implement our algorithms and give experimental results on various practical elliptic curves, which show that the new algorithms make the process of searching for a base point 1.62-6.55 times faster, compared to the searching algorithm based on the binary exponentiation.

• Journal of Korean Society of Disaster and Security
• /
• v.13 no.2
• /
• pp.53-63
• /
• 2020

In this study, the two-dimensional flow analysis model Hydro_AS-2D model was used to simulate the situation of flooding in Seongsangu and Uichang-gu in Changwon in the event of rising sea levels and extreme flooding, and the results were expressed on three-dimensional topography and the optimal evacuation path was derived using BIM technology. Climate change significantly affects two factors in terms of flood damage: rising sea levels and increasing extreme rainfall ideas. The rise in sea level itself can not only have the effect of flooding coastal areas and causing flooding, but it also raises the base flood level of the stream, causing the rise of the flood level throughout the stream. In this study, the rise of sea level by climate change, the rise of sea level by storm tidal wave by typhoon, and the extreme rainfall by typhoon were set as simulated conditions. The three-dimensional spatial information of the entire basin was constructed using the information of topographical space in Changwon and the information of the river crossing in the basic plan for river refurbishment. Using BIM technology, the target area was constructed as a three-dimensional urban information model that had information such as the building's height and location of the shelter on top of the three-dimensional topographical information, and the results of the numerical model were expressed on this model and used for analysis for evacuation planning. In the event of flooding, the escape route is determined by an algorithm that sets the path to the shelter according to changes in the inundation range over time, and the set path is expressed on intuitive three-dimensional spatial information and provided to the user.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.548-556
• /
• 2015

The highly maneuverable fighter aircraft such as F-22, F-16 and F-15have the high maneuverability to maximize the combat performance, whereas the high maneuver characteristics might degrade the pilot's mission efficiency due to fatigue's increase by exposing him to the high gravity and, in the worst case, the pilot could face GLOC (Gravity-induced Loss Of Consciousness). The advanced aerospace company has applied the various technologies to improve the pilot's tolerance to the gravity acceleration, in order to prevent the pilot from entering the situation of the loss of consciousness. Especially, the Anti-G Suit(AGS) equipment to protect the pilot against the high gravity in flight could improve the mission success rate by decreasing the pilot's fatigue in the combat maneuver as well as prevent the pilot from facing GLOC. In this paper, a control algorithm is developed and verified to provide an optimal air pressure to AGS according to the gravity increase during the high performance maneuver. This result is expected, as the key technology, to contribute to the KF-X(Korean Fighter eXperimental), project in the near future.

• Radiation Oncology Journal
• /
• v.12 no.1
• /
• pp.109-115
• /
• 1994

The purpose of this paper is to develop an efficient method for the quick determination of multiple isocenters plans to provide optimal dose distribution in sterotactic radiosurgery. A Spherical dose model was developed through the use of fit to the exact dose data calculated in a 18cm diameter of spherical head phantom. It computes dose quickly for each spherical part and is useful to estimate dose distribution for multiple isocenters. An automatic computer search algorithm was developed using the relationship between the isocenter move and the change of dose shape, and adapted with a spherical dose model to determine isocenter separation and cellimator sizes quickly and automatically. A spheric81 dose model shows a comparable isodose distribution with exact dose data and permits rapid calculations of 3-D isodoses. the computer search can provide reasonable isocenter settings more quickly than trial and error types of plans, while producing steep dose gradient around target boundary. A spherical dose model can be used for the quick determination of the multiple isocenter plans with 3 computer automatic search. Our guideline is useful to determine the initial multiple isocenter plans.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.426-439
• /
• 1999

본 논문에서는 웹(World Wide Web)에서 사용자가 손쉽고 편리하게 이용할 수 있는 멀티미디어 대중교통 안내시스템 개발 경험을 소개한다. 개발된 시스템은 클라이언트와 서버 시스템, 경로탐색 시스템, 교통정보 저장 시스템, 노선 및 정류장 관리 시스템으로 구성되어 있다. 클라이언트에서 작동되는 사용자 인터페이스는 직관적으로 이해가 쉽고, 사용이 편리하며 인터액티브한 멀티미디어 대중 교통안내 서비스를 제공한다. 서버 시스템은 교통정보 수집 시스템으로부터 입력되는 데이타와, 경로탐색 시스템, 교통정보 저장 시스템과 연동되어 클라이언트의 요구사항을 처리하고 그 결과를 사용자에게 돌려준다. 수정된 A* 알고리즘을 이용하는 경로탐색 시스템은 최적경로를 탐색하며, 교통정보 저장 시스템은 현재 교통상황, 정류장, 노선, 지도 등의 정보를 저장한다. 노선 및 정류장 관리시스템은 시스템 관리자가 노선 또는 정류장 관리를 서버 화면의 지도상에서 효율적으로 수행할 수 있는 도구이다. 본 논문에서 다루는 대중교통 안내시스템은 Java로 구현하였기 때문에 확장과 이식이 용이하며, 시스템 유지보수 비용이 적게 드는 장점을 가지고 있다. 그리고, 웹 브라우저가 동작되는 환경에서는 어디서나 쉽게 접근이 가능하며 향후 구축될 Intelligent Transportation Systems(ITS)의 한 모듈로써 바로 작동될 수 있을 뿐만 아니라, 현재 인터넷상에서 제공되는 다양한 서비스와도 연동이 가능하다.Abstract This paper introduces our experience for developing a public transportation guidance system, which facilitates the World-Wide Web(WWW) to provide users with easier access and use. The proposed system is composed of four subsystems: client/server system, path search system, traffic data storage system, and traffic raw-data management system. The user interface in clients utilizes Java to furnish users with multimedia data accessibility and interactivity. The server processes clients' requests based on the traffic data coming from remote sensing devices and interacts with the path search system and traffic data storage system to provide users with the results. The path search system, which uses a modified A* algorithm, produces optimal solutions based on dynamic traffic data. The traffic data storage system stores the current traffic information together with the geographical information about the b$us_way routes. The traffic raw-data management system is a graphical user interface which enables the system manager to handle the traffic information easily on the map in the terminal screen. The system has considerable benefits such as portability, scalability, and flexibility since it is implemented using Java. Also, it can be extended to an integrated Intelligent Transportation Systems(ITS) which includes a variety of information on the Internet as well as traffic information.n.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.92-99
• /
• 2016

A wind turbine is controlled for the purpose of obtaining the maximum power below its rated wind speed. Among the methods of obtaining the maximum power, TSR (Tip Speed Ratio) optimal control and P&O (Perturbation and Observation) control are widely used. The P&O control algorithm using the turbine power and rotational speed is simple, but its slow response is a weak point. Whereas TSR control's response is fast, it requires the precise wind speed. A method of measuring or estimating the wind speed is used to obtain a precise value. However, estimation methods are mostly used, because it is difficult to avoid the blade interference when measuring the wind speed near the blades. Neural networks and various numerical methods have been applied for estimating the wind speed, because it involves an inverse problem. However, estimating the wind speed is still a difficult problem, even with these methods. In this paper, a new method is introduced to estimate the wind speed in the wind-power graph by using the turbine power and rotational speed. Matlab/Simulink is used to confirm that the proposed method can estimate the wind speed properly to obtain the maximum power.