• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.715-718
• /
• 2014

맵리듀스(MapReduce)는 대용량 데이터의 병렬 처리에 사용되는 프로그래밍 모델이다. 데이터 큐브(data cube)는 대용량 데이터의 다차원 분석에 널리 사용되는 연산자로서, 주어진 차원 애트리뷰트들의 모든 가능한 조합에 대한 group-by 를 계산한다. 차원 애트리뷰트가 n 개일 때, 데이터 큐브는 총 $2^n$ 개의 group-by 를 계산한다. 본 논문은 맵리듀스 환경에서 데이터 큐브를 효율적으로 계산하는 방법을 제안한다. 제안 방법은 $2^n$ 개의 group-by 를 분할하고 이들을 ${\lceil}n/2{\rceil}$개의 맵리듀스 잡(job)을 통해 단계적으로 계산한다. 제안 방법은 각 맵리듀스 잡에서 맵 함수가 출력하는 중간결과의 크기를 최소화함으로써 총 계산 비용을 크게 줄인다. 실험을 통해 제안 방법은 기존 방법에 비해 데이터 큐브를 더 빠르게 계산함을 보인다.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.2
• /
• pp.78-85
• /
• 1994

Impact forces are acting on the fore part of a body entering water and those are function o the shape of the fore part and entrance angle. In this paper, impact forces are computed for the flat faced body with arbitrary entrance angle The geometric characteristics of the wetted surface of the body are complicated. The surface is divided into several smooth parts and each of them is represented by a bi-cubic B-spline. The free surface condition, $\phi=0$, is applied at the undisturbed free surface and he boundary value problem is analized by using Green's function.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.69-74
• /
• 2023

In this paper we review techniques for building and analyzing wavelets on irregular point sets in one and two dimensions. In particular we focus on subdivision schemes and commutation. Subdivision means the skill that approximates the initial lines or mesh into a tender curve or a curved surface by continuous partitioning operation. The key to generalizing wavelet constructions to non-traditional settings is the use of generalized subdivision. The first generation setting is already connected with subdivision schemes, but they become even more important in the construction of second generation wavelets. Subdivision schemes provide fast algorithms, create a natural multi-resolution structure, and yield the underlying scaling functions and wavelets we seek.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.512-522
• /
• 2003

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Typically, the size of the chip required to implement the circuit depends on both the maximum number of the LUT blocks required to implement the function of each subcircuit and the maximum number of micro-registers to store results over context switches in the same time. Therefore, many partitioning or synthesis methods try to minimize these two factors. In this paper, we present a new estimation technique to find the lower bound on the number of micro-registers which can be obtained by any synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of the previous work and even the future work. If the estimated lower bound exactly matches the actual number in the actual design result, we can say that the result is guaranteed to be optimal. In contrast, if they do not match, the following two cases are expected: we might estimate a better (more exact) lower bound or we find a new synthesis result better than those of the previous work. Our experimental results show that there are some differences between the numbers of micro-registers and our estimated lower bounds. One reason for these differences seems that our estimation tries to estimate the result with the minimum micro-registers among all the possible candidates, regardless of usage of other resources such as LUTs, while the previous work takes into account both LUTs and micro-registers. In addition, it implies that our method may have some limitation on exact estimation due to the complexity of the problem itself in sense that it is much more complicated than LUT estimation and thus needs more improvement, and/or there may exist some other synthesis results better than those of the previous work.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.3
• /
• pp.329-335
• /
• 2011

The finite element method (FEM) has been used for various fields like mathematics and engineering. However, the FEM has a difficulty in describing the geometric shape exactly due to its property of piecewise linear discretization. Recently, however, a so-called isogeometric analysis method that uses the non-uniform rational B-spline(NURBS) basis function has been developed. The NURBS can be used to describe the geometry exactly and play a role of basis functions for the response analysis. Nevertheless, constructing the NURBS basis functions in analysis is as costly as a meshing process in the FEM. Since the isogeometric method shares geometric data with CAD, it is possible to intactly import the model data from commercial CAD tools. In this paper, we use the Rhinoceros 3D software to create CAD models and export in the form of STEP file. The information of knot vectors and control points in the NURBS is utilized in the isogeometric analysis. Through some numerical examples, the accuracy of isogeometric method is compared with that of FEM. Also, the efficiency of the isogeometric method that includes the CAD and CAE in a unified framework is verified.

• Economic and Environmental Geology
• /
• v.36 no.3
• /
• pp.243-255
• /
• 2003

The mathematical models for GIS-based spatial data integration have been developed for geological applications such as mineral potential mapping or landslide susceptibility analysis. Among various models, the effectiveness of fuzzy logic based integration of multiple sets of geological data is investigated and discussed. Unlike a traditional target-driven fuzzy integration approach, we propose a data-driven approach that is derived from statistical relationships between the integration target and related spatial geological data. The proposed approach consists of four analytical steps; data representation, fuzzy combination, defuzzification and validation. For data representation, the fuzzy membership functions based on the likelihood ratio functions are proposed. To integrate them, the fuzzy inference network is designed that can combine a variety of different fuzzy operators. Defuzzification is carried out to effectively visualize the relative possibility levels from the integrated results. Finally, a validation approach based on the spatial partitioning of integration targets is proposed to quantitatively compare various fuzzy integration maps and obtain a meaningful interpretation with respect to future events. The effectiveness and some suggestions of the schemes proposed here are illustrated by describing a case study for landslide susceptibility analysis. The case study demonstrates that the proposed schemes can effectively identify areas that are susceptible to landslides and ${\gamma}$ operator shows the better prediction power than the results using max and min operators from the validation procedure.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.53-58
• /
• 2005

The use of computers for control and monitoring of industrial process has expanded greatly in recent years. The computer used in such applications is shared between a certain number of time-critical control and monitor function and non time-critical batch processing job stream. Embedded systems encompass a variety of hardware and software components which perform specific function in host computer. Many embedded system must respond to external events under certain timing constraints. Failure to respond to certain events on time may either seriously degrade system performance or even result in a catastrophe. In the design of real-time embedded system, decisions made at the architectural design phase greatly affect the final implementation and performance of the system. Flexibility indicates how well a particular system architecture can tolerate with respect to satisfying real-time requirements. The degree of flexibility of real-time system architecture indicates the capability of the system to tolerate perturbations in timing related specifications. Given degree of flexibility, one may compare and rank different implementations. A system with a higher degree of flexibility is more desirable. Flexibility is also an important factor in the trade-off studies between cost and performance. In this paper, it is identified the need for flexibility function and shows that the existing real-time analysis result can be effective. This paper motivated the need for a flexibility for the efficient analysis of potential design candidates in the architectural design exploration or real time embedded system.

• Journal of Educational Research in Mathematics
• /
• v.20 no.1
• /
• pp.85-102
• /
• 2010

Linear programming(LP) is useful for finding the best way in a given condition for some list of requirements represented as linear equations. This study analysed LP in mathematics contexts and LP in school mathematics contexts, considered learning process of LP from an epistemological point of view, and explored a hypothetical learning trajectory of LP. The differences between mathematics contexts and school mathematics contexts are whether they considered that the convex polytope $\Omega$ is feasible/infeasible or bounded/unbounded or not, and whether they prove the theorem that the optimum is always attained at a vertex of the polyhedronor not. And there is a possibility that students could not understand what is maximum and minimum of a linear function when the domain of the function is limited. By considering these three aspects, we constructed hypothetical learning trajectory consisted of 4 steps. The first step is to see a given linear expression as linear function, the second step is to partition a given domain by straight lines, the third step is to construct the conception of y-intercept by relating lines and the range of k, and the forth step is to identify whether there exists the optimum in a given domain or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• The Journal of the Korea Contents Association
• /
• v.12 no.1
• /
• pp.48-58
• /
• 2012

With the development of sensing devices and wireless communication technologies, wireless sensor networks are composed of a large number of sensor nodes that are equipped with limited computing performance and restricted communication capabilities. Besides, the sensor nodes are deployed in hostile or unattended environments. Therefore, the wireless sensor networks are vulnerable to security. In particular, the fatal damage may be occurred when data are exposed in real world applications. Therefore, it is important for design requirements to be made so that wireless sensor networks provide the strong security. However, because the conventional security schemes in wired networks did not consider the limited performance of the sensor node, they are so hard to be applied to wireless sensor networks. In this paper, we propose a secure multipath transmission scheme based on one-way hash functions in wireless sensor networks considering the limited performance of the wireless sensor nodes. The proposed scheme converts a sensor reading based on one of one-way hash functions MD5 in order to make it harder to be cracked and snooped. And then, our scheme splits the converted data and transfers the split data to the base station using multi-path routing. The experimental results show that our proposed scheme consumes the energy of just about 6% over the existing security scheme.