• Nuclear Engineering and Technology
• /
• v.35 no.6
• /
• pp.581-595
• /
• 2003

Transport lattice codes require the resonance integral tables for the resonant nuclides where the resonance integral is a function of the background cross section and can be prepared through a special program solving the slowing down equation. In case the cross section libraries do not include the resonance integral table for the resonant nuclides, the computational prediction produces a large error. We devised a new method using a Monte Carlo calculation for the effective resonance cross sections to solve this problem provisionally. We extended this method to obtain the resonance integral table for general purpose. The MCNP code is used for the effective resonance integrals and the LIBERTE code for the effective background cross sections. We modified the HELIOS library with the effective cross sections and the resonance integral tables obtained by the newly developed Monte Carlo method, and performed sample calculations using HELIOS and LIBERTE. The results showed that this method is very effective for the resonance treatment.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.51-63
• /
• 2001

We are interested in the conditional independence in sparse $2\tims2\tims$K tables with very rare cell counts. The most popular test is Cochran-Mantel-Haenszel statistic when sample sizes are moderately large enough to guarantee the chi-square approximation. We will consider jackknifing the CMH test and also suggest an approximate normal distribution for the standardized jackknifed CMH statistic. The main focus of this paper is to improve the chi-squared approximation to the CMH test by using the asymptotic normality of the jackknifed CMH test when sample sizes are very sparse but K and N$\infty$. The performance of the proposed jackknifed test, in the sense of significance level control and power, will be compared with that of the CMH test through a Monte Carlo study.

• Journal of the Korean Society of Food Culture
• /
• v.6 no.1
• /
• pp.21-29
• /
• 1991

To analyze tableware in wedding ceremonies of royal prince(1744, 1819) of Chosun Dynasty, the author studied the historic book-Gare Dogam Euigwae, in which wedding feast dishes for King and prince in Chosun Dynasty were described. The results obtained from the study were as follows, 1. For wedding feast dishes for prince, black lacquered table was used, and for King's wedding feast red lacquered table was used. 2. In wedding ceremony red silk table cloth was used. 3. Tables arranged in wedding ceremony had high legs. 4. Tablewares used in wedding ceremony were footed dishes. 5. Wedding ceremony arrangement was made up of four kinds of main table, a small boiled beef table, a large boiled beef table, four small round tables, a dining table, a candle stick, a incense holder, a vase with vaseholder and a liquor bottle with a holder.

• Journal of Information Technology and Architecture
• /
• v.9 no.1
• /
• pp.11-19
• /
• 2012

Generally, a suffix tree is an efficient data structure since it reveals the detailed internal structures of given sequences within linear time. However, it is difficult to implement a suffix tree for a large number of sequences because of memory size constraints. Therefore, in order to compare multi-mega base genomic sequence sets using suffix trees, there is a need to re-construct the suffix tree algorithms. We introduce a new method for constructing a suffix tree on secondary storage of a large number of sequences. Our algorithm divides three files, in a designated sequence, into parts, storing references to the locations of edges in hash tables. To execute experiments, we used 1,300,000 sequences around 300Mbyte in EST to generate a suffix tree on disk.

• The KIPS Transactions:PartD
• /
• v.19D no.1
• /
• pp.1-14
• /
• 2012

As the size of the data warehouse is large, the selection of indices on the data warehouse affects the efficiency of the query processing of the data warehouse. Indices induce the lower query processing cost, but they occupy the large storage areas and induce the index maintenance cost which are accompanied by database updates. The bitmap join indices are well applied when we optimize the star join queries which join a fact table and many dimension tables and the selection on dimension tables in data warehouses. Though the bitmap join indices with the binary representations induce the lower storage cost, the task to select the indexing attributes among the huge candidate attributes which are generated is difficult. The processes of index selection are to reduce the number of candidate attributes to be indexed and then select the indexing attributes. In this paper on bitmap join index selection problem we reduce the number of candidate attributes by the data mining techniques. Compared to the existing techniques which reduce the number of candidate attributes by the frequencies of attributes we consider the frequencies of attributes and the size of dimension tables and the size of the tuples of the dimension tables and the page size of disk. We use the mining of the frequent itemsets as mining techniques and reduce the great number of candidate attributes. We make the bitmap join indices which have the least costs and the least storage area adapted to storage constraints by using the cost functions applied to the bitmap join indices of the candidate attributes. We compare the existing techniques and ours and analyze them in order to evaluate the efficiencies of ours.

• International Journal of Highway Engineering
• /
• v.18 no.2
• /
• pp.91-101
• /
• 2016

PURPOSES : The aim of this study was to compare the performance of the QUEENSOD method and the gravity model in estimating Origin-Destination (O/D) tables for a large-sized microscopic traffic simulation network. METHODS : In this study, an expressway network was simulated using the microscopic traffic simulation model, VISSIM. The gravity model and QUEENSOD method were used to estimate the O/D pairs between internal and between external zones. RESULTS: After obtaining estimations of the O/D table by using both the gravity model and the QUEENSOD method, the value of the root mean square error (RMSE) for O/D pairs between internal zones were compared. For the gravity model and the QUEENSOD method, the RMSE obtained were 386.0 and 241.2, respectively. The O/D tables estimated using both methods were then entered into the VISSIM networks and calibrated with measured travel time. The resulting estimated travel times were then compared. For the gravity model and the QUEENSOD method, the estimated travel times showed 1.16% and 0.45% deviation from the surveyed travel time, respectively. CONCLUSIONS : In building a large-sized microscopic traffic simulation network, an O/D matrix is essential in order to produce reliable analysis results. When link counts from diverse ITS facilities are available, the QUEENSOD method outperforms the gravity model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.236-239
• /
• 2021

With the growth of AI technology, the scale of Knowledge Graphs continues to be expanded. Knowledge Graphs are mainly expressed as RDF representations that consist of connected triples. Many RDF storages compress and transform RDF triples into the condensed IDs. However, if we try to transform a large scale of RDF triples, it occurs the high processing time and memory overhead because it needs to search the large ID mapping table. In this paper, we propose the method of converting RDF triples using Hash-based ID mapping tables with MapReduce, which is the software framework with a parallel, distributed algorithm. Our proposed method not only transforms RDF triples into Integer-based IDs, but also improves the conversion speed and memory overhead. As a result of our experiment with the proposed method for LUBM, the size of the dataset is reduced by about 3.8 times and the conversion time was spent about 106 seconds.

• Asia pacific journal of information systems
• /
• v.20 no.3
• /
• pp.115-137
• /
• 2010

Information technology (IT) outsourcing, the use of a third-party vendor to provide IT services, started in the late 1980s and early 1990s in Korea, and has increased rapidly since 2000. Recently, firms have increased their efforts to capture greater value from IT outsourcing. To date, there have been a large number of studies on IT outsourcing. Most prior studies on IT outsourcing have focused on outsourcing practices and decisions, and little attention has been paid to objectively measuring the value of IT outsourcing. In addition, studies that examined the performance of IT outsourcing have mainly relied on anecdotal evidence or practitioners' perceptions. Our study examines the contribution of IT outsourcing to economic growth in Korean industries over the 1990 to 2007 period, using a production function framework and a panel data set for 54 industries constructed from input-output tables, fixed-capital formation tables, and employment tables. Based on the framework and estimation procedures that Han, Kauffman and Nault (2010) used to examine the economic impact of IT outsourcing in U.S. industries, we evaluate the impact of IT outsourcing on output and productivity in Korean industries. Because IT outsourcing started to grow at a significantly more rapid pace in 2000, we compare the impact of IT outsourcing in pre- and post-2000 periods. Our industry-level panel data cover a large proportion of Korean economy-54 out of 58 Korean industries. This allows us greater opportunity to assess the impacts of IT outsourcing on objective performance measures, such as output and productivity. Using IT outsourcing and IT capital as our primary independent variables, we employ an extended Cobb-Douglas production function in which both variables are treated as factor inputs. We also derive and estimate a labor productivity equation to assess the impact of our IT variables on labor productivity. We use data from seven years (1990, 1993, 2000, 2003, 2005, 2006, and 2007) for which both input-output tables and fixed-capital formation tables are available. Combining the input-output tables and fixed-capital formation tables resulted in 54 industries. IT outsourcing is measured as the value of computer-related services purchased by each industry in a given year. All the variables have been converted to 2000 Korean Won using GDP deflators. To calculate labor hours, we use the average work hours for each sector provided by the OECD. To effectively control for heteroskedasticity and autocorrelation present in our dataset, we use the feasible generalized least squares (FGLS) procedures. Because the AR1 process may be industry-specific (i.e., panel-specific), we consider both common AR1 and panel-specific AR1 (PSAR1) processes in our estimations. We also include year dummies to control for year-specific effects common across industries, and sector dummies (as defined in the GDP deflator) to control for time-invariant sector-specific effects. Based on the full sample of 378 observations, we find that a 1% increase in IT outsourcing is associated with a 0.012~0.014% increase in gross output and a 1% increase in IT capital is associated with a 0.024~0.027% increase in gross output. To compare the contribution of IT outsourcing relative to that of IT capital, we examined gross marginal product (GMP). The average GMP of IT outsourcing was 6.423, which is substantially greater than that of IT capital at 2.093. This indicates that on average if an industry invests KRW 1 millon, it can increase its output by KRW 6.4 million. In terms of the contribution to labor productivity, we find that a 1% increase in IT outsourcing is associated with a 0.009~0.01% increase in labor productivity while a 1% increase in IT capital is associated with a 0.024~0.025% increase in labor productivity. Overall, our results indicate that IT outsourcing has made positive and economically meaningful contributions to output and productivity in Korean industries over the 1990 to 2007 period. The average GMP of IT outsourcing we report about Korean industries is 1.44 times greater than that in U.S. industries reported in Han et al. (2010). Further, we find that the contribution of IT outsourcing has been significantly greater in the 2000~2007 period during which the growth of IT outsourcing accelerated. Our study provides implication for policymakers and managers. First, our results suggest that Korean industries can capture further benefits by increasing investments in IT outsourcing. Second, our analyses and results provide a basis for managers to assess the impact of investments in IT outsourcing and IT capital in an objective and quantitative manner. Building on our study, future research should examine the impact of IT outsourcing at a more detailed industry level and the firm level.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.21-31
• /
• 2010

Recently e-business such as online financial trade and online shopping using mobile computes are widely spread. Most of mobile computers use NAND flash memory-based storage devices for storing data. Flash memory storage devices use a software called flash translation layer to translate logical address from a file system to physical address of flash memory by using mapping tables. The legacy FTLs have a problem that they must maintain very large mapping tables in the RAM. In order to address this issues, in this paper, we proposed a new caching scheme of mapping tables. We showed through the trace-driven simulations that the proposed caching scheme reduces the space overhead dramatically but does not increase the time overhead. In the case of online transaction workload in e-business environment, in particular, the proposed scheme manifests better performance in reducing the space overhead.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.