• Geophysics and Geophysical Exploration
• /
• v.9 no.3
• /
• pp.241-249
• /
• 2006

Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms commonly used, however, may not give sufficiently precise computational results of traveltime data particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. Considering the complex geology of Korea, we assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution. The performance of the algorithm developed in this study is demonstrated by the comparison of the analytic and numerical solutions for the homogeneous anisotropic earth as well as through the numerical experiment for the two layer model whose anisotropic properties are greatly different each other. We expect that the developed modeling algorithm can be used in the development of processing and inversion schemes of seismic data acquired in strongly anisotropic environment, such as migration, velocity analysis, cross-well tomography and so on.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.157-168
• /
• 2006

Spatial detection system such as AVI, GPS, and Beacon etc. can provide spatial travel time only after a vehicle Passes through a road section. In this context, majority of the existing studies on the link travel time estimation area has focused on the arrival time-based link travel time estimation. rather than departure time-based link travel time estimation. Even if some of the researches on this area have developed departure time-based link travel time estimation algorithms, they are limited in that they are not applicable in a real-time mode. The objective of this study is to develop an departure time-based link travel time estimation algorithm which is applicable in a real-tine mode. Firstly, this study discussed the tradeoff between accuracy and timeliness of the departure time-based on-line link travel time estimates. Secondly, this study developed an departure time-based on-line link travel time estimation algorithm which utilizes the Baysian inference logic. It was found that the proposed approach could estimate departure time-based link travel times in a real-time context with an acceptable accuracy and timeliness.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.1-14
• /
• 2000

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.163-165
• /
• 2006

The subway passengers are usually alert to the current location of the train in order not to miss the destination or transfer stations. The Global Positioning System (GPS), although expensive, can give an alarm if properly programmed, but cannot receive the satellite signals, underground. Therefore, a novel approach to context-aware location-based subway information system is motivated. The passengers, who are equipped with mobile devices such as laptop, PDA, and mobile phone as clients of the Personal Area Network (PAN), request the Bluetooth connection to the server which is installed in each car of the train. While the sorrel broadcasts the location-based information including the previous station, the current velocity of the train, the distance and time to the next station, the clients provide additional services based on the recognized context of the information, and what the passengers individually want. The services are spontaneous and autonomous rather than passive. The services include not only the information on the nearby stations, exit numbers, connection buses but also the location-based alarms which can be set specific to various personal requests, and sounded by the location of the train rather than time. Whereas the arrival time may not be accurate due to the delays of the train, the location can be accurately traced and broadcast by the server. Also, the clients do not need any expensive systems like GFS. Towards validating the proposed approach, we implemented a Bluetooth PAN including a PC server, two PDA clients and a laptop client. We modeled a train on the Incheon Subway Line #1 and a train on the Seoul-to-Incheon Line on the server, simulated the virtual trains together with the real clients. and verified that all the services were successfully provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.820-831
• /
• 1999

In this paper, we have compared the performance of a D-TDMA protocol with that of a CDMA protocol, in radio access system for integrated voice/data services.The D-TDMA protocol is based on a generic dynamic channel assignment approach to be followed a combination of “circuit mode” reservation for voice calls, along with dynamic first-come-first served assignment of remaining capacity for data messages. In the CDMA protocol, we have used the voice activity detection to reduce the interface power of other mobiles in internal and external cells, and analyzed the interference power ratio. Also we have computed BER(Bit Error Rate) by using this interference power ratio and evaluated voice blocking probability(voice packet loss probability) and data transmission delay, according to average data length and average data arrival rate.We have found the CDMA protocol achieves comparatively higher performance for short data length, regardless of data arrival rate. Otherwise, the data transmission delay of D-TDMA protocol is shorter than that of the CDMA protocol for long data message.

• 한국방재학회:학술대회논문집
• /
• 2008.02a
• /
• pp.249-252
• /
• 2008

The solutions are expressed in terms of a double integral transformation over wavenumber and frequency. The complete solution is considered in such a full wave theory approach. This method can handle a larger number of plane layers. Therefore, the result of FK method is very similar to real data. Using the models that were modified in velocity and Q value with depth by iterative process from a model (Kang and Park, 2006) and considered as one of the best models in Korean Peninsula, the synthetic data are simulated for explosions and earthquakes of North Korea. This study notes that the wave shape of the synthetic data is very dependent on Q value, velocities, and thickness of sedimentary layers. Comparing between the real and the synthetic, fitting well in arrival time of first arrival and wave shape causes us to arrive at an indication that the model is very close representation of upper crustal structure and simulations are well done in amplitude fitting and in identification of phases of local and regional waves.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1081-1088
• /
• 2021

The modern wireless communication system employes the beamforming technique based on a massive array antenna with a number of elements, for supporting the smooth communication services. A reliable beamforming technology requires the Angle-of-Arrival(: AOA) information for the signal incident to the receiving antenna, which is generally estimated by the high-resolution AOA estimation algorithm such as Multiple Signal Classification(: MUSIC). Although the MUSIC algorithm has the excellent estimation performance, it is difficult to estimate AOA in real time for the massive array antenna due to the extremely high computational complexity. In order to enhance this problem, in this paper, we propose the cascade AOA estimation algorithm based on a Flexible Massive Concentric Circular Array(: FMCCA) antenna with the On/Off function for antenna elements. The proposed cascade algorithm consists of the CAPON algorithm using some elements among entire antenna elements and the Beamspace MUSIC algorithm using entire elements. We provide computer simulation results for various scenarios to demonstrate the AOA estimation performance of the proposed approach.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.3
• /
• pp.369-375
• /
• 2017

One of good DF(Direction Finding) methods is based on TDOA(Time Difference of Arrival) estimation when finding underwater moving target. For small DF error, high time resolution A/D(Analog-to-digital) conversion board and long baseline are needed. But the result of sea trial about close-range and high speed moving target, spatial correlation coefficient and appeared poor properties below 0.3 when hydrophone arrangement are separated over 6 ${\lambda}$ because of underwater fading channel. And we also find out that the distance between hydrophone should be under 4 ${\lambda}$ apart to take advantage of spatial correlation coefficient gain and performance of DF in underwater moving channel environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.255-261
• /
• 2004

The problem of geolocation using multiple satellites is to determine the position of a transmitter located on the Earth by processing received signals. The specific problem addressed in this paper is that of estimating the position of a stationary transmitter located on or above the Earth's surface from measured time difference of arrivals (TDOA) by a geostationary orbiting (GSO) satellite and a low earth orbiting (LEO) satellite. The proposed geolocation method is based on the total least squares (TLS) algorithm. Under erroneous positions of the satellites together with noisy TDOA measurements, the TLS algorithm provides a better solution. By running Monte-Carlo simulations, the proposed method is compared with the ordinary least squares (LS) approach.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.941-949
• /
• 2021

In this study, a spatial spectrum method is proposed to cope with the pilot spoofing attack (PSA) problem by exploiting the of uplink-downlink channel reciprocity in time-division-duplex multiple-input multiple-output systems. First, the spoofing attack in the uplink stage is detected by a threshold derived from the predefined false alarm based on the estimated spatial spectrum. When the PSA occurs, the transmitter (That is Alice) can detect either one or two spatial spectrum peaks. Then, the legitimate user (That is Bob) and Eve are recognized in the downlink stage via the channel reciprocity property based on the difference between the spatial spectra if PSA occurs. This way, the presence of Eve and the direction of arrival of Eve and Bob can be identified at the transmitter end. Because noise is suppressed by a spatial spectrum, the detection performance is reliable even for low signal-noise ratios and a short training length. Consequently, Bob can use beamforming to transmit secure information during the data transmission stage. Theoretical analysis and numerical simulations are performed to evaluate the performance of the proposed scheme compared with conventional methods.