• Journal of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.357-375
• /
• 2024

The smooth quintic del Pezzo variety Y is well-known to be obtained as a linear sections of the Grassmannian variety Gr(2, 5) under the Plücker embedding into ℙ⁹. Through a local computation, we show the Hilbert scheme of conics in Y for dimY ≥ 3 can be obtained from a certain Grassmannian bundle by a single blowing-up/down transformation.

• Journal of Biomedical Engineering Research
• /
• v.30 no.1
• /
• pp.79-88
• /
• 2009

A harmonic quadrature demodulation method to extract the second harmonic component from focused ultrasound signals after a single transmit-receive event is proposed. In the proposed method, the focused ultrasound signal is converted into baseband inphase and quadrature components by multiplying with sine and cosine signals both having twice the center frequency of the transmitted signal and filtering the two modulated signals. The quadrature component is then passed through a Hilbert filter to be added to the inphase component, which leaves only the envelope of the second harmonic component. A novel phase estimation technique is employed in the proposed method to avoid the phase mismatch between the focused signal and the two modulating signals. The proposed method is verified through both theoretical analysis and computer simulations. It is shown that compared to the pulse inversion scheme the proposed method provides almost the same results for stationary targets and significantly improved harmonic to fundamental ratio for moving targets.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.97-106
• /
• 2015

Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

• Structural Monitoring and Maintenance
• /
• v.7 no.4
• /
• pp.283-294
• /
• 2020

In this paper, an adaptive MEMD based modal identification technique for linear time-invariant systems is proposed employing multiple vibration measurements. Traditional empirical mode decomposition (EMD) suffers from mode-mixing during sifting operations to identify intrinsic mode functions (IMF). MEMD performs better in this context as it considers multi-channel data and projects them into a n-dimensional hypercube to evaluate the IMFs. Using this technique, modal parameters of the structural system are identified. It is observed that MEMD has superior performance compared to its traditional counterpart. However, it still suffers from mild mode-mixing in higher modes where the energy contents are low. To avoid this problem, an adaptive filtering scheme is proposed to decompose the interfering modes. The Proposed modified scheme is then applied to vibrations of a reinforced concrete road bridge. Results presented in this study show that the proposed MEMD based approach coupled with the filtering technique can effectively identify the parameters of the dominant modes present in the structural response with a significant level of accuracy.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2002.03a
• /
• pp.51-58
• /
• 2002

The relative site amplification factors in southern Korea were determined from coda waves using coda normalization method. The seismograms of 15 events at 79 stations were used in this study. Seismogram envelopes were obtained by the Hilbert transform of bandpass-filtered velocity seismograms with frequency bands at 1-2Hz, 2-4Hz, 4-8Hz, 8-l6Hz and 16-32Hz. The envelopes were stabilized by application of moving-average scheme with time window of 1 second. The relative amplitudes of seismogram envelope were computed by dividing the amplitude of seismogram envelope at one site by the amplitude of seismogram envelope at reference site. The relative site amplification factors were obtained by taking averages of the relative amplitude. Values of relative site amplification factors in southern Korea are generally low in western area and high in eastern area.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• Korean Journal of Mathematics
• /
• v.27 no.2
• /
• pp.297-327
• /
• 2019

In this paper, we introduce and study a general iterative algorithm to approximate a common solution of split generalized equilibrium problem, variational inequality problem and fixed point problem for a finite family of nonexpansive mappings in real Hilbert spaces. Further, we prove a strong convergence theorem for the sequences generated by the proposed iterative scheme. Finally, we derive some consequences from our main result. The results presented in this paper extended and unify many of the previously known results in this area.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.96-107
• /
• 2011

Recently, studies of 3D HDTV broadcasting technology have been processed actively. Korea is making efforts to modify Advanced Television Systems Committee (ATSC) 8-Vestigial Side Band (8-VSB) systems for terrestrial 3D HDTV broadcasting services. We intend to adopt a new frame structure to use PN (Pseudo-Noise) sequence as frame header, and VSB modulation. PN sequence is used to recover carrier freqeuncy offset, carrier phase error. In this paper, we will describe this system as the modified ATSC systems. The receiver of the modified ATSC system should be able to estimate and recover carrier frequency offset exactly. A existing ATSC systems inserts pilot to recover carrier frequency offset, on the other hand the modified ATSC systems use PN sequence to recovery carrier frequency offset without the use of pilot. In this paper, we introduce carrier frequency recovery (CFR) scheme for the modified ATSC systems. The proposed CFR scheme is composed of coarse CFR scheme using Fitz algorithm and fine CFR scheme using a simple PN sequence correlation algorithm. And, the symbol information of QAM modulated signal is contained in both In-phase (I)channel and Quadrature-phase (Q)channel. However the symbol information of VSB modulated signal is contained in I channel, and Q channel is just Hilbert transform of I channel. For the reason, VSB modulated symbols can not have fixed phase like QAM modulated symbols, and VSB modulated symbols is more sensitive to carrier frequency offset. Therefore we perform phase correction of received PN sequence to improve performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.