• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.5 s.96
• /
• pp.465-471
• /
• 2005

A method of calculation fur propagating and focusing of focused beams generated in antenna arrays, using BPM(Beam Propagation Method), is presented in this paper. Based on the diffraction theory, the beam focusing and Propagation is studied specially for the case of the antenna way fed by the Rotman lens that is able to focus microwave power on its focal arc or generate multiple beams. There are difficulties in performing a full-wave simulation using a commercial EM simulation tool for propagating and focusing of beams because of the structural complexity and the feeding assignment of the antenna array. Therefore, as an alternative solution, the BPM is presented to calculate the beam propagation from the aperture-type antennas. From the point of view of optics, the propagations of the lens have been simplified from the Fresnel diffraction integral to the Fourier transform. Using Fourier Transform, a beam propagation method is developed to show improvement of the resolution by controlling the wavefront of wave Propagating from an aperture-type antenna array. The beam width(or spot size) and the intensity are calculated for a focused beam propagating from an array having $10\lambda$ of its size. For the beams with $20\lambda,\;30\lambda$, and $50\lambda$ of geometrical focal length, the half-power beam widths(or spot size) are about 1.1\lambda,\;1.3\lambda,\;and\;1.9\lambda$ respectively.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.526-530
• /
• 2009

In this paper, we propose a contextual information and physics-based contents manipulation method for a mobile augmented reality authoring system. Due to proliferation of ubiquitous computing in information technology(IT) and advances in sensor technology and mobile devices, AR systems that were only possible in PC can be now feasible on mobile devices. In addition, many AR systems have been proposed that utilize sensory data and reflect them into. Thus, the proposed method provides appropriate visual cues for 3D manipulations of the augmented contents. In addition, uses can manipulate the augmented contents with sensory information through the assignment of sensors to the contents. Moreover, it supports not only a physics-based contents loader that enables users to specify physics properties into the contents, but also the transform matrix between AR and physics engine coordinates. To show the feasibility of the proposed method, we implemented a mobile augmented reality authoring system. We believe that the proposed method can be a key factor for context-aware mobile AR authoring system.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.393-404
• /
• 2004

Recently, public home have used a more than two computer connected with network, and several home appliances using independently with internet or network are developing to be related closely with the network. Therefore, the home utilized for a simple terminal of the global network in the past is being expanded to another part of the sub network. For a variety of connecting home-area protocols with the existing existing network, we require a new Residential Gateway(RG) that does not only make the home-area network operating in the sub network but also connects to the external network. In this paper, RG has intrinsic limits against flexible service due to IP address assignment and hardware capacity. In order to solve this problem in the RG, we propose a Management Server(MS). The MS that offers the integrated managements and control services for a variety of devices connected the RG in the home-area. It can not only solve the dynamic IP address assigning problem but also assigns private IP addresses to the home network devices through the Network Address Translation(NAT). It also provides somewhat useful functions for the home network and the RG for other additional services. <중략> The MS is using a SNMP protocol for managing the RG in the domain, a polling method of the MS and the RG compose a sequence polling method, a polling method using a multi-process and a multi-thread. In this paper, we introduce a problem with polling method separately, show a polling method between the MS and the RG using a multi-thread.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.3
• /
• pp.185-197
• /
• 2001

Recently, the design method by VHDL coding and synthesis has been used widely. As the integration ratio increases, the amount design by VHDL at a time also increases so many coding errors occur in a design. Thus, lots of time and effort is dissipated to detect those coding errors. This paper proposed a method to verify the coding errors in VHDL behavioral-level designs. As the methodology, we chose the method to detect the coding error by applying the generated set of verifying patterns and comparing the responses from the error-free case(gold unit) and the real design. Thus, we proposed an algorithm to generate the verifying pattern set for the coding errors. Verifying pattern generation is peformed for each code and the coding errors are classified as two kind: condition errors and assignment errors. To generate the patterns, VHDL design is first converted into the corresponding CDFG(Control & Data Flow Graph) and the necessary information is extracted by searching the paths in CDFG. Path searching method consists of forward searching and backward searching from the site where it is assumed that coding error occurred. The proposed algorithm was implemented with C-language. We have applied the proposed algorithm to several example VHDL behavioral-level designs. From the results, all the patterns for all the considered coding errors in each design could be generated and all the coding errors were detectable. For the time to generate the verifying patterns, all the considered designed took less than 1 ［sec］ of CPU time in Pentium-II 400MHz environments. Consequently, the verification method proposed in this paper is expected to reduce the time and effort to verify the VHDL behavioral-level designs very much.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.661-667
• /
• 2008

The dynamics of business cycles has been changed by the macroscopic economic forces because of the introduction of new technical know-how each year. These the dynamics of business has a significant influence on the investment of enterprise in the information communication field. Today, the most important goal of the IT investment is simply not to lower the production cost any more, but to improve the usefulness for the customers and partners in order to obtain the optimized mass products. Therefore, the enterprises have been concentrating their all abilities on the automation, integration, and optimization of business process using BPM. In addition, they are concentrating their efforts on the business expansion by approaching the technical aspect using RFID application system. However, in order to accomplish a successful enterprise ability, the technical view, business process view, and organization view must be considered together. We suggested the method considering organization view, via the technical element, i.e., RFID system for approaching the business process. Furthermore, we tried the optimization of assignment using Context Analysis methodology and proposed the method to reduce the element with respect to the time, human, and expense by applying the Case Study method that minimizes the iteration times through the transmitted processing procedure and type. The proposed method gave us the expectation that it will bring out the innovative improvement with respect to the time, expense, quality, and customer's satisfaction in the process from the analysis of business process to the analysis and design of system.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.533-542
• /
• 2001

In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1452-1460
• /
• 2000

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.

• Nuclear Engineering and Technology
• /
• v.53 no.8
• /
• pp.2534-2546
• /
• 2021

Nuclear emergency preparedness and response is an essential part to ensure the safety of nuclear power plant (NPP). Key support technologies of nuclear emergency decision-making usually consist of accident diagnosis, source term estimation, accident consequence assessment, and protective action recommendation. Source term estimation is almost the most difficult part among them. For example, bad communication, incomplete information, as well as complicated accident scenario make it hard to determine the reactor status and estimate the source term timely in the Fukushima accident. Subsequently, it leads to the hard decision on how to take appropriate emergency response actions. Hence, this paper aims to develop a method for rapid source term estimation to support nuclear emergency decision making in pressurized water reactor NPP. The method aims to make our knowledge on NPP provide better support nuclear emergency. Firstly, this paper studies how to build a Bayesian network model for the NPP based on professional knowledge and engineering knowledge. This paper presents a method transforming the PRA model (event trees and fault trees) into a corresponding Bayesian network model. To solve the problem that some physical phenomena which are modeled as pivotal events in level 2 PRA, cannot find sensors associated directly with their occurrence, a weighted assignment approach based on expert assessment is proposed in this paper. Secondly, the monitoring data of NPP are provided to the Bayesian network model, the real-time status of pivotal events and initiating events can be determined based on the junction tree algorithm. Thirdly, since PRA knowledge can link the accident sequences to the possible release categories, the proposed method is capable to find the most likely release category for the candidate accidents scenarios, namely the source term. The probabilities of possible accident sequences and the source term are calculated. Finally, the prototype software is checked against several sets of accident scenario data which are generated by the simulator of AP1000-NPP, including large loss of coolant accident, loss of main feedwater, main steam line break, and steam generator tube rupture. The results show that the proposed method for rapid source term estimation under nuclear emergency decision making is promising.