• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.17-26
• /
• 2017

An anti-forensic data hiding method in an NTFS index record is a method designed for anti-forensics, which records data as a file name in index entries and thereafter the index entries are made to remain in the intentionally generated slack area in a 4KB-sized index record[7]. In this paper, we propose a maximum data allocation rule for an anti-forensic data hiding method in an NTFS index record; i.e., a computational method for storing optimal data to hide data in an index record of NTFS is developed and the optimal solution is obtained by applying the method. We confirm that the result of analyzing the case where the number of index entries n = 7 is the maximum case, and show the screen captures of index entries as experimental results.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.1
• /
• pp.146-158
• /
• 1996

The WKB method has been widely used in evaluating of the propagation characteristics of planar waveguides with graded-index profiles. This method, however, yields large errors when a turning point is near or at the discontinuity in the presence of the index discontinuity or index slope discontinuity. Especially, in the case of a truncated-index profile, this phenomenon appears more clearly in the low-order modes and near the cutoff regions. The MWKB method is introduced to reduce these inherent errors of the conventional WKB method. The MWKB method is based on both the linearization of the index profile from an index discontinuity and the introduction of a virtual turning point. It is noticed that the b-v curves obtained by the MWKB method agree well with those of the finite-difference method, and that the phase shift at a turning point depends on both the index profile and its propagation constant. (author). refs., figs.

• Journal of Industrial Technology
• /
• v.6
• /
• pp.39-48
• /
• 1986

This paper examines the effects on safety index analysis with Level II Second-Moment Method. The general two variable problem is examined by means of Cornell safety index ${\beta}c$ Rosenblueth-Esteva safety index ${\beta}_{RE}$ Rackwitz-Fiessler safety index by iterative method and Practical FOSM safety index ${\beta}_p$, which based partly on the concepts given by Paloheimo and Hannus, proposed the algorithm in this paper. The calculated examples have shown that safety index by Practical FOSM Method proposed in this paper would be similar to those in the method by Rosenblueth-Esteva or Rackwitz-Fissler and be simpler in calculation than the Rackwitz's Advanced FOSM Method, in which the iterative procedure has to be used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.434-438
• /
• 2004

This paper has proposed presumable method of ergonomics estimate index from evoked potential of visual stimulation for establishment a fixed ergonomics estimate index. The proposed method presumes continuance time and amplitude of ergonomics using prony method. Band characteristic of alpha and beta band, and that of background and evoked potential was analyzed using FFT method. And, that were presumed continuance time and amplitude of ergonomics using porny method. As a result of that proposed method presumed band characteristic, continuance time and amplitude of ergonomics, classification of ergonomics of impatient, rage and fear were practicable.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.93-105
• /
• 2001

In the lossless step of Lattice Vector Quantization(LVQ), the lattice codewords produced at quantization step are enumerated into radius sequence and index sequence. The radius sequence is run-length coded and then entropy coded, and the index sequence is represented by fixed length binary bits. As bit rate increases, the index bit linearly increases and deteriorates the coding performances. To reduce the index bits across the wide range of bit rates, we developed a novel lattice enumeration algorithm adopting the set partitioning method. The proposed enumeration method shifts down large index values to smaller ones and so reduces the index bits. When the proposed lossless coding scheme is applied to a wavelet based image coding, the proposed scheme achieves more than 10% at bit rates higher than 0.3 bits/pixel over the conventional lossless coding method, and yields more improvement as bit rate becomes higher.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.119-130
• /
• 2005

A spatial data warehouse is a system that stores geographical information as a subject oriented, integrated, time-variant, non-volatile collection for efficiently supporting decision. This system consists of a builder and a spatial data warehouse server. A spatial data warehouse server suspends user services, stores transferred data in the data repository and constructs index using stored data for short response time. Existing methods that construct index are bulk-insertion and index transfer methods. The Bulk-insertion method has high clustering cost for constructing index and searching cost. The Index transfer method has improper for the index reconstruction method of a spatial data warehouse where periodic source data are inserted. In this paper, the efficient index reconstruction method using a partial index in a spatial data warehouse is proposed. This method is an efficient reconstruction method that transfers a partial index and stores a partial index with expecting physical location. This method clusters a spatial data making it suitable to construct index and change treated clusters to a partial index and transfers pages that store a partial index. A spatial data warehouse server reserves sequent physical space of a disk and stores a partial index in the reserved space. Through inserting a partial index into constructed index in a spatial data warehouse server, searching, splitting, remodifing costs are reduced to the minimum.

• Journal of the Korean Society for Precision Engineering
• /
• v.4 no.4
• /
• pp.36-42
• /
• 1987

Very accurate calibration is needed to index tables which are necessary for precision angle measurement. The repeatability of index table is less than 0.2 second, so that attentions should be paid to choosing devices to be used in the calibration of index tables. The auto- collimators have been used in the calibration of index tables, but the repeatability of auto- collimators is bad compared with that of index table. In place of autocollimators, we described a method which uses electric comparators which are possessed by most precision measurement laboratories. Electric comparators are set to measure small angle displacement without interrupting the rotation of index tables and the signals of two electric comparators are added to remove the run-out errors of the shafts of index tables. Two index tables have been calibrated simulataneously by this method and the measurement data have been analyzed by the least squares method. We compare the calibration results with those of methods using autocollimator and auto- matic autocollimator and are able to know that the data of electric comparator method lie between the data of autocollimator methods. The repeatability of measurement is less than 0.02 second. The electric comparator method is economical and capable of reducing the uncertainty of the measurement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.993-1014
• /
• 2021

This paper proposes a new image retrieval method called the 3D integrated multi-index to fuse SIFT (Scale Invariant Feature Transform) visual words with other features at the indexing level. The advantage of the 3D integrated multi-index is that it can produce finer subdivisions in the search space. Compared with the inverted indices of medium-sized codebook, the proposed method increases time slightly in preprocessing and querying. Particularly, the SIFT, contour and colour features are fused into the integrated multi-index, and the joint cooperation of complementary features significantly reduces the impact of false positive matches, so that effective image retrieval can be achieved. Extensive experiments on five benchmark datasets show that the 3D integrated multi-index significantly improves the retrieval accuracy. While compared with other methods, it requires an acceptable memory usage and query time. Importantly, we show that the 3D integrated multi-index is well complementary to many prior techniques, which make our method compared favorably with the state-of-the-arts.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• v.y2004m10
• /
• pp.83-86
• /
• 2004

Index adjusted ration method has been widely utilized in public construction secter for contract sum adjustment by price fluctuation. In this method. the Production Price Index are used for calculating the base ratio. but the PPI can't reflect the property of construction project in respect of the selected item and weight structure. In this research we prove the problem of using the index adjusted ration method in contract sum adjustment by price fluctuation. and improve it by using the construction cost index. which has the property of construction project. And the result. we figure out the difference between the PPI and CCI by $6.7\%$ in maximum value.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.8
• /
• pp.85-93
• /
• 2018

In this research, it is proposed that a method to hide data by modifying directory index entry information. It consists of two methods: a directory list hiding and a file contents hiding. The directory list hiding method is to avoid the list of files from appearing in the file explorer window or the command prompt window. By modifying the file names of several index entries to make them duplicated, if the duplicated files are deleted, then the only the original file is deleted, but the modified files are retained in the MFT entry intact. So, the fact that these files are hidden is not exposed. The file contents hiding is to allocate data to be hidden on an empty index record page that is not used. If many files are made in the directory, several 4KB index records are allocated. NTFS leaves the empty index records unchanged after deleting the files. By modifying the run-list of the index record with the cluster number of the file-to-hide, the contents of the file-to-hide are hidden in the index record. By applying the proposed method to the case of hiding two files, the file lists are not exposed in the file explorer and the command prompt window, and the contents of the file-to-hide are hidden in the empty index record. It is proved that the proposed method has effectiveness and validity.