• Language and Information
• /
• v.4 no.2
• /
• pp.41-54
• /
• 2000

In this paper we present a unified account for -ina a Korean particle which displays a few unexpected differences from English, or despite the fact that they are in a virtual counterpart relation in coordination between the two languages We first reach an empirical generalization that -ina use mostly in a disjunctive coordination is construed conjunctively in a generic sentence. Then we conclude that the various use of -ina can be naturally accounted for by modifying the notion of 'second-best set' in the existing work of K Lee(1993).(Kyung Hee University)

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.389-394
• /
• 2008

The purpose of this research was to develop a methodology to determine whether conjunctive surface water and groundwater management could significantly reduce deficits in a river basin with a relatively limited alluvial aquifer. The Geum River basin is one of major river basins in South Korea. The upper region of the Geum River basin is typical of many river basins in Korea where the shape of river basin is narrow with small alluvial aquifer depths from 10m to 20m and where most of the groundwater pumped comes quickly from the steamflow. The basin has two surface reservoirs, Daecheong and Yongdam. The most recent reservoir, Yongdam, provides water to a trans-basin diversion, and therefore reduces the water resources available in the Geum River basin. After the completion of Yongdam reservoir, the reduced water supply in the Geum basin resulted in increasing conflicts between downstream water needs and required instream flows, particularly during the low flow season. Historically, the operation of groundwater pumping has had limited control and is administered separately from surface water diversions. Given the limited size of the alluvial aquifer, it is apparent that groundwater pumping is essentially taking its water from the stream. Therefore, the operation of the surface water withdrawals and groundwater pumping must be considered together. The major component of the conjunction water management in this study is a goal-programmin g based optimization model that simultaneously considers surface water withdrawals, groundwater pumping and instream flow requirements. A 10-day time step is used in the model. The interactions between groundwater pumping and the stream are handled through the use of response and lag coefficients. The impacts of pumping on streamflow are considered for multiple time periods. The model is formulated as a linear goal-programming problem that is solved with the commercial LINGO optimization software package.

• Journal of Korea Water Resources Association
• /
• v.43 no.7
• /
• pp.625-633
• /
• 2010

An integrated water resources management is highly required to use efficient water and preserve water quality due to the limits of water resources development and water pollution. K-WEAP was developed, which supports the water resources planning and evaluation within a fully integrated interactive system. In this study, we present three applications of K-WEAP. First, we examined the usefulness of K-WEAP as a water resources planning tool through its application to the National Water Resources Plan. Second, the conjunctive use of surface water and groundwater in the Geum river basin with K-WEAP was evaluated, and its results show how to support to set up a sustainable groundwater management plan. Finally, we confirmed the function of the integrated water quantity and quality management in K-WEAP, which conducted by comparing the simulated results of water quality in both QUAL2E and K-WEAP.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.227-227
• /
• 2015

The Wairarapa Valley occupies a predominantly rural area in the lower North Island of New Zealand. It supports a mix of intensive farming (dairy), dry stock farming (sheep and beef cattle) and horticulture (including wine grapes). The valley floor is traversed by the Ruamahanga River, the largest river in the Wellington region with a total catchment area of 3,430 km2. Environmental, cultural and recreational values associated with this Ruamahanga River are very high. The alluvial gravel and sand aquifers of the Wairarapa Valley, support productive groundwater aquifers at depths of up to 100 metres below ground while the Ruamahanga River and its tributaries present a further source of water for users. Water is allocated to users via resource consents by Greater Wellington Regional Council (GWRC). With intensifying land use, demand from the surface and groundwater resources of the Wairarapa Valley has increased substantially in recent times and careful management is needed to ensure values are maintained. This paper describes the approach being taken to manage water resources in the Wairarapa Valley and redefine appropriate limits of sustainable water use. There are three key parts: Quantifying the groundwater resource. A FEFLOW numerical groundwater flow model was developed by GWRC. This modelling phase provided a much improved understanding of aquifer recharge and abstraction processes. It also began to reveal the extent of hydraulic connection between aquifer and river systems and the importance of moving towards an integrated (conjunctive) approach to allocating water. Development of a conjunctive management framework. The FEFLOW model was used to quantify the stream flow depletion impacts of a range of groundwater abstraction scenarios. From this, three abstraction categories (A, B and C) that describe diminishing degrees of hydraulic connection between ground and surface water resources were mapped in 3 dimensions across the Valley. Interim allocation limits have been defined for each of 17 discrete management units within the valley based on both local scale aquifer recharge and stream flow depletion criteria but also cumulative impacts at the valley-wide scale. These allocation limits are to be further refined into agreed final limits through a community-led decision making process. Community involvement in the limit setting process. Historically in New Zealand, limits for sustainable resource use have been established primarily on the basis of 'hard science' and the decision making process has been driven by regional councils. Community involvement in limit setting processes has been through consultation rather than active participation. Recent legislation in the form of a National Policy Statement on Freshwater Management (2011) is reforming this approach. In particular, collaborative consensus-based decision making with active engagement from stakeholders is now expected. With this in mind, a committee of Wairarapa local people with a wide range of backgrounds was established in 2014. The role of this committee is to make final recommendations about resource use limits (including allocation of water) that reflect the aspirations of the communities they represent. To assist the committee in taking a holistic view it is intended that the existing numerical groundwater flow models will be coupled with with surface flow, contaminant transport, biological and economic models. This will provide the basis for assessing the likely outcomes of a range of future land use and resource limit scenarios.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.395-408
• /
• 2004

A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).

• Journal of Korea Water Resources Association
• /
• v.42 no.5
• /
• pp.415-424
• /
• 2009

Artificial injection of surplus surface water during wet seasons and recovery is one of possible solutions for conjunctive uses of surface water and groundwater. The methodology is especially attractive for regions of monsoon type weather. In this work a simulation-optimization model is developed to identify an optimal injection system to sustain an over-exploiting freshwater pumping well. The injection well is to be operated during wet seasons only while the pumping well is to be operated throughout an entire year. The objective function is the minimization of injected volume of freshwater. Saltwater intrusion and dry wells are considered as constraints. An example application is made on a small hypothetical island with poor hydrogeologic conditions. The optimization model is successful in determining optimal injection locations and rates for various cases.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.2039-2043
• /
• 2007

Like other major river basin systems in the West of the United States the Platte River Basin are faced with the challenges of allocating more water for plant and animal species. A part of the Central Platte River was designated as critical habitat for the whooping crane in 1978. The water allocation system in the Platte River Basin is dominated by the Prior Appropriation Doctrine, which allocates water according to the priorities based on the date of water use. The Platte River Basin segregated into five subregions for purpose of analysis. 24 years of historic records of monthly flow and all the demands were complied. The simulation of river basin modeling includes physical operation of the system including water allocation by water rights and interstate compact agreements, reservoir operations, and diversion with consumptive use and return flow. MODSIM, a generalized river basin network model, was used for estimating the timing and magnitude of impacts on river flows and diversions associated with water transfers from each region. A total of 20 alternatives were considered, covering transfers from each of the five regions of basin with several options. The result shows that the timing and availability of augmented water at the critical habitat is not only a function of use by junior appropriators, but also of river losses, and timing of return flows.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.878-882
• /
• 2004

지하수를 이용한 물 문제 해결 방법은 여러 수공학자들에 의해 연구되어 왔고 많은 성과를 이루었다. 하지만, 과도한 지하수 개발은 새로운 공학적 문제를 야기하게 되어 각 수자원에 내한 개별적인 분석 단계를 지나 여러 수자원을 연계하여 이용할 수 있는 기법들이 연구되고 있다. 이 방법 중 하나로 지표수와 지하수를 연계 이용하는 방법이 연구되었고, 개발 대상 지역에 대한 우선순위 결정을 위해 계층분석과정(Analytic Hierarchy Process, AHP)이 적용되었다. 이리한 적지 분석을 위한 시스템(SASCU)을 GIS와 연계하여 개발함으로써 개랄 가능 후보지에 대한 개발 우선순위 결정에 도움이 괼될것으로 사료된다.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.34-40
• /
• 2024

Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.