• Language and Information
• /
• v.9 no.2
• /
• pp.69-83
• /
• 2005

This paper discusses the distribution of a null complementizer C, as opposed to an overt counterpart 'that', presenting empirical support both for and against the PF-merge analysis of C proposed by Boscovic and Lasnik (2003, henceafter B&L) who in turn attribute to the proposal in Pesetsky (1992) and Halle & Marantz (1993). In Section I, as a background, I discuss B&L's proposal that a null complementizer C is a PF-affix which undergoes a PF-merger operation at the PF component. In Section 2, after a brief sketch of the distribution of a null C mostly in bare-relatives, I explore the possibility of extending B&L's analysis to accomodate the null C's in the bare-relative constructions. In Section 3, I argue that despite some empirical difficulties, B&L's analysis of a null C as a PF-affix can still be maintained, if Adverb Fronting is an operation to Spec-C position. Furthermore, I propose a rule - PF Spell-Out Constraint - to account for the C-trace (i.e. that-trace) effect in relative constructions. With the PF Spell-Out Constraint and B&L's PF-merge account, the distribution of a null C can better be analyzed.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.92-98
• /
• 1994

The hypercube-like interconncetion network,X-hypercubes,has the same number of nodes and edges as conventional hypercubes.By slightly changing the interconneton way between nodes,however,X-hypercubes reduces the diameter by almost half.Thus the communication delay in X-hypercubes can be expected to be much lower than that in hypercubes. This paper gives a new definition of X-hypercubes establishing clear-cut condition of connection between two nodes.As appliction examples of the new definition,this paper presents simple embeddings of hypercubes in X-hypercubes and vice versa.This means that any programs written for hypercubes can be transported onto X-hypercubes and vice versa with minimal overhead.This paper also present bitonic merge sort for X-hypercubes by simulation that for hypercubes.

• Journal of Korea Multimedia Society
• /
• v.12 no.12
• /
• pp.1710-1717
• /
• 2009

Flash memory has become the most important storage media in mobile devices along with its attractive features such as low power consumption, small size, light weight, and shock resistance. However, a flash memory can not be written before erased because of its erase-before-write characteristic, which lead to some garbage collection when there is not enough space to use. In this paper, we propose a novel garbage collection scheme, called block-level buffer garbage collection. When it is need to do merge operation during garbage collection, the proposed scheme does not merge the data block and corresponding log block but also search the block-level buffer to find the corresponding block which will be written to flash memory in the next future, and then decide whether merge it in advance or not. Our experimental results show that the proposed technique improves the flash performance up to 4.6% by reducing the unnecessary block erase numbers and page copy numbers.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.11a
• /
• pp.247-250
• /
• 2008

An experimental investigation was conducted to clarify the combustion characteristics and merge characteristics of PMMA-GOX and PE-GOX hybrid motor using multi-port fuel grain configuration. The regression rate of multi-port fuel grain is higher than the regression rate of single-port fuel grain by thermal conduction and chamber pressure. The merge of multi-port has an effect on hybrid rocket performance by change of a combustion area.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.99-109
• /
• 2004

Most traffic congestion on a freeway occurs in the merge area, where conflicts between mainline traffic and on-ramp traffic are frequently generated. So far, research on the merge area has mainly dealt with free flow traffic and research on the congested traffic at the merge area is rare. This study investigates the relationships between mainline traffic and on-ramp traffic at three different segments of the merge area. For this purpose, new indicators based on such traffic variables as flow, speed, and density are used. The results show that a negative relationship exists between mainline and on-ramp flow. It is also found that the speed and the density of the right two lanes in the mainline traffic are significantly affected by the on-ramp flow. Based on the correlation analysis of the indicators, it is confirmed that the ramp influence area is the right two lanes of the freeway mainline. The revealed relationships between mainline and on-ramp traffic may help to analyze the capacity of the downstream freeway segment of the merging area in congested traffic. The findings of this studyalso provide a basis to develop a model that estimates the merge traffic volume in congested traffic, which is neither theoretically nor empirically sound in most other traffic flow models developed so far.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.178-184
• /
• 2013

In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.

• Journal of Korean Society of Transportation
• /
• v.21 no.3
• /
• pp.107-120
• /
• 2003

Over the decades, a lot of studies have dealt with the traffic characteristics and phenomena at a merging area. However, relatively few analytical techniques have been developed to evaluate the traffic flow at the area and, especially, the ramp merging capacity has rarely been. This study focused on the merging behaviors that were characterized by the relationship between the shoulder lane flow and the on-ramp flow, and modeled these behaviors to determine ramp merge capacity by using gap acceptance theory. In the process of building the model, both an ideal mergence and a forced mergence were considered when ramp-merging vehicles entered the gap provided by the flow of the shoulder lane. In addition, the model for the critical gap was proposed because the critical gap was the most influential factor to determine merging capacity in the developed models. The developed models showed that the merging capacity value was on the increase as the critical gap decreased and the shoulder lane volume increased. This study has a meaning of modeling the merging behaviors including the forced merging type to determine ramp merging capacity more precisely. The findings of this study would help analyze traffic phenomena and understand traffic behaviors at a merging area, and might be applicable to decide the primary parameters of on-ramp control by considering the effects of ramp merging flow.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Journal of Computing Science and Engineering
• /
• v.3 no.2
• /
• pp.109-126
• /
• 2009

Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain. Given a set of correspondences between two taxonomies, it is often necessary to "merge" the taxonomies, thereby creating a unied taxonomy (e.g., that can then be used by data integration and discovery applications). We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints. Two taxa Nand M can be related using (disjunctions of) the ve base relations in RCC-5: M; N ${\subseteq}$M; N ${\supseteq}$; N ${\oplus}$M (partial overlap of Nand M); and N ! M (disjointness: N ${\cap}$M = ${\varnothing}$). RCC-5 is increasingly being adopted by scientists to specify mappings between large biological taxonomies. We discuss the properties of the proposed merge algorithm and evaluate our approach using real-world taxonomies.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.1
• /
• pp.150-153
• /
• 2015

An energy-efficient 64-bit prefix adder is proposed for micro-server processors based on both semidynamic and bypassing structures. Prefix adders consist of three main stages i.e. propagate-generate (PG) stage, carry merge (CM) tree, and sum generators. In this architecture, the PG and CM stages consume most of the power because these are based on domino circuits. This letter proposes a semidynamic PG stage for its energy-efficiency. In addition, we adopt the bypassing structure on the CM tree to reduce its switching activity. Experimental results show 19.1% improvement of energy efficiency from prior art.