• ETRI Journal
• /
• v.44 no.2
• /
• pp.208-219
• /
• 2022

Crime amount prediction is crucial for optimizing the police patrols' arrangement in each region of a city. First, we analyzed spatiotemporal correlations of the crime data and the relationships between crime and related auxiliary data, including points-of-interest (POI), public service complaints, and demographics. Then, we proposed a crime amount prediction model based on 2D convolution and long short-term memory neural network (2DCONV-LSTM). The proposed model captures the spatiotemporal correlations in the crime data, and the crime-related auxiliary data are used to enhance the regional spatial features. Extensive experiments on real-world datasets are conducted. Results demonstrated that capturing both temporal and spatial correlations in crime data and using auxiliary data to extract regional spatial features improve the prediction performance. In the best case scenario, the proposed model reduces the prediction error by at least 17.8% and 8.2% compared with support vector regression (SVR) and LSTM, respectively. Moreover, excessive auxiliary data reduce model performance because of the presence of redundant information.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.11-19
• /
• 2017

In this paper, we propose a hypervisor for embedded systems based on ARM microprocessor. The proposed hypervisor makes it possible to run several real-time kernels concurrently on a single embedded system by virtualizing its microprocessor. With assistance of MMU, it supports virtual memory which enables each guest operating system has its own address space. Exploiting the fact that most embedded systems use memory-mapped I/O device, it provides a mechanism to distribute an external interrupt to virtual machines properly. It also achieves load balancing through live migration which moves a running virtual machine to other embedded system. Unlike other para-virtualization techniques, minor modifications are needed to run it on the hypervisor. Extensive performance measurement studies are conducted to show that the proposed hypervisor has enough potentiality of its real-world application.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.248-252
• /
• 2002

Many sensors such as a structured grid pattern generator, a laser, and CCD camera to information have been used, but most of algorithms for a calibration are inefficient memory and experiment data are required. In this paper, the calibration algorithm of a structured grid pattern based on triang is introduced to calculate 3D information in the real world. The beams generated from str pattern generator established horizontally with the CCD camera are projected on the calibn CCD camera observes the intersection plane of a light and an object plane. The 3D infon calculated using observed and calibration data. This proposed method in this paper has advantages such as a memory saving and an experimental data since the 3D information are obtained simply triangulation method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1041-1043
• /
• 1993

Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)＋dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].

• The Korean Journal of Archival Studies
• /
• no.45
• /
• pp.121-153
• /
• 2015

Struggles to gain acknowledgement of identity have a characteristic of movement to recover human dignity. Participants in this movement come to confirm themselves as the subject of rights and communicate one another, free from oppression. Being guaranteed the opportunity to participate in the public opinion formation process is an indispensable element of human rights. In 1980, though it was short and incomplete, Gwangju experienced communal autonomy under the condition that state power was temporarily stopped. The contents and memories of the Gwangju Democratization Movement that intended to protect autonomy of civil society, resisting pillage of state power, remain intact in the 1980 Archives for the May 18th. The 5.18 archives were registered in UNESCO's Memory of the World in 2011, with its value of human rights and protection of democracy being acknowledged. The 5.18 archives have memories of resistance and struggles for justice, and sacrifices and pains of citizens under oppressive political authority in Gwangju, 1980. Thus, these archives are related to the historical struggles for democracy, and suggest a lesson on the transition process towards democracy to us. Preservation and utilization of the documentary heritage constantly lead the memories of historical events to the present, and enable exchanges of experiences and ideas between the present and the future. This study, through the process of UNESCO's Memory of the World registration and post-registration process, beyond the value of archives, tries to examine how historical events are led to the present, through the archives and to discuss the other values of archives.

• Journal of the Korean Society for information Management
• /
• v.39 no.4
• /
• pp.159-189
• /
• 2022

The research aims to recommend strategies to promote PR activities of 'the Memory of the World(MoW)' on the websites. To achieve the goal, the researchers analyzed the current conditions of online PRs of the MoW in S. Korea by developing the standards/elements for analysis. The research examined the two main concepts of MoW and extracted the three core standards/elements for evaluating current online PRs of MoW through reviewing earlier studies: contents of PRs, ways of PRs, and features of media. The research examined PR activities on the 21 websites of 11 institutions which manage MoW in South Korea. The research found the significant features of the online PRs and suggested detailed strategies for improving the online PRs of MoW: first, it is required to emphasize the values of both preservation and utilization of MoW equally. Second, it is necessary to promote the PRs of MoW by using the way of 'user segmentation'. Third, it needs to develop the unit systems and/or services to integrate with related documentary heritages so that users can access documentary heritages effectively and efficiently. Finally, it is required to develop the guidelines or/and manuals to conduct and promote the PRs of the MoW by providing specific directions and methods of publicities.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.22 no.1
• /
• pp.27-46
• /
• 2011

The present paper is focused on Korea's inscribed heritages, digitization of the Tripitaka Koreana & miscellaneous buddhist scriptures, and public uses of the digital properties in order to describe the Digitization & Popularization of Printing Woodblocks of the Tripitaka Koreana and Miscellaneous Buddhist Scriptures, Memory of the World. The Goryeo Daejanggyeong or the Tripitaka Koreana and miscellaneous Buddhist sculptures refer to printing woodblocks of the Tripitaka(National Treasure No.32), and repositories (National Treasure No.52) where the woodblocks are stored. The woodblocks numbers 1,514 types/81,350 blocks/162,700 pages. Haein temple has worked the digital Tripitaka project 2009-2010 and The project for 2010 will focus on DB correction and modification, improvement of homepage that was made in 2009. For this, the focus was especially put on investigating current status and development plans of the digital Tripitaka project. In popularization of the digital Tripitaka, this study examined the Korea's utilization policy and current situation of knowledge resources about culture, successful cases of digital Tripitaka projects, and popularization strategies. This research can contribute to digitization of other cultural heritages and related researches in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.8
• /
• pp.1503-1517
• /
• 1994

Intelligent Motion Planning System(IMPS) is presented for a robot to achieve an efficient path toward the given target point in two dimensional unknown environment is constructed with unrestricted obstacle shapes. IMPS consists of three components for making intelligent motion. These components are real-time motion planning algorithm based on a discontinous boundary method, fuzzy neural network decision system for heuristic knowledge representation, and world modeling with forgetting and reinforcing memory cells. First of all, in real-time motion planning algorithm, the behavior-based architectural method is used to generate subgoal. A behavior generates a subgoal independently by using the method of discontinuous boundary in sensed area. The discontinuous boundary method is a new proposed fast obstacle avoidance algorithm. The second component is fuzzy neural network decision system for accomplishing the subgoal. The heuristic rules are imbedded on the fuzzy neural network to make an intelligent decision. The last one is a forgetting, reinforcing memory technique for the construction of external world map. The activation values of all activated memory cells in grid space are decreased monotonically and after all they are burned out. Therefore, after sufficient journey, robot can have a stationary world map even if the dynaic obstacles exist. Using the IMPS, several simulations show the efficient achievement of target point in unknown enviroment with obstcles of various shapes.

• Journal of English Language & Literature
• /
• v.57 no.5
• /
• pp.813-838
• /
• 2011

Toni Morrison's ninth novel A Mercy delves into the colonial American history of the seventeenth century when Europeans began to migrate to the New World and when the first slaves were brought to Virginia. Morrison presents a diverse group of people such as white Europeans, an American Indian, a free black man, indentured servants, and slaves from Africa in order to explore the subjects of ownership, freedom and racism. She emphasizes the fact that most of the Europeans who came to America in the early seventeenth century were the people who were thrown out from the society such as felons, prostitutes, servants and children. By portraying how these castaways tried to settle in a new environment surrounded by unknown dangers and challenges, Morrison demystifies and reconstructs the myth of the birth of America as a nation state. In continuation of Morrison's writings about love and the betrayal of love, her novel A Mercy explores the subjects of trauma, memory and subjectivity by choosing the topic of motherly love and its betrayal which she dealt with poignantly in Beloved. The female protagonist, Florens, is given away by her mother in partial payment of debt incurred by the owner of Florens's mother. The traumatic memory of Florens's separation from her mother shapes Florence's character. She has to revisit the site of the original traumatic experiences of being given up by her mother in order to reconstruct her fragmented memory and past. The recurring dream of the traumatic incident that takes hold of Florens can be explained by the trauma theory of Freud, Cathy Caruth, Suzette Henke, and Judith Herman. The paper explores the self journey of Florens in which she faces the traumatic past and comprehends its meaning which enables her to construct her subjectivity by understanding the true meaning of being free and of owning oneself. In particular, it demonstrates how the process of writing a confession, a story about one's history, enables one to reclaim the traumatic experience and to locate it in the narrative memory.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.