• Korean Institute of Interior Design Journal
• /
• v.17 no.5
• /
• pp.166-174
• /
• 2008

As the use of virtual environment for decision-making interior or architectural design has been increasingly broaden, the choice of media form-physical, objective properties of a display medium-became and important issue to take into consideration. This research deals with the effects and differences between two types of media for a virtual environment; wall projection screen(120") and PC monitor(17"). In addition, efficient adoption of the two media forms was also proposed in this research. A total of 90 subjects participated in pre-designed three experimental groups(A group: experiment with a wall projection screen, B group: experiment with PC monitor, C group: both) and answer the seating preferences, the presence inventory, and the decision confidence using a simulated virtual restaurant environment. The results are as follows: (1) seating preferences for the tables located in frequent traffic area and near other spaces such as restroom and th kitchen are significantly different by the media form. While there is no significant difference found in seating preferences for most tables except high traffic areas near entrances between the two media. This result demonstrates the effects of media type or screen size on user perception for the areas near structural or interior design elements. (2) The presence measure in this research consist of in this research consist of four factors: 'spatial presence,' 'object presence,' 'positive effects,' and 'the factor of negative effects. 'The mean values of the items involving engagement or interaction in the spatial presence factor and the object presence factor are significantly different by the media form. A higher sense of presence of presence was observed in the wall projection screen. (3) PC monitor condition was shown to provide a higher level of decision confidence. Based on the research finding, conclusions and implications are discussed.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.536-546
• /
• 2005

In this paper, we focus on the filtering step of candidate objects for spatial join operations on the input tables that none of the inputs is indexed. Over the last decade, several spatial Join algorithms for the input tables with index have been extensively studied. Those algorithms show excellent performance over most spatial data, while little research on solving the performance degradation in the presence of skewed data has been attempted. Therefore, we propose a spatial hash strip join(SHSJ) algorithm that can refine the problem of skewed data in the conventional spatial hash Join(SHJ) algorithm. The basic idea is similar to the conventional SHJ algorithm, but the differences are that bucket capacities are not limited while allocating data into buckets and SSSJ algorithm is applied to bucket join operations. Finally, as a result of experiment using Tiger/line data set, the performance of the spatial hash strip join operation was improved over existing SHJ algorithm and SSSJ algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1520-1531
• /
• 1999

In this paper, we present a first step for developing a method of verifying both safety and correctness of object-oriented design specification. As first, we analyze the discrepancies, which can occur between requirements specification and design specification, to make clear target faults. Then, we propose a new design verification method which aims at detecting faults in the design specification. The key idea of the proposed framework is that all elements to be verified can be extracted based on the requirements specification, safety standards, and design specification given for the target product These elements are expressed using three kinds of tables for verification, and thus, the verification steps can be greatly simplified. Here, we assume that component library, standards for safety and design specification obtained from the Booch's object-oriented design method are given. At the beginning, the designers construct a design table based on a design specification, and the verifiers construct a correctness table and a safety table from component library and standards for safety Then, by comparing the items on three tables, the verifiers verification a given design specification and detect faults in it. Finally, using an example of object-oriented design specification, we show that faults concerning safety or correctness can be detected by the new design verification method.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.336-345
• /
• 2012

Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer, peer, or provider routes are preferred. Apparently, applying such constraints eliminates many "correct" paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.297-306
• /
• 2008

MJoin is proposed as an algorithm to join multiple data streams efficiently, whose characteristics are unpredictably changed. It extends a symmetric hash join to handle multiple data streams. Whenever a tuple arrives from a remote stream source, MJoin checks whether all of hash tables have matching tuples. However, when a join involves many data streams with low join selectivity, the performance of this checking process is significantly influenced by the checking order of hash tables. In this paper, we propose a BiHT-Join algorithm which extends MJoin to conduct this checking in a constant time regardless of a join order. BiHT-Join maintains a bit-vector which represents the existence of tuples in streams and decides a successful/unsuccessful join through comparing a bit-vector. Based on the bit-vector comparison, BiHT-Join can conduct a hash join only for successful joining tuples based on this decision. Our experimental results show that the proposed BiHT-Join provides better performance than MJoin in the processing of multiple streams.

• The Korean Journal of Applied Statistics
• /
• v.16 no.2
• /
• pp.455-467
• /
• 2003

There has been a long debate on the applicability of the chi-square approximation to statistics based on small sample size. Extending comparison results among Pearson chi-square Χ$^2$, generalized likelihood .ratio G$^2$, and the power divergence Ι(2/3) statistics suggested by Rudas(1986), recently developed disparity statistics (BWHD(1/9), BWCS(1/3), NED(4/3)) we compared and analyzed in this paper. By Monte Carlo studies about the independence model of two dimension contingency tables, the conditional model and one variable independence model of three dimensional tables, simulated 90 and 95 percentage points and approximate 95% confidence intervals for the true percentage points are obtained. It is found that the Χ$^2$, Ι(2/3), BWHD(1/9) test statistics have very similar behavior and there seem to be applcable for small sample sizes than others.

• Environmental and Resource Economics Review
• /
• v.24 no.1
• /
• pp.109-139
• /
• 2015

Referring to many previous research on the statistical differences in the figures of energy balance table between that of KEEI and IEA, a study is conducted to provide with a framework for proper comparison, followed by the actual calculation of the differences. Major differences are found for energy oil with its size of over 32% differences in primary energy supply and in energy transformation sectors. In final energy consumption sector, naptha consumption for petro-chemical industry shows 14.58% differences. Overall final energy consumption figure of KEEI after its adjustment to net calorific value as is the case of that of IEA is 3.58% larger than that of IEA. Considering the fact that energy balance table provides the basic information for the understanding of energy sector, further studies seem to be necessary for proper adjustment of current status.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• Journal of Digital Contents Society
• /
• v.11 no.1
• /
• pp.91-97
• /
• 2010

Flash memory has been used by many digital devices for data storage, exploiting the advantages of non-volatility, low power, stability, and so on, with the help of high integrity, large capacity, and low price. As the fast growing popularity of flash memory, the density of it increases so significantly that its entire address mapping table becomes too big to be stored in SRAM. This paper proposes the associated page address cache with an efficient table management scheme for hybrid flash translation layer mapping. For this purpose, all tables are integrated into a map block containing entire physical page tables. Simulation results show that the proposed scheme can save the extra memory areas and decrease the searching time with less 2.5% of miss ratio on PC workload and can decrease the write overhead by performing write operation 33% out of total writes requested.

• Journal of Information Processing Systems
• /
• v.9 no.4
• /
• pp.511-537
• /
• 2013

Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.