• Geophysics and Geophysical Exploration
• /
• v.11 no.2
• /
• pp.153-160
• /
• 2008

Seismic modeling is used to simulate wave propagation in the earth. Although the earth's subsurface is usually semi-infinite, we cannot handle the semi-infinite model in seismic modeling because of limited computational resources. For this reason, we usually assume a finite-sized model in seismic modeling. In that case, we need to eliminate the edge reflections arising from the artificial boundaries introducing a proper boundary condition. In this study, we changed three kinds of boundary conditions (sponge boundary condition, Clayton and Engquist's absorbing boundary condition, and Higdon's transparent boundary condition) so that they can be applied in elastic wave modeling for anisotropic media. We then apply them to several models whose Poisson's ratios are different. Clayton and Engquist's absorbing boundary condition is unstable in both isotropic and anisotropic media, when Poisson's ratio is large. This indicates that the absorbing boundary condition can be applied in anisotropic media restrictively. Although the sponge boundary condition yields good results for both isotropic and anisotropic media, it requires too much computational memory and time. On the other hand, Higdon's transparent boundary condition is not only inexpensive, but also reduce reflections over a wide range of incident angles. We think that Higdon's transparent boundary condition can be a method of choice for anisotropic media, where Poisson's ratio is large.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.4
• /
• pp.17-22
• /
• 2012

Convolution filtering methods have been widely applied to various digital signal processing fields for image blurring, sharpening, edge detection, and noise reduction, etc. According to their application purpose, the filter mask size or shape and the mask value are selected in advance, and the designed filter is applied to input image for the convolution processing. In this paper, we proposed an image processing acceleration method for the convolution processing by using two-dimensional Look-up table (LUT) and overlap-region buffering technique. First, based on the fixed convolution mask value, the multiplication operation between 8 or 10 bit pixel values of the input image and the filter mask values is performed a priori, and the results memorized in LUT are referred during the convolution process. Second, based on symmetric structural characteristics of the convolution filters, inherent duplicated operation region is analysed, and the saved operation results in one step before in the predefined memory buffer is recalled and reused in current operation step. Through this buffering, unnecessary repeated filter operation on the same regions is minimized in sequential manner. As the proposed algorithms minimize the computational amount needed for the convolution operation, they work well under the operation environments utilizing embedded systems with limited computational resources or the environments of utilizing general personnel computers. A series of experiments under various situations verifies the effectiveness and usefulness of the proposed methods.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.896-905
• /
• 2010

The sensor networks can be used attractively for various application areas. Time synchronization is important for any Ubiquitous Sensor Networks (USN) systems. USN makes extensive use of synchronized time in many contexts for data fusion. However existing time synchronization protocols are available only for homogeneous sensor nodes of USN. It needs to be extended or redesigned in order to apply to the USN with heterogeneous sensor nodes. Because heterogeneous sensor nodes have different clock sources with the SinkNode of USN, it is impossible to be synchronized global time. In addition, energy efficiency is one of the most significant factors to influence the design of sensor networks, as sensor nodes are limited in power, computational capacity, and memory. In this paper, we propose specific time synchronization based on master-slave topology for the global time synchronization of USN with heterogeneous sensor nodes. The time synchronization master nodes are always able to be synchronized with the SinkNode. Then time synchronization master nodes enable time synchronization slave nodes to be synchronized sleep periods. The proposed master-slave time synchronization for heterogeneous sensor nodes of USN is also helpful for power saving by maintaining maximum sleep time.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.113-124
• /
• 2009

With increasing multicore system, much effort has been put on the performance improvement of its application. Because multicore system has multiple processing devices in one system, its processing power increases compared to the single core system. However in many cases the advantages of multicore can not be exploited fully because the existing software and hardware were designed to be suitable for single core. When the existing software runs on multicore, its performance improvement is limited by the bottleneck of sharing resources and the inefficient use of cache memory on multicore. Therefore, according as the number of core increases, it doesn't show performance improvement and shows performance drop in the worst case. In this paper we propose a method of performance improvement of multicore system by applying Flow-Level Parallelism to the existing TCP/IP network application and operating system. The proposed method sets up the execution environment so that each core unit operates independently as much as possible in network application, TCP/IP stack on operating system, device driver, and network interface. Moreover it distributes network traffics to each core unit through L2 switch. The proposed method allows to minimize the sharing of application data, data structure, socket, device driver, and network interface between each core. Also it allows to minimize the competition among cores to take resources and increase the hit ratio of cache. We implemented the proposed methods with 8 core system and performed experiment. Experimental results show that network access speed and bandwidth increase linearly according to the number of core.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.739-752
• /
• 2002

Recently, to utilize the limited bandwidth effectively, the concept of partial response (PR) signaling has widely been adopted in both the high-speed data transmission and high-density digital recording/playback systems such as digital microwave, digital subscriber loops, hard disk drives, digital VCR's and digital versatile recordable disks and so on. This paper is concerned with adaptive equalization of partial response channels particularly for the magnetic recording channels. Specifically we study how the PR channel equalizers work for different choices of desired or reference signals used for adjusting the equalizer weights. In doing so, we consider three different configurations that are actually implemented in the commercial products mentioned above. First of all, we show how to compute the theoretical values of the optimum Wiener solutions derived by minimizing the mean-squared error (MSE) at the equalizer output. Noting that this equalizer MSE measure cannot be used to fairly compare the three configurations, we propose to use the data MSE that is computer just before the final detector for the underlying PR system. We also express the data MSE in terms of the channel impulse response values, source data power and additive noise power, thereby making it possible to compare the performance of the configurations under study. The results of extensive computer simulation indicate that our theoretical derivation is correct with high precision. Comparing the three configurations, it also turns out that one of the three configurations needs to be further improved in performance although it has an apparent advantage over the others in terms of memory size when implemented using RAM's for the decision feedback part.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.357-364
• /
• 2014

The first mission for the IoT based hyper-connectivity communication is developing a device-to-device communication technique in infra-less low-power and lossy networks. In a low-power and lossy wireless network, IoT devices and routers cannot keep the original path toward the destination since they have the limited memory. Different from the previous light-weight routing protocols focusing on the reduction of the control messages, the proposed scheme provides the light-weight IPv6 address auto-configuration, IPv6 neighbor discovery and routing protocol in a IoT capable infra-less wireless networks with the bloom filer and enhanced rank concepts. And for the first time we evaluate our proposed scheme based on the modeling of various probability distributions in the IoT environments with the lossy wireless link. Specifically, the proposed enhanced RPL based light-weight routing protocol improves the robustness with the multi-paths locally established based on the enhanced rank concepts even though lossy wireless links are existed. We showed the improvements of the proposed scheme up to 40% than the RPL based protocol.

• Cross-Cultural Studies
• /
• v.43
• /
• pp.405-428
• /
• 2016

The purpose of this paper is to examine the narrative-building method and the post-historical descriptive aspects of the movie Paradise in Service, which deals with the modern history of Taiwan. Although Paradise in Service tells the history of a certain time period, it focuses on the anguish and agony felt by people who lived during that age rather than on the meaning of historical events or interpretation of the past in terms of official historical discourse. That is, as it avoids looking at the present by composing a narrative in the descriptive historical context and from bearing weight from the viewpoint of realism, it gains the possibility of establishing a new field of discourse through a post-historical discussion using descriptive historical texts. However, the movie tries to create fantasy through a special type of licensed prostitution as a means of post-historical description. In other words, when this movie tries to reproduce the microscopic history of common people in trouble because of a historical tragedy, it considers only men and excludes "weak" women. Thus, although Paradise in Service has meaning in that it gives an example of how movies can disrupt official historical discourse and group memory and rewrite history by focusing on individuals, it is limited by its male-centrism.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.96-110
• /
• 2018

As the development of ICT has made it easier to collect various traffic information, research on creating new traffic attributes is drawing attention. Estimation and forecasts of demand and traffic volume are one of the main indicators that are essential to traffic operation, assuming that the traffic pattern at a particular node or link is repeated. Traditionally, a survey method was used to demonstrate this similarity on trip behavior. However, the method was limited to achieving high accuracy with high costs and responses that relied on the respondents' memory. Recently, as traffic data has become easier to gather through ETC system, smart card, studies are performed to identify the regularity of trip in various ways. In, this study, route-level trip data collected in Daegu metropolitan city were analyzed to confirm that individual traveler forms a spatially similar trip chain over several days. For this purpose, we newly define the concept of spatial trip regularity and assess the spatial difference between daily trip chains using the sequence alignment algorithm, Dynamic Time Warping. In addition, we will discuss the applications as the indicators of fixed traffic demand and transportation services.